Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291700252.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ClientsAndServers-PT-N2000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291700252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K 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.4K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N2000P0-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-15

=== Now, execution of the tool begins

BK_START 1620573344168

Running Version 0
[2021-05-09 15:15:45] [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-09 15:15:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:15:45] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-09 15:15:45] [INFO ] Transformed 25 places.
[2021-05-09 15:15:45] [INFO ] Transformed 18 transitions.
[2021-05-09 15:15:45] [INFO ] Parsed PT model containing 25 places and 18 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:15:45] [INFO ] Initial state test concluded for 5 properties.
FORMULA ClientsAndServers-PT-N2000P0-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 7 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 15:15:45] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-09 15:15:45] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 15:15:45] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-09 15:15:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 15:15:45] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-09 15:15:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
[2021-05-09 15:15:45] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 15:15:45] [INFO ] Flatten gal took : 15 ms
FORMULA ClientsAndServers-PT-N2000P0-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:15:45] [INFO ] Flatten gal took : 3 ms
[2021-05-09 15:15:45] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100018 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=2564 ) properties (out of 20) seen :8
Running SMT prover for 12 properties.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 15:15:45] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 15:15:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:45] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 19 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:15:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 15 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 15:15:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-09 15:15:46] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:15:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 18 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 14 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 22 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:15:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 7 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 14 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:15:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:15:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 15:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:15:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:15:46] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-09 15:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 7 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:15:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 15:15:46] [INFO ] Implicit Places using invariants in 13 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:15:46] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 15:15:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:15:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:15:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GT 1 s17), p1:(LEQ s15 s0)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 7 ms.
FORMULA ClientsAndServers-PT-N2000P0-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-02 finished in 288 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:15:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:15:46] [INFO ] Implicit Places using invariants in 18 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:15:46] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:15:46] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:15:46] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:15:46] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT s19 s8)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 135 ms.
Product exploration explored 100000 steps with 20000 reset in 78 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 63 ms.
Product exploration explored 100000 steps with 20000 reset in 75 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 8 place count 20 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 15 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 15 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 15 transition count 13
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 13 transition count 11
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 13 transition count 11
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 27 rules in 9 ms. Remains 13 /20 variables (removed 7) and now considering 11/18 (removed 7) transitions.
[2021-05-09 15:15:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-09 15:15:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:15:47] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/20 places, 11/18 transitions.
Product exploration explored 100000 steps with 20000 reset in 124 ms.
Product exploration explored 100000 steps with 20000 reset in 91 ms.
[2021-05-09 15:15:48] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:15:48] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:15:48] [INFO ] Time to serialize gal into /tmp/LTL15953742539720895535.gal : 0 ms
[2021-05-09 15:15:48] [INFO ] Time to serialize properties into /tmp/LTL13611324011597107232.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/LTL15953742539720895535.gal, -t, CGAL, -LTL, /tmp/LTL13611324011597107232.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/LTL15953742539720895535.gal -t CGAL -LTL /tmp/LTL13611324011597107232.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(Ci>CR)")))))))
Formula 0 simplified : !XXXXF"(Ci>CR)"
Detected timeout of ITS tools.
[2021-05-09 15:16:03] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:16:03] [INFO ] Applying decomposition
[2021-05-09 15:16:03] [INFO ] Flatten gal took : 3 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/graph13872314236385485101.txt, -o, /tmp/graph13872314236385485101.bin, -w, /tmp/graph13872314236385485101.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/graph13872314236385485101.bin, -l, -1, -v, -w, /tmp/graph13872314236385485101.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:16:03] [INFO ] Decomposing Gal with order
[2021-05-09 15:16:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:16:03] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:16:03] [INFO ] Flatten gal took : 16 ms
[2021-05-09 15:16:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:16:03] [INFO ] Time to serialize gal into /tmp/LTL4018988199926087993.gal : 1 ms
[2021-05-09 15:16:03] [INFO ] Time to serialize properties into /tmp/LTL9806699568908703295.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/LTL4018988199926087993.gal, -t, CGAL, -LTL, /tmp/LTL9806699568908703295.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/LTL4018988199926087993.gal -t CGAL -LTL /tmp/LTL9806699568908703295.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(gu3.Ci>gu3.CR)")))))))
Formula 0 simplified : !XXXXF"(gu3.Ci>gu3.CR)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin272682299099276020
[2021-05-09 15:16:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin272682299099276020
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/ltsmin272682299099276020]
Compilation finished in 179 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin272682299099276020]
Link finished in 39 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(X(X(X(<>((LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin272682299099276020]
LTSmin run took 147 ms.
FORMULA ClientsAndServers-PT-N2000P0-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N2000P0-03 finished in 31719 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 19 transition count 13
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 12 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 16 place count 15 transition count 11
Applied a total of 16 rules in 5 ms. Remains 15 /24 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-09 15:16:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:16:18] [INFO ] Implicit Places using invariants in 15 ms returned [9, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
[2021-05-09 15:16:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-09 15:16:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:16:18] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 13/24 places, 11/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 11 transition count 9
Applied a total of 4 rules in 2 ms. Remains 11 /13 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 15:16:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:16:18] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 15:16:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:16:18] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (GT s10 s9) (GT s8 s5)), p0:(GT s10 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3761 reset in 79 ms.
Stack based approach found an accepted trace after 179 steps with 4 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-04 finished in 230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 17 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 11 place count 17 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 19 place count 13 transition count 10
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 21 place count 12 transition count 9
Applied a total of 21 rules in 2 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 15:16:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:18] [INFO ] Implicit Places using invariants in 16 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
[2021-05-09 15:16:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 15:16:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:16:18] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 11/24 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Applied a total of 4 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 15:16:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:16:18] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 15:16:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:16:18] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s2 s7), p0:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 67 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
[2021-05-09 15:16:19] [INFO ] Flatten gal took : 0 ms
[2021-05-09 15:16:19] [INFO ] Flatten gal took : 0 ms
[2021-05-09 15:16:19] [INFO ] Time to serialize gal into /tmp/LTL16126365649750474491.gal : 0 ms
[2021-05-09 15:16:19] [INFO ] Time to serialize properties into /tmp/LTL3110741718338839849.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/LTL16126365649750474491.gal, -t, CGAL, -LTL, /tmp/LTL3110741718338839849.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/LTL16126365649750474491.gal -t CGAL -LTL /tmp/LTL3110741718338839849.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(MpG<3)")||(G("(CA<=Si)"))))))
Formula 0 simplified : !GF("(MpG<3)" | G"(CA<=Si)")
Detected timeout of ITS tools.
[2021-05-09 15:16:34] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:16:34] [INFO ] Applying decomposition
[2021-05-09 15:16:34] [INFO ] Flatten gal took : 2 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/graph14218581157959899970.txt, -o, /tmp/graph14218581157959899970.bin, -w, /tmp/graph14218581157959899970.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/graph14218581157959899970.bin, -l, -1, -v, -w, /tmp/graph14218581157959899970.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:16:34] [INFO ] Decomposing Gal with order
[2021-05-09 15:16:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:16:34] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:16:34] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:16:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-09 15:16:34] [INFO ] Time to serialize gal into /tmp/LTL12480878447311644577.gal : 0 ms
[2021-05-09 15:16:34] [INFO ] Time to serialize properties into /tmp/LTL6692474202799344137.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/LTL12480878447311644577.gal, -t, CGAL, -LTL, /tmp/LTL6692474202799344137.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/LTL12480878447311644577.gal -t CGAL -LTL /tmp/LTL6692474202799344137.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gi1.gu1.MpG<3)")||(G("(gu0.CA<=gu0.Si)"))))))
Formula 0 simplified : !GF("(gi1.gu1.MpG<3)" | G"(gu0.CA<=gu0.Si)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7604421806513517228
[2021-05-09 15:16:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7604421806513517228
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/ltsmin7604421806513517228]
Compilation finished in 86 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7604421806513517228]
Link finished in 28 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/ltsmin7604421806513517228]
LTSmin run took 445 ms.
FORMULA ClientsAndServers-PT-N2000P0-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N2000P0-07 finished in 31359 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((G(p1) U (F(p2) U p0)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:16:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:16:50] [INFO ] Implicit Places using invariants in 20 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:16:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:16:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:50] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s19 s2), p1:(GT s18 s5), p2:(LEQ s15 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1660 reset in 102 ms.
Product exploration explored 100000 steps with 1342 reset in 128 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 239 reset in 93 ms.
Product exploration explored 100000 steps with 1243 reset in 112 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 21 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 19 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 19 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 19 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 15:16:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 15:16:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:51] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 1787 reset in 174 ms.
Stack based approach found an accepted trace after 1510 steps with 54 reset with depth 86 and stack size 84 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-10 finished in 1391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((F(p1)&&F(p2)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 16 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 14 transition count 11
Applied a total of 17 rules in 2 ms. Remains 14 /24 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-09 15:16:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:51] [INFO ] Implicit Places using invariants in 15 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
[2021-05-09 15:16:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-09 15:16:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:16:51] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 13/24 places, 11/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 10 transition count 8
Applied a total of 6 rules in 1 ms. Remains 10 /13 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 15:16:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:16:51] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 15:16:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:16:51] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s9 s8), p2:(LEQ 1 s4), p0:(AND (LEQ s9 s8) (LEQ 1 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 99 ms.
Stack based approach found an accepted trace after 115 steps with 0 reset with depth 116 and stack size 116 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-11 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((((p0 U (p1||G(p0)))&&X(p2))||G(p3))))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:16:51] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:16:51] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:16:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:52] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:16:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:16:52] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-12 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={1} source=0 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p3 p1 (NOT p2)) (AND p3 p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(OR (GT 2 s17) (AND (GT s17 s14) (GT 2 s17))), p1:(AND (GT s17 s14) (GT 2 s17)), p0:(GT 2 s17), p2:(GT s17 s14)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 246 ms.
Knowledge obtained : [p3, (NOT p1), p0, (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 188 ms.
Product exploration explored 100000 steps with 0 reset in 249 ms.
[2021-05-09 15:16:53] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:16:53] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:16:53] [INFO ] Time to serialize gal into /tmp/LTL16071333766541856121.gal : 1 ms
[2021-05-09 15:16:53] [INFO ] Time to serialize properties into /tmp/LTL7608253840692635482.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/LTL16071333766541856121.gal, -t, CGAL, -LTL, /tmp/LTL7608253840692635482.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/LTL16071333766541856121.gal -t CGAL -LTL /tmp/LTL7608253840692635482.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((SwA<2)||((SwA>Si)&&(SwA<2)))"))||((("(SwA<2)")U(("((SwA>Si)&&(SwA<2))")||(G("(SwA<2)"))))&&(X("(SwA>Si)"))))))
Formula 0 simplified : !F(G"((SwA<2)||((SwA>Si)&&(SwA<2)))" | (("(SwA<2)" U ("((SwA>Si)&&(SwA<2))" | G"(SwA<2)")) & X"(SwA>Si)"))
Detected timeout of ITS tools.
[2021-05-09 15:17:08] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:17:08] [INFO ] Applying decomposition
[2021-05-09 15:17:08] [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/graph745472457137978781.txt, -o, /tmp/graph745472457137978781.bin, -w, /tmp/graph745472457137978781.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/graph745472457137978781.bin, -l, -1, -v, -w, /tmp/graph745472457137978781.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:17:08] [INFO ] Decomposing Gal with order
[2021-05-09 15:17:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:17:08] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-09 15:17:08] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:17:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:17:08] [INFO ] Time to serialize gal into /tmp/LTL18111684329167417579.gal : 1 ms
[2021-05-09 15:17:08] [INFO ] Time to serialize properties into /tmp/LTL4381352554441580626.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/LTL18111684329167417579.gal, -t, CGAL, -LTL, /tmp/LTL4381352554441580626.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/LTL18111684329167417579.gal -t CGAL -LTL /tmp/LTL4381352554441580626.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((gu6.SwA<2)||((gu6.SwA>gu6.Si)&&(gu6.SwA<2)))"))||((("(gu6.SwA<2)")U(("((gu6.SwA>gu6.Si)&&(gu6.SwA<2))")||(G("(gu6.SwA<2)"))))&&(X("(gu6.SwA>gu6.Si)"))))))
Formula 0 simplified : !F(G"((gu6.SwA<2)||((gu6.SwA>gu6.Si)&&(gu6.SwA<2)))" | (("(gu6.SwA<2)" U ("((gu6.SwA>gu6.Si)&&(gu6.SwA<2))" | G"(gu6.SwA<2)")) & X"(gu6.SwA>gu6.Si)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15181261266227809672
[2021-05-09 15:17:23] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15181261266227809672
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/ltsmin15181261266227809672]
Compilation finished in 123 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15181261266227809672]
Link finished in 34 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) U ((LTLAPp2==true)||[]((LTLAPp1==true))))&&X((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15181261266227809672]
LTSmin run took 250 ms.
FORMULA ClientsAndServers-PT-N2000P0-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N2000P0-12 finished in 31958 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 16 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 2 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 15:17:23] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:17:23] [INFO ] Implicit Places using invariants in 35 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
[2021-05-09 15:17:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 15:17:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:17:23] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 9/24 places, 8/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 15:17:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:17:23] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 15:17:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:17:23] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s4 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 57 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-13 finished in 162 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||F((p1||X(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:17:24] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-09 15:17:24] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:17:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:17:24] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:17:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:17:24] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s12 s13) (LEQ 1 s13)), p1:(GT s7 s2), p2:(GT s12 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2679 reset in 75 ms.
Product exploration explored 100000 steps with 2286 reset in 99 ms.
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2709 reset in 77 ms.
Product exploration explored 100000 steps with 2175 reset in 102 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 20 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 19 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 19 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 19 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 18 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 18 transition count 16
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 13 rules in 5 ms. Remains 18 /20 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 15:17:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2021-05-09 15:17:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:17:24] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/20 places, 16/18 transitions.
Product exploration explored 100000 steps with 457 reset in 95 ms.
Product exploration explored 100000 steps with 511 reset in 149 ms.
[2021-05-09 15:17:25] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:17:25] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:17:25] [INFO ] Time to serialize gal into /tmp/LTL16085654123641896894.gal : 1 ms
[2021-05-09 15:17:25] [INFO ] Time to serialize properties into /tmp/LTL4877281925359115986.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/LTL16085654123641896894.gal, -t, CGAL, -LTL, /tmp/LTL4877281925359115986.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/LTL16085654123641896894.gal -t CGAL -LTL /tmp/LTL4877281925359115986.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((G("((MpG<=MwU)||(MwU>=1))"))||(F(("(CG>SF)")||(X(F("(MpG>MwU)"))))))))
Formula 0 simplified : !G(G"((MpG<=MwU)||(MwU>=1))" | F("(CG>SF)" | XF"(MpG>MwU)"))
Detected timeout of ITS tools.
[2021-05-09 15:17:40] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:17:40] [INFO ] Applying decomposition
[2021-05-09 15:17:40] [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/graph2337420568065866925.txt, -o, /tmp/graph2337420568065866925.bin, -w, /tmp/graph2337420568065866925.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/graph2337420568065866925.bin, -l, -1, -v, -w, /tmp/graph2337420568065866925.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:17:40] [INFO ] Decomposing Gal with order
[2021-05-09 15:17:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:17:40] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:17:40] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:17:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 15:17:40] [INFO ] Time to serialize gal into /tmp/LTL4856707813907791775.gal : 1 ms
[2021-05-09 15:17:40] [INFO ] Time to serialize properties into /tmp/LTL17615788464351351389.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/LTL4856707813907791775.gal, -t, CGAL, -LTL, /tmp/LTL17615788464351351389.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/LTL4856707813907791775.gal -t CGAL -LTL /tmp/LTL17615788464351351389.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((G("((gu6.MpG<=gu6.MwU)||(gu6.MwU>=1))"))||(F(("(gu4.CG>gu4.SF)")||(X(F("(gu6.MpG>gu6.MwU)"))))))))
Formula 0 simplified : !G(G"((gu6.MpG<=gu6.MwU)||(gu6.MwU>=1))" | F("(gu4.CG>gu4.SF)" | XF"(gu6.MpG>gu6.MwU)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12026989271178246387
[2021-05-09 15:17:55] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12026989271178246387
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/ltsmin12026989271178246387]
Compilation finished in 105 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12026989271178246387]
Link finished in 34 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)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12026989271178246387]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-15 finished in 46110 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-09 15:18:10] [INFO ] Applying decomposition
[2021-05-09 15:18:10] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin7955210301716249206
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/graph15746505644244768464.txt, -o, /tmp/graph15746505644244768464.bin, -w, /tmp/graph15746505644244768464.weights], workingDir=null]
[2021-05-09 15:18:10] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 15:18:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:18:10] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 15:18:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:18:10] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 15:18:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15746505644244768464.bin, -l, -1, -v, -w, /tmp/graph15746505644244768464.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:18:10] [INFO ] Decomposing Gal with order
[2021-05-09 15:18:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:18:10] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:18:10] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:18:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 15:18:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality1842265853414800947.gal : 0 ms
[2021-05-09 15:18:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality7549215030106758997.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/LTLCardinality1842265853414800947.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7549215030106758997.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2021-05-09 15:18:10] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7955210301716249206
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/ltsmin7955210301716249206]

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/LTLCardinality1842265853414800947.gal -t CGAL -LTL /tmp/LTLCardinality7549215030106758997.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((G("((gu4.MpG<=gu4.MwU)||(gu4.MwU>=1))"))||(F(("(gu1.CG>gu1.SF)")||(X(F("(gu4.MpG>gu4.MwU)"))))))))
Formula 0 simplified : !G(G"((gu4.MpG<=gu4.MwU)||(gu4.MwU>=1))" | F("(gu1.CG>gu1.SF)" | XF"(gu4.MpG>gu4.MwU)"))
Compilation finished in 131 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7955210301716249206]
Link finished in 33 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)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7955210301716249206]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.251: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.251: LTL layer: formula: [](([]((LTLAPp0==true))||<>(((LTLAPp1==true)||X(<>((LTLAPp2==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.251: "[](([]((LTLAPp0==true))||<>(((LTLAPp1==true)||X(<>((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.251: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.255: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.249: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.251: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.257: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.257: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.265: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.265: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.275: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.390: DFS-FIFO for weak LTL, using special progress label 22
pins2lts-mc-linux64( 0/ 8), 0.390: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.390: State length is 25, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.390: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.390: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.390: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.390: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.523: ~90 levels ~960 states ~4600 transitions
pins2lts-mc-linux64( 7/ 8), 0.526: ~190 levels ~1920 states ~9912 transitions
pins2lts-mc-linux64( 7/ 8), 0.527: ~394 levels ~3840 states ~21456 transitions
pins2lts-mc-linux64( 4/ 8), 0.534: ~818 levels ~7680 states ~45872 transitions
pins2lts-mc-linux64( 4/ 8), 0.539: ~1648 levels ~15360 states ~95016 transitions
pins2lts-mc-linux64( 1/ 8), 0.561: ~3329 levels ~30720 states ~203344 transitions
pins2lts-mc-linux64( 1/ 8), 0.605: ~6674 levels ~61440 states ~414184 transitions
pins2lts-mc-linux64( 5/ 8), 0.691: ~13415 levels ~122880 states ~835400 transitions
pins2lts-mc-linux64( 1/ 8), 0.874: ~26995 levels ~245760 states ~1699448 transitions
pins2lts-mc-linux64( 5/ 8), 1.046: ~37943 levels ~491520 states ~2250232 transitions
pins2lts-mc-linux64( 1/ 8), 1.350: ~39990 levels ~983040 states ~3548616 transitions
pins2lts-mc-linux64( 2/ 8), 1.819: ~39987 levels ~1966080 states ~5669344 transitions
pins2lts-mc-linux64( 5/ 8), 3.177: ~39990 levels ~3932160 states ~10180680 transitions
pins2lts-mc-linux64( 4/ 8), 5.239: ~39975 levels ~7864320 states ~15909248 transitions
pins2lts-mc-linux64( 4/ 8), 9.898: ~39975 levels ~15728640 states ~29470696 transitions
pins2lts-mc-linux64( 4/ 8), 20.476: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 20.494:
pins2lts-mc-linux64( 0/ 8), 20.494: mean standard work distribution: 59.0% (states) 58.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 20.494:
pins2lts-mc-linux64( 0/ 8), 20.494: Explored 18595312 states 43601868 transitions, fanout: 2.345
pins2lts-mc-linux64( 0/ 8), 20.494: Total exploration time 20.100 sec (20.070 sec minimum, 20.084 sec on average)
pins2lts-mc-linux64( 0/ 8), 20.494: States per second: 925140, Transitions per second: 2169247
pins2lts-mc-linux64( 0/ 8), 20.494:
pins2lts-mc-linux64( 0/ 8), 20.494: Progress states detected: 99
pins2lts-mc-linux64( 0/ 8), 20.494: Redundant explorations: 14.9925
pins2lts-mc-linux64( 0/ 8), 20.494:
pins2lts-mc-linux64( 0/ 8), 20.494: Queue width: 8B, total height: 240003, memory: 1.83MB
pins2lts-mc-linux64( 0/ 8), 20.494: Tree memory: 379.4MB, 24.6 B/state, compr.: 24.1%
pins2lts-mc-linux64( 0/ 8), 20.494: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 20.494: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 20.494: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 20.494: Est. total memory use: 381.2MB (~1025.8MB 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, [](([]((LTLAPp0==true))||<>(((LTLAPp1==true)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7955210301716249206]
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, [](([]((LTLAPp0==true))||<>(((LTLAPp1==true)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7955210301716249206]
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:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 15:38:58] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:38:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality17425107287731286271.gal : 3 ms
[2021-05-09 15:38:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality18359246805335587711.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/LTLCardinality17425107287731286271.gal, -t, CGAL, -LTL, /tmp/LTLCardinality18359246805335587711.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/LTLCardinality17425107287731286271.gal -t CGAL -LTL /tmp/LTLCardinality18359246805335587711.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((G("((MpG<=MwU)||(MwU>=1))"))||(F(("(CG>SF)")||(X(F("(MpG>MwU)"))))))))
Formula 0 simplified : !G(G"((MpG<=MwU)||(MwU>=1))" | F("(CG>SF)" | XF"(MpG>MwU)"))
Detected timeout of ITS tools.
[2021-05-09 15:59:46] [INFO ] Flatten gal took : 3 ms
[2021-05-09 15:59:46] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 15:59:46] [INFO ] Transformed 24 places.
[2021-05-09 15:59:46] [INFO ] Transformed 18 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-09 15:59:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality8428606601500162800.gal : 1 ms
[2021-05-09 15:59:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality18212665957034398013.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/LTLCardinality8428606601500162800.gal, -t, CGAL, -LTL, /tmp/LTLCardinality18212665957034398013.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/LTLCardinality8428606601500162800.gal -t CGAL -LTL /tmp/LTLCardinality18212665957034398013.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 : !((G((G("((MpG<=MwU)||(MwU>=1))"))||(F(("(CG>SF)")||(X(F("(MpG>MwU)"))))))))
Formula 0 simplified : !G(G"((MpG<=MwU)||(MwU>=1))" | F("(CG>SF)" | XF"(MpG>MwU)"))

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="ClientsAndServers-PT-N2000P0"
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 ClientsAndServers-PT-N2000P0, 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 r045-oct2-162038291700252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N2000P0.tgz
mv ClientsAndServers-PT-N2000P0 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 ;