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-162038291700260.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-N5000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291700260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K 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 103K 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.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.2K 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 3.0K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-N5000P0-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-15

=== Now, execution of the tool begins

BK_START 1620573557314

Running Version 0
[2021-05-09 15:19:19] [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:19:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:19:19] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-09 15:19:19] [INFO ] Transformed 25 places.
[2021-05-09 15:19:19] [INFO ] Transformed 18 transitions.
[2021-05-09 15:19:19] [INFO ] Parsed PT model containing 25 places and 18 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:19:19] [INFO ] Initial state test concluded for 3 properties.
FORMULA ClientsAndServers-PT-N5000P0-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-14 TRUE 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 19 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:19:19] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-09 15:19:19] [INFO ] Implicit Places using invariants in 91 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 15:19:19] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-09 15:19:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 15:19:19] [INFO ] Computed 6 place invariants in 10 ms
[2021-05-09 15:19:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
[2021-05-09 15:19:20] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 15:19:20] [INFO ] Flatten gal took : 15 ms
FORMULA ClientsAndServers-PT-N5000P0-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:19:20] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:19:20] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 120005 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=2926 ) properties (out of 22) seen :5
Running SMT prover for 17 properties.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 15:19:20] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-09 15:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:19:20] [INFO ] Added : 9 causal constraints over 2 iterations in 47 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:20] [INFO ] Added : 12 causal constraints over 3 iterations in 12 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 25 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 25 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:20] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:20] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-09 15:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:20] [INFO ] Added : 16 causal constraints over 4 iterations in 18 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:19:20] [INFO ] Added : 12 causal constraints over 3 iterations in 22 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 15:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:19:20] [INFO ] Added : 12 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:20] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:20] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:19:20] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:20] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 15:19:20] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-09 15:19:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-09 15:19:20] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:20] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:19:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:19:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-09 15:19:21] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:21] [INFO ] Added : 12 causal constraints over 3 iterations in 7 ms. Result :sat
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:19:21] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:21] [INFO ] Added : 12 causal constraints over 3 iterations in 8 ms. Result :sat
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-09 15:19:21] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:21] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 15:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:19:21] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 15:19:21] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 15:19:21] [INFO ] Added : 16 causal constraints over 4 iterations in 14 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 7 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
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 18 place count 13 transition count 10
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 22 place count 11 transition count 8
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 24 place count 10 transition count 7
Applied a total of 24 rules in 21140 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-09 15:19:42] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:19:42] [INFO ] Implicit Places using invariants in 11 ms returned [4, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12 ms to find 2 implicit places.
[2021-05-09 15:19:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 15:19:42] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:19:42] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 8/23 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-09 15:19:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 15:19:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:19:42] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LEQ s2 s7) (LEQ 1 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N5000P0-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-00 finished in 21381 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 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 3 with 2 rules applied. Total rules applied 23 place count 10 transition count 8
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 27 place count 8 transition count 6
Applied a total of 27 rules in 2 ms. Remains 8 /23 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 15:19:42] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:19:42] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 15:19:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:19:42] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2021-05-09 15:19:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 15:19:42] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:19:42] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s4 s3) (LEQ 1 s2))], 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 172 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA ClientsAndServers-PT-N5000P0-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-01 finished in 536 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:19:43] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 15:19:43] [INFO ] Implicit Places using invariants in 12 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:19:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 21/23 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:19:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s17), p1:(LEQ s8 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1947 reset in 97 ms.
Product exploration explored 100000 steps with 1936 reset in 107 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1963 reset in 79 ms.
Product exploration explored 100000 steps with 1934 reset in 85 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 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 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 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 7 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 18 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 18 transition count 15
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 17 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 17 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 17 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 14 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 15:19:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2021-05-09 15:19:44] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:19:44] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/21 places, 14/18 transitions.
Product exploration explored 100000 steps with 5677 reset in 181 ms.
Product exploration explored 100000 steps with 5749 reset in 136 ms.
[2021-05-09 15:19:44] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:19:44] [INFO ] Flatten gal took : 3 ms
[2021-05-09 15:19:44] [INFO ] Time to serialize gal into /tmp/LTL16905322850098069543.gal : 2 ms
[2021-05-09 15:19:44] [INFO ] Time to serialize properties into /tmp/LTL14471934640766110512.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/LTL16905322850098069543.gal, -t, CGAL, -LTL, /tmp/LTL14471934640766110512.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/LTL16905322850098069543.gal -t CGAL -LTL /tmp/LTL14471934640766110512.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(SwA>=1)"))||(G("(CR<=CG)")))))
Formula 0 simplified : !X(F"(SwA>=1)" | G"(CR<=CG)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-09 15:19:44] [INFO ] Flatten gal took : 3 ms
[2021-05-09 15:19:44] [INFO ] Applying decomposition
[2021-05-09 15:19:44] [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/graph1081599869337971090.txt, -o, /tmp/graph1081599869337971090.bin, -w, /tmp/graph1081599869337971090.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/graph1081599869337971090.bin, -l, -1, -v, -w, /tmp/graph1081599869337971090.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:19:44] [INFO ] Decomposing Gal with order
[2021-05-09 15:19:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:19:44] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:19:44] [INFO ] Flatten gal took : 96 ms
[2021-05-09 15:19:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 15:19:44] [INFO ] Time to serialize gal into /tmp/LTL10945117699100237752.gal : 5 ms
[2021-05-09 15:19:44] [INFO ] Time to serialize properties into /tmp/LTL12122563582037766505.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/LTL10945117699100237752.gal, -t, CGAL, -LTL, /tmp/LTL12122563582037766505.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/LTL10945117699100237752.gal -t CGAL -LTL /tmp/LTL12122563582037766505.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(gi1.gi1.gu7.SwA>=1)"))||(G("(gu4.CR<=gu4.CG)")))))
Formula 0 simplified : !X(F"(gi1.gi1.gu7.SwA>=1)" | G"(gu4.CR<=gu4.CG)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin10846926293090129882
[2021-05-09 15:19:44] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10846926293090129882
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/ltsmin10846926293090129882]
Compilation finished in 213 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10846926293090129882]
Link finished in 47 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10846926293090129882]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N5000P0-02 finished in 16714 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 12 transition count 8
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 23 place count 10 transition count 8
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 27 place count 8 transition count 6
Applied a total of 27 rules in 3 ms. Remains 8 /23 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 15:19:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:19:59] [INFO ] Implicit Places using invariants in 20 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
[2021-05-09 15:19:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 15:19:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:19:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 7/23 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-09 15:19:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 15:19:59] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:19:59] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s0)], 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][true]]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-04 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(X(F(p1))||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 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 21 transition count 18
Applied a total of 2 rules in 0 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:00] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:20:00] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:00] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 15:20:00] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:00] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:20:00] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s12), p2:(GT 2 s20), p1:(GT s19 s9)], 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 33257 reset in 87 ms.
Product exploration explored 100000 steps with 33368 reset in 96 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33295 reset in 64 ms.
Product exploration explored 100000 steps with 33486 reset in 71 ms.
Applying partial POR strategy [true, true, true]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Support contains 4 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 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 19 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 19 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 17 rules in 15 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 15:20:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2021-05-09 15:20:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 15:20:01] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/21 places, 14/18 transitions.
Product exploration explored 100000 steps with 33399 reset in 216 ms.
Product exploration explored 100000 steps with 33119 reset in 144 ms.
[2021-05-09 15:20:01] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:20:01] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:20:01] [INFO ] Time to serialize gal into /tmp/LTL17040479602630376404.gal : 5 ms
[2021-05-09 15:20:01] [INFO ] Time to serialize properties into /tmp/LTL13711285759911539813.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/LTL17040479602630376404.gal, -t, CGAL, -LTL, /tmp/LTL13711285759911539813.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/LTL17040479602630376404.gal -t CGAL -LTL /tmp/LTL13711285759911539813.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(MpG<3)")&&((X(F("(CwG>MpA)")))||(G("(Ci<2)")))))))
Formula 0 simplified : !FG("(MpG<3)" & (XF"(CwG>MpA)" | G"(Ci<2)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-09 15:20:01] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:20:01] [INFO ] Applying decomposition
[2021-05-09 15:20:01] [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/graph4133883313132658135.txt, -o, /tmp/graph4133883313132658135.bin, -w, /tmp/graph4133883313132658135.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/graph4133883313132658135.bin, -l, -1, -v, -w, /tmp/graph4133883313132658135.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:20:01] [INFO ] Decomposing Gal with order
[2021-05-09 15:20:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:20:01] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:20:01] [INFO ] Flatten gal took : 12 ms
[2021-05-09 15:20:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 15:20:01] [INFO ] Time to serialize gal into /tmp/LTL11350297100442396228.gal : 1 ms
[2021-05-09 15:20:01] [INFO ] Time to serialize properties into /tmp/LTL3502631468548238079.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/LTL11350297100442396228.gal, -t, CGAL, -LTL, /tmp/LTL3502631468548238079.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/LTL11350297100442396228.gal -t CGAL -LTL /tmp/LTL3502631468548238079.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gi1.gi1.gu4.MpG<3)")&&((X(F("(gu3.CwG>gu3.MpA)")))||(G("(gi1.gi0.gu6.Ci<2)")))))))
Formula 0 simplified : !FG("(gi1.gi1.gu4.MpG<3)" & (XF"(gu3.CwG>gu3.MpA)" | G"(gi1.gi0.gu6.Ci<2)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin17958132759561180003
[2021-05-09 15:20:01] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17958132759561180003
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/ltsmin17958132759561180003]
Compilation finished in 109 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17958132759561180003]
Link finished in 41 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([](((LTLAPp0==true)&&(X(<>((LTLAPp1==true)))||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17958132759561180003]
LTSmin run took 474 ms.
FORMULA ClientsAndServers-PT-N5000P0-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N5000P0-07 finished in 2271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&G(p1)) U X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:20:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:20:02] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:20:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 15:20:02] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:20:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 15:20:02] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-08 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s4 s16), p1:(OR (LEQ s17 s8) (LEQ s14 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 183 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N5000P0-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-08 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 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 21 transition count 18
Applied a total of 2 rules in 0 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 15:20:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:20:02] [INFO ] Implicit Places using invariants in 19 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 15:20:02] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:02] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 20/23 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:20:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:20:02] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s11 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-09 finished in 151 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(p1 U (p2||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 7 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 13 transition count 9
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 21 place count 11 transition count 9
Applied a total of 21 rules in 1 ms. Remains 11 /23 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 15:20:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:20:02] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 15:20:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 15:20:02] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-09 15:20:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 15:20:02] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-09 15:20:02] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/23 places, 9/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (GT s9 s3) (GT s0 s1)), p1:(GT s0 s1), p0:(LEQ s9 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 15137 reset in 81 ms.
Product exploration explored 100000 steps with 15172 reset in 89 ms.
Knowledge obtained : [(NOT p2), p1, p0]
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 15154 reset in 82 ms.
Product exploration explored 100000 steps with 15123 reset in 89 ms.
[2021-05-09 15:20:03] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:20:03] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:20:03] [INFO ] Time to serialize gal into /tmp/LTL15924061454456578245.gal : 1 ms
[2021-05-09 15:20:03] [INFO ] Time to serialize properties into /tmp/LTL4453807916148434949.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/LTL15924061454456578245.gal, -t, CGAL, -LTL, /tmp/LTL4453807916148434949.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/LTL15924061454456578245.gal -t CGAL -LTL /tmp/LTL4453807916148434949.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(Cb<=CF)"))||(("(Uf>CA)")U(("((Cb>StF)&&(Uf>CA))")||(G("(Uf>CA)"))))))
Formula 0 simplified : !(G"(Cb<=CF)" | ("(Uf>CA)" U ("((Cb>StF)&&(Uf>CA))" | G"(Uf>CA)")))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-09 15:20:03] [INFO ] Flatten gal took : 0 ms
[2021-05-09 15:20:03] [INFO ] Applying decomposition
[2021-05-09 15:20:03] [INFO ] Flatten gal took : 0 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/graph6703271304645521354.txt, -o, /tmp/graph6703271304645521354.bin, -w, /tmp/graph6703271304645521354.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/graph6703271304645521354.bin, -l, -1, -v, -w, /tmp/graph6703271304645521354.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:20:03] [INFO ] Decomposing Gal with order
[2021-05-09 15:20:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:20:03] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:20:03] [INFO ] Time to serialize gal into /tmp/LTL2034821377023732878.gal : 1 ms
[2021-05-09 15:20:03] [INFO ] Time to serialize properties into /tmp/LTL13401785211411332547.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/LTL2034821377023732878.gal, -t, CGAL, -LTL, /tmp/LTL13401785211411332547.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/LTL2034821377023732878.gal -t CGAL -LTL /tmp/LTL13401785211411332547.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(gu3.Cb<=gu3.CF)"))||(("(gu0.Uf>gu0.CA)")U(("((gu3.Cb>gu3.StF)&&(gu0.Uf>gu0.CA))")||(G("(gu0.Uf>gu0.CA)"))))))
Formula 0 simplified : !(G"(gu3.Cb<=gu3.CF)" | ("(gu0.Uf>gu0.CA)" U ("((gu3.Cb>gu3.StF)&&(gu0.Uf>gu0.CA))" | G"(gu0.Uf>gu0.CA)")))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin14310151737348418156
[2021-05-09 15:20:03] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14310151737348418156
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/ltsmin14310151737348418156]
Compilation finished in 92 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14310151737348418156]
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, ([]((LTLAPp0==true))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14310151737348418156]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: ([]((LTLAPp0==true))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.003: "([]((LTLAPp0==true))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.160: DFS-FIFO for weak LTL, using special progress label 13
pins2lts-mc-linux64( 0/ 8), 0.160: There are 14 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.160: State length is 12, there are 18 groups
pins2lts-mc-linux64( 0/ 8), 0.160: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.160: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.160: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.160: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.367: ~1 levels ~960 states ~1560 transitions
pins2lts-mc-linux64( 3/ 8), 0.393: ~1 levels ~1920 states ~3032 transitions
pins2lts-mc-linux64( 3/ 8), 0.418: ~1 levels ~3840 states ~6088 transitions
pins2lts-mc-linux64( 3/ 8), 0.422: ~1 levels ~7680 states ~11944 transitions
pins2lts-mc-linux64( 3/ 8), 0.424: ~1 levels ~15360 states ~23200 transitions
pins2lts-mc-linux64( 3/ 8), 0.427: ~1 levels ~30720 states ~46232 transitions
pins2lts-mc-linux64( 1/ 8), 0.433: ~1 levels ~61440 states ~92688 transitions
pins2lts-mc-linux64( 3/ 8), 0.450: ~1 levels ~122880 states ~184424 transitions
pins2lts-mc-linux64( 3/ 8), 0.493: ~1 levels ~245760 states ~368336 transitions
pins2lts-mc-linux64( 7/ 8), 0.565: ~1 levels ~491520 states ~738496 transitions
pins2lts-mc-linux64( 7/ 8), 0.709: ~1 levels ~983040 states ~1475296 transitions
pins2lts-mc-linux64( 1/ 8), 1.008: ~1 levels ~1966080 states ~2949768 transitions
pins2lts-mc-linux64( 2/ 8), 1.590: ~1 levels ~3932160 states ~5890152 transitions
pins2lts-mc-linux64( 1/ 8), 2.840: ~1 levels ~7864320 states ~11798928 transitions
pins2lts-mc-linux64( 7/ 8), 5.744: ~1 levels ~15728640 states ~23597248 transitions
pins2lts-mc-linux64( 7/ 8), 8.774: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 8.862:
pins2lts-mc-linux64( 0/ 8), 8.862: mean standard work distribution: 5.3% (states) 5.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 8.862:
pins2lts-mc-linux64( 0/ 8), 8.862: Explored 16757164 states 25139786 transitions, fanout: 1.500
pins2lts-mc-linux64( 0/ 8), 8.862: Total exploration time 8.660 sec (8.610 sec minimum, 8.641 sec on average)
pins2lts-mc-linux64( 0/ 8), 8.862: States per second: 1935007, Transitions per second: 2902978
pins2lts-mc-linux64( 0/ 8), 8.862:
pins2lts-mc-linux64( 0/ 8), 8.862: Progress states detected: 16763061
pins2lts-mc-linux64( 0/ 8), 8.862: Redundant explorations: -0.0353
pins2lts-mc-linux64( 0/ 8), 8.862:
pins2lts-mc-linux64( 0/ 8), 8.862: Queue width: 8B, total height: 12823, memory: 0.10MB
pins2lts-mc-linux64( 0/ 8), 8.862: Tree memory: 383.9MB, 24.0 B/state, compr.: 48.0%
pins2lts-mc-linux64( 0/ 8), 8.862: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 8.862: Stored 9 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 8.862: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 8.862: Est. total memory use: 384.0MB (~1024.1MB 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) U ((LTLAPp2==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14310151737348418156]
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) U ((LTLAPp2==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14310151737348418156]
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)
Treatment of property ClientsAndServers-PT-N5000P0-10 finished in 9781 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 0 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 15:20:12] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 15:20:12] [INFO ] Implicit Places using invariants in 20 ms returned [20]
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:20:12] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:20:12] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 21/23 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:20:12] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 15:20:12] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s19 s18), p1:(OR (GT 2 s2) (GT s0 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-11 finished in 250 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 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 19 place count 12 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 8 transition count 6
Applied a total of 27 rules in 2 ms. Remains 8 /23 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 15:20:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:12] [INFO ] Implicit Places using invariants in 11 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
[2021-05-09 15:20:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 15:20:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:20:12] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 7/23 places, 6/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-09 15:20:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 15:20:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:20:12] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-12 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 s6)], 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 58 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-12 finished in 142 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||((p1&&F(p2)) U ((F(p2)&&p3)||G((p1&&F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 13 transition count 10
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 19 place count 12 transition count 10
Applied a total of 19 rules in 2 ms. Remains 12 /23 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 15:20:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:12] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 15:20:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:12] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-09 15:20:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 15:20:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:12] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/23 places, 10/18 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=0 dest: 0}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s7 s10), p3:(AND (LEQ 3 s2) (GT s5 s11)), p1:(GT s5 s11), p2:(GT 3 s7)], nbAcceptance=2, 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 117 ms.
Stack based approach found an accepted trace after 850 steps with 0 reset with depth 851 and stack size 851 in 1 ms.
FORMULA ClientsAndServers-PT-N5000P0-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-13 finished in 317 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 7 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 13 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 13 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 10 transition count 8
Applied a total of 23 rules in 1 ms. Remains 10 /23 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 15:20:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:13] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 15:20:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:13] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-09 15:20:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 15:20:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 15:20:13] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s5 s1) (GT 1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1077 reset in 81 ms.
Stack based approach found an accepted trace after 3007 steps with 49 reset with depth 82 and stack size 81 in 3 ms.
FORMULA ClientsAndServers-PT-N5000P0-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-15 finished in 209 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7328652068281055446
[2021-05-09 15:20:13] [INFO ] Applying decomposition
[2021-05-09 15:20:13] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 15:20:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:20:13] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 15:20:13] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:20:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 15:20:13] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 15:20:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph1152474781304413731.txt, -o, /tmp/graph1152474781304413731.bin, -w, /tmp/graph1152474781304413731.weights], workingDir=null]
[2021-05-09 15:20:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7328652068281055446
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/ltsmin7328652068281055446]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1152474781304413731.bin, -l, -1, -v, -w, /tmp/graph1152474781304413731.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:20:13] [INFO ] Decomposing Gal with order
[2021-05-09 15:20:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:20:13] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 15:20:13] [INFO ] Flatten gal took : 3 ms
[2021-05-09 15:20:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 15:20:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality10845487097678723817.gal : 3 ms
[2021-05-09 15:20:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality12693972419865498500.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/LTLCardinality10845487097678723817.gal, -t, CGAL, -LTL, /tmp/LTLCardinality12693972419865498500.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/LTLCardinality10845487097678723817.gal -t CGAL -LTL /tmp/LTLCardinality12693972419865498500.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X((F("(gi2.gi1.gu6.SwA>=1)"))||(G("(gu4.CR<=gu4.CG)")))))
Formula 0 simplified : !X(F"(gi2.gi1.gu6.SwA>=1)" | G"(gu4.CR<=gu4.CG)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-09 15:20:13] [INFO ] Flatten gal took : 1 ms
[2021-05-09 15:20:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality3896283423204211380.gal : 1 ms
[2021-05-09 15:20:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality4955786512488536984.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/LTLCardinality3896283423204211380.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4955786512488536984.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/LTLCardinality3896283423204211380.gal -t CGAL -LTL /tmp/LTLCardinality4955786512488536984.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X((F("(SwA>=1)"))||(G("(CR<=CG)")))))
Formula 0 simplified : !X(F"(SwA>=1)" | G"(CR<=CG)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-09 15:20:13] [INFO ] Flatten gal took : 2 ms
[2021-05-09 15:20:13] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 15:20:13] [INFO ] Transformed 23 places.
[2021-05-09 15:20:13] [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:20:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality12700620101619326803.gal : 1 ms
[2021-05-09 15:20:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality4693228330890631955.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/LTLCardinality12700620101619326803.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4693228330890631955.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

ITS-tools command line returned an error code 134
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/LTLCardinality12700620101619326803.gal -t CGAL -LTL /tmp/LTLCardinality4693228330890631955.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("(SwA>=1)"))||(G("(CR<=CG)")))))
Formula 0 simplified : !X(F"(SwA>=1)" | G"(CR<=CG)")
terminate called after throwing an instance of 'char const*'
Compilation finished in 125 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7328652068281055446]
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, X((<>((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7328652068281055446]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.042: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.042: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.239: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.239: LTL layer: formula: X((<>((LTLAPp0==true))||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.239: "X((<>((LTLAPp0==true))||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.239: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.239: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.244: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.251: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.251: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.251: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.252: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.304: DFS-FIFO for weak LTL, using special progress label 24
pins2lts-mc-linux64( 0/ 8), 0.304: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.304: State length is 24, there are 22 groups
pins2lts-mc-linux64( 0/ 8), 0.304: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.304: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.304: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.304: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.906: ~112 levels ~960 states ~5952 transitions
pins2lts-mc-linux64( 0/ 8), 1.044: ~224 levels ~1920 states ~14600 transitions
pins2lts-mc-linux64( 0/ 8), 1.069: ~441 levels ~3840 states ~30992 transitions
pins2lts-mc-linux64( 0/ 8), 1.073: ~881 levels ~7680 states ~64872 transitions
pins2lts-mc-linux64( 0/ 8), 1.093: ~1770 levels ~15360 states ~140232 transitions
pins2lts-mc-linux64( 0/ 8), 1.123: ~3548 levels ~30720 states ~301096 transitions
pins2lts-mc-linux64( 0/ 8), 1.191: ~7035 levels ~61440 states ~607168 transitions
pins2lts-mc-linux64( 0/ 8), 1.330: ~14078 levels ~122880 states ~1245328 transitions
pins2lts-mc-linux64( 0/ 8), 1.622: ~28186 levels ~245760 states ~2532512 transitions
pins2lts-mc-linux64( 0/ 8), 2.213: ~56496 levels ~491520 states ~5156936 transitions
pins2lts-mc-linux64( 0/ 8), 3.417: ~113129 levels ~983040 states ~10488344 transitions
pins2lts-mc-linux64( 0/ 8), 3.870: ~143862 levels ~1966080 states ~11821976 transitions
pins2lts-mc-linux64( 0/ 8), 4.904: ~143862 levels ~3932160 states ~14819656 transitions
pins2lts-mc-linux64( 0/ 8), 6.943: ~143862 levels ~7864320 states ~20814608 transitions
pins2lts-mc-linux64( 0/ 8), 11.061: ~143862 levels ~15728640 states ~32567576 transitions
pins2lts-mc-linux64( 0/ 8), 20.105: ~143862 levels ~31457280 states ~57271424 transitions
pins2lts-mc-linux64( 0/ 8), 40.653: ~143862 levels ~62914560 states ~120021856 transitions
pins2lts-mc-linux64( 0/ 8), 100.302: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 100.305:
pins2lts-mc-linux64( 0/ 8), 100.306: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 100.306:
pins2lts-mc-linux64( 0/ 8), 100.306: Explored 11965770 states 23180413 transitions, fanout: 1.937
pins2lts-mc-linux64( 0/ 8), 100.306: Total exploration time 100.000 sec (99.970 sec minimum, 99.989 sec on average)
pins2lts-mc-linux64( 0/ 8), 100.306: States per second: 119658, Transitions per second: 231804
pins2lts-mc-linux64( 0/ 8), 100.306:
pins2lts-mc-linux64( 0/ 8), 100.306: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 100.306: Redundant explorations: -9.1648
pins2lts-mc-linux64( 0/ 8), 100.306:
pins2lts-mc-linux64( 0/ 8), 100.306: Queue width: 8B, total height: 143873, memory: 1.10MB
pins2lts-mc-linux64( 0/ 8), 100.306: Tree memory: 356.5MB, 28.4 B/state, compr.: 29.0%
pins2lts-mc-linux64( 0/ 8), 100.306: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 100.306: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 100.306: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 100.306: Est. total memory use: 357.6MB (~1025.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7328652068281055446]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7328652068281055446]
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)

BK_STOP 1620573714336

--------------------
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-N5000P0"
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-N5000P0, 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-162038291700260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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