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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:32 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.1K 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-N0005P0-00
FORMULA_NAME ClientsAndServers-PT-N0005P0-01
FORMULA_NAME ClientsAndServers-PT-N0005P0-02
FORMULA_NAME ClientsAndServers-PT-N0005P0-03
FORMULA_NAME ClientsAndServers-PT-N0005P0-04
FORMULA_NAME ClientsAndServers-PT-N0005P0-05
FORMULA_NAME ClientsAndServers-PT-N0005P0-06
FORMULA_NAME ClientsAndServers-PT-N0005P0-07
FORMULA_NAME ClientsAndServers-PT-N0005P0-08
FORMULA_NAME ClientsAndServers-PT-N0005P0-09
FORMULA_NAME ClientsAndServers-PT-N0005P0-10
FORMULA_NAME ClientsAndServers-PT-N0005P0-11
FORMULA_NAME ClientsAndServers-PT-N0005P0-12
FORMULA_NAME ClientsAndServers-PT-N0005P0-13
FORMULA_NAME ClientsAndServers-PT-N0005P0-14
FORMULA_NAME ClientsAndServers-PT-N0005P0-15

=== Now, execution of the tool begins

BK_START 1620562508859

Running Version 0
[2021-05-09 12:15:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 12:15:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:15:12] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-09 12:15:12] [INFO ] Transformed 25 places.
[2021-05-09 12:15:12] [INFO ] Transformed 18 transitions.
[2021-05-09 12:15:12] [INFO ] Parsed PT model containing 25 places and 18 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 12:15:12] [INFO ] Initial state test concluded for 2 properties.
FORMULA ClientsAndServers-PT-N0005P0-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 12:15:12] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-09 12:15:12] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 12:15:12] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-09 12:15:12] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 12:15:12] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-09 12:15:12] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
[2021-05-09 12:15:12] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 12:15:12] [INFO ] Flatten gal took : 16 ms
FORMULA ClientsAndServers-PT-N0005P0-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 12:15:12] [INFO ] Flatten gal took : 5 ms
[2021-05-09 12:15:12] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 316 steps, including 0 resets, run visited all 17 properties in 6 ms. (steps per millisecond=52 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(X(F(p1)) U (p0||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:15:12] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:15:12] [INFO ] Implicit Places using invariants in 47 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:15:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:15:12] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:15:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:15:13] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-01 automaton TGBA [mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(LT s19 1), p1:(OR (LT s0 1) (LT s13 1)), p0:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3302 reset in 391 ms.
Product exploration explored 100000 steps with 3418 reset in 219 ms.
Knowledge obtained : [(NOT p2), p1, (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3325 reset in 131 ms.
Product exploration explored 100000 steps with 3307 reset in 149 ms.
Applying partial POR strategy [true, true, true, true, true]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 20 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 18 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 18 transition count 16
Performed 1 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 1 rules applied. Total rules applied 13 place count 18 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 17 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 17 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 15 rules in 13 ms. Remains 17 /20 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2021-05-09 12:15:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2021-05-09 12:15:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:15:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/20 places, 15/18 transitions.
Product exploration explored 100000 steps with 4634 reset in 272 ms.
Stack based approach found an accepted trace after 390 steps with 15 reset with depth 34 and stack size 34 in 0 ms.
FORMULA ClientsAndServers-PT-N0005P0-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-01 finished in 2629 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(F(p0))||(p1&&G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 0 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:15:15] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:15:15] [INFO ] Implicit Places using invariants in 33 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:15:15] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:15:16] [INFO ] Dead Transitions using invariants and state equation in 984 ms returned []
Starting structural reductions, iteration 1 : 21/25 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 12:15:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:15:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LT s15 1), p1:(LT s9 1), p2:(AND (LT s9 1) (GEQ s11 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9551 reset in 91 ms.
Product exploration explored 100000 steps with 9709 reset in 71 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 9953 reset in 79 ms.
Product exploration explored 100000 steps with 9630 reset in 100 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
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 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 20 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 20 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 20 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 3 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 12:15:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 12:15:17] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 12:15:18] [INFO ] Dead Transitions using invariants and state equation in 363 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 5749 reset in 243 ms.
Stack based approach found an accepted trace after 80 steps with 6 reset with depth 41 and stack size 38 in 0 ms.
FORMULA ClientsAndServers-PT-N0005P0-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-02 finished in 2842 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||G(!p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:15:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:15:18] [INFO ] Implicit Places using invariants in 12 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:15:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:15:18] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/25 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 12:15:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:15:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s9 1), p0:(OR (LT s4 1) (LT s18 1))], 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 57 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0005P0-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-03 finished in 234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&X(X(X(!p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:15:18] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:15:18] [INFO ] Implicit Places using invariants in 22 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:15:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:15:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 20/25 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 12:15:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:15:18] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, p0, p0, true]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P0-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-04 finished in 257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:15:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:15:18] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:15:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:15:18] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:15:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:15:18] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s20 1)), p1:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P0-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-06 finished in 275 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(p0&&F(((X(G(p1))&&F(((!p2&&F(p2))||G(F(p2)))))||G(F(((!p2&&F(p2))||G(F(p2)))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:15:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:15:19] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:15:19] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:15:19] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:15:19] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:15:19] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s14 1)), p2:(AND (GEQ s8 1) (GEQ s15 1)), p1:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19208 reset in 102 ms.
Product exploration explored 100000 steps with 19089 reset in 104 ms.
Knowledge obtained : [p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 19267 reset in 176 ms.
Product exploration explored 100000 steps with 19371 reset in 101 ms.
Applying partial POR strategy [true, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2))]
Support contains 5 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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 1 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 1 rules applied. Total rules applied 8 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2021-05-09 12:15:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:15:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:15:20] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Product exploration explored 100000 steps with 19206 reset in 115 ms.
Product exploration explored 100000 steps with 19572 reset in 155 ms.
[2021-05-09 12:15:20] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:15:20] [INFO ] Flatten gal took : 15 ms
[2021-05-09 12:15:20] [INFO ] Time to serialize gal into /tmp/LTL10153999293322238345.gal : 1 ms
[2021-05-09 12:15:20] [INFO ] Time to serialize properties into /tmp/LTL1646077534267304797.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/LTL10153999293322238345.gal, -t, CGAL, -LTL, /tmp/LTL1646077534267304797.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/LTL10153999293322238345.gal -t CGAL -LTL /tmp/LTL1646077534267304797.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((SR<1)||(Mi<1))"))||((F(((X(G("(StR<1)")))&&(F((("((CR<1)||(Si<1))")&&(F("((CR>=1)&&(Si>=1))")))||(G(F("((CR>=1)&&(Si>=1))"))))))||(G(F((("((CR<1)||(Si<1))")&&(F("((CR>=1)&&(Si>=1))")))||(G(F("((CR>=1)&&(Si>=1))"))))))))&&("((SR<1)||(Mi<1))")))))
Formula 0 simplified : !F(G"((SR<1)||(Mi<1))" | ("((SR<1)||(Mi<1))" & F((XG"(StR<1)" & F(("((CR<1)||(Si<1))" & F"((CR>=1)&&(Si>=1))") | GF"((CR>=1)&&(Si>=1))")) | GF(("((CR<1)||(Si<1))" & F"((CR>=1)&&(Si>=1))") | GF"((CR>=1)&&(Si>=1))"))))
Detected timeout of ITS tools.
[2021-05-09 12:15:35] [INFO ] Flatten gal took : 5 ms
[2021-05-09 12:15:35] [INFO ] Applying decomposition
[2021-05-09 12:15:35] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2051220228266775661.txt, -o, /tmp/graph2051220228266775661.bin, -w, /tmp/graph2051220228266775661.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/graph2051220228266775661.bin, -l, -1, -v, -w, /tmp/graph2051220228266775661.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:15:35] [INFO ] Decomposing Gal with order
[2021-05-09 12:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:15:35] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:15:35] [INFO ] Flatten gal took : 44 ms
[2021-05-09 12:15:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:15:35] [INFO ] Time to serialize gal into /tmp/LTL3120257944410501453.gal : 1 ms
[2021-05-09 12:15:35] [INFO ] Time to serialize properties into /tmp/LTL5624303147563780983.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3120257944410501453.gal, -t, CGAL, -LTL, /tmp/LTL5624303147563780983.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3120257944410501453.gal -t CGAL -LTL /tmp/LTL5624303147563780983.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((i1.u1.SR<1)||(i1.u2.Mi<1))"))||((F(((X(G("(i1.u1.StR<1)")))&&(F((("((i2.u7.CR<1)||(u0.Si<1))")&&(F("((i2.u7.CR>=1)&&(u0.Si>=1))")))||(G(F("((i2.u7.CR>=1)&&(u0.Si>=1))"))))))||(G(F((("((i2.u7.CR<1)||(u0.Si<1))")&&(F("((i2.u7.CR>=1)&&(u0.Si>=1))")))||(G(F("((i2.u7.CR>=1)&&(u0.Si>=1))"))))))))&&("((i1.u1.SR<1)||(i1.u2.Mi<1))")))))
Formula 0 simplified : !F(G"((i1.u1.SR<1)||(i1.u2.Mi<1))" | ("((i1.u1.SR<1)||(i1.u2.Mi<1))" & F((XG"(i1.u1.StR<1)" & F(("((i2.u7.CR<1)||(u0.Si<1))" & F"((i2.u7.CR>=1)&&(u0.Si>=1))") | GF"((i2.u7.CR>=1)&&(u0.Si>=1))")) | GF(("((i2.u7.CR<1)||(u0.Si<1))" & F"((i2.u7.CR>=1)&&(u0.Si>=1))") | GF"((i2.u7.CR>=1)&&(u0.Si>=1))"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15317596013849012807
[2021-05-09 12:15:50] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15317596013849012807
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/ltsmin15317596013849012807]
Compilation finished in 250 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15317596013849012807]
Link finished in 46 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)&&<>(!(LTLAPp2==true)))||[](<>(!(LTLAPp2==true))))))||[](<>((((LTLAPp2==true)&&<>(!(LTLAPp2==true)))||[](<>(!(LTLAPp2==true))))))))&&(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15317596013849012807]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0005P0-07 finished in 46837 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 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:16:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:16:05] [INFO ] Implicit Places using invariants in 23 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:16:05] [INFO ] Computed 4 place invariants in 7 ms
[2021-05-09 12:16:05] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 21/25 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 12:16:05] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:16:05] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s4 1) (LT s18 1))], 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-N0005P0-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-08 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:16:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:16:06] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:16:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:16:06] [INFO ] Dead Transitions using invariants and state equation in 293 ms returned []
Starting structural reductions, iteration 1 : 20/25 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 12:16:06] [INFO ] Computed 3 place invariants in 10 ms
[2021-05-09 12:16:06] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 45 ms.
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 45 ms.
Product exploration explored 100000 steps with 33333 reset in 49 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 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 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 23 rules in 2 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 12:16:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-09 12:16:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:16:07] [INFO ] Dead Transitions using invariants and state equation in 254 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 33333 reset in 102 ms.
Product exploration explored 100000 steps with 33333 reset in 79 ms.
[2021-05-09 12:16:07] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:16:07] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:16:07] [INFO ] Time to serialize gal into /tmp/LTL7459884879743655003.gal : 0 ms
[2021-05-09 12:16:07] [INFO ] Time to serialize properties into /tmp/LTL9600493489292633464.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/LTL7459884879743655003.gal, -t, CGAL, -LTL, /tmp/LTL9600493489292633464.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/LTL7459884879743655003.gal -t CGAL -LTL /tmp/LTL9600493489292633464.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(MtF<1)")))))
Formula 0 simplified : !XXF"(MtF<1)"
Detected timeout of ITS tools.
[2021-05-09 12:16:22] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:16:22] [INFO ] Applying decomposition
[2021-05-09 12:16:22] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3669506356778775134.txt, -o, /tmp/graph3669506356778775134.bin, -w, /tmp/graph3669506356778775134.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/graph3669506356778775134.bin, -l, -1, -v, -w, /tmp/graph3669506356778775134.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:16:22] [INFO ] Decomposing Gal with order
[2021-05-09 12:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:16:22] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:16:22] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 12:16:22] [INFO ] Time to serialize gal into /tmp/LTL18325050157089965095.gal : 1 ms
[2021-05-09 12:16:22] [INFO ] Time to serialize properties into /tmp/LTL7053681630827777332.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/LTL18325050157089965095.gal, -t, CGAL, -LTL, /tmp/LTL7053681630827777332.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18325050157089965095.gal -t CGAL -LTL /tmp/LTL7053681630827777332.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(u0.MtF<1)")))))
Formula 0 simplified : !XXF"(u0.MtF<1)"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1080 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.8175,225104,1,0,561313,25587,419,181903,294,115166,61615
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0005P0-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0005P0-09 finished in 27613 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U ((p1&&X(p0))||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 0 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:16:33] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:16:33] [INFO ] Implicit Places using invariants in 13 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:16:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:16:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 21/25 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 12:16:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:16:33] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s17 1)), p1:(OR (LT s0 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), true]
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 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 20 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 20 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 14 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 12:16:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 12:16:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:16:34] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
[2021-05-09 12:16:34] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:16:34] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:16:34] [INFO ] Time to serialize gal into /tmp/LTL9410276796115095147.gal : 1 ms
[2021-05-09 12:16:34] [INFO ] Time to serialize properties into /tmp/LTL15704049241198042484.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/LTL9410276796115095147.gal, -t, CGAL, -LTL, /tmp/LTL15704049241198042484.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/LTL9410276796115095147.gal -t CGAL -LTL /tmp/LTL15704049241198042484.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("((SA<1)||(SwA<1))"))U((X(G("((SA<1)||(SwA<1))")))||((X("((SA<1)||(SwA<1))"))&&("((Uf<1)||(MwU<1))")))))
Formula 0 simplified : !(X"((SA<1)||(SwA<1))" U (XG"((SA<1)||(SwA<1))" | ("((Uf<1)||(MwU<1))" & X"((SA<1)||(SwA<1))")))
Detected timeout of ITS tools.
[2021-05-09 12:16:49] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:16:49] [INFO ] Applying decomposition
[2021-05-09 12:16:49] [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/graph10518394007634391803.txt, -o, /tmp/graph10518394007634391803.bin, -w, /tmp/graph10518394007634391803.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/graph10518394007634391803.bin, -l, -1, -v, -w, /tmp/graph10518394007634391803.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:16:49] [INFO ] Decomposing Gal with order
[2021-05-09 12:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:16:49] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:16:49] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-09 12:16:49] [INFO ] Time to serialize gal into /tmp/LTL16225038588645507597.gal : 1 ms
[2021-05-09 12:16:49] [INFO ] Time to serialize properties into /tmp/LTL18227828761975054656.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/LTL16225038588645507597.gal, -t, CGAL, -LTL, /tmp/LTL18227828761975054656.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16225038588645507597.gal -t CGAL -LTL /tmp/LTL18227828761975054656.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("((i3.u4.SA<1)||(i2.u3.SwA<1))"))U((X(G("((i3.u4.SA<1)||(i2.u3.SwA<1))")))||((X("((i3.u4.SA<1)||(i2.u3.SwA<1))"))&&("((i3.u0.Uf<1)||(u1.MwU<1))")))))
Formula 0 simplified : !(X"((i3.u4.SA<1)||(i2.u3.SwA<1))" U (XG"((i3.u4.SA<1)||(i2.u3.SwA<1))" | ("((i3.u0.Uf<1)||(u1.MwU<1))" & X"((i3.u4.SA<1)||(i2.u3.SwA<1))")))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
621 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.22993,184016,1,0,366721,47108,268,654862,250,207991,378062
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0005P0-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ClientsAndServers-PT-N0005P0-10 finished in 23277 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 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 17 transition count 12
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 15 place count 16 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 21 place count 13 transition count 9
Applied a total of 21 rules in 21 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2021-05-09 12:16:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:16:57] [INFO ] Implicit Places using invariants in 22 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
[2021-05-09 12:16:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 12:16:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:16:57] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 12/25 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 6
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 6 place count 9 transition count 6
Applied a total of 6 rules in 10 ms. Remains 9 /12 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 12:16:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:16:57] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 12:16:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:16:57] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s2 1) (OR (LT s3 1) (LT s7 1)))], 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 63 reset in 109 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-N0005P0-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-11 finished in 955 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(X(!p1) U ((X(!p1)&&(!p0 U (p2||G(!p0))))||X(G(!p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:16:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:16:58] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:16:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:16:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:16:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:16:58] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-12 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p0 p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={2} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1, 2} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1, 2} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1, 2} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(AND (GEQ s10 1) (OR (LT s3 1) (LT s14 1))), p0:(LT s10 1), p1:(AND (GEQ s7 1) (GEQ s20 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1129 reset in 180 ms.
Product exploration explored 100000 steps with 1118 reset in 178 ms.
Knowledge obtained : [(NOT p2), p0, (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1110 reset in 176 ms.
Product exploration explored 100000 steps with 1140 reset in 173 ms.
[2021-05-09 12:16:59] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:16:59] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:16:59] [INFO ] Time to serialize gal into /tmp/LTL16446997672694995733.gal : 1 ms
[2021-05-09 12:16:59] [INFO ] Time to serialize properties into /tmp/LTL15785925129383241087.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/LTL16446997672694995733.gal, -t, CGAL, -LTL, /tmp/LTL15785925129383241087.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/LTL16446997672694995733.gal -t CGAL -LTL /tmp/LTL15785925129383241087.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(MtF<1)"))||((X("((CG<1)||(CwG<1))"))U(((X("((CG<1)||(CwG<1))"))&&(("(MtF>=1)")U(("((MtF>=1)&&((SR<1)||(Mi<1)))")||(G("(MtF>=1)")))))||(X(G("((CG<1)||(CwG<1))")))))))))
Formula 0 simplified : !XF(G"(MtF<1)" | (X"((CG<1)||(CwG<1))" U ((X"((CG<1)||(CwG<1))" & ("(MtF>=1)" U ("((MtF>=1)&&((SR<1)||(Mi<1)))" | G"(MtF>=1)"))) | XG"((CG<1)||(CwG<1))")))
Detected timeout of ITS tools.
[2021-05-09 12:17:14] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:17:14] [INFO ] Applying decomposition
[2021-05-09 12:17:14] [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/graph6751244632412604845.txt, -o, /tmp/graph6751244632412604845.bin, -w, /tmp/graph6751244632412604845.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/graph6751244632412604845.bin, -l, -1, -v, -w, /tmp/graph6751244632412604845.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:17:14] [INFO ] Decomposing Gal with order
[2021-05-09 12:17:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:17:14] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:17:14] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:17:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:17:14] [INFO ] Time to serialize gal into /tmp/LTL13983324274614445313.gal : 1 ms
[2021-05-09 12:17:14] [INFO ] Time to serialize properties into /tmp/LTL9237882528564530245.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/LTL13983324274614445313.gal, -t, CGAL, -LTL, /tmp/LTL9237882528564530245.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13983324274614445313.gal -t CGAL -LTL /tmp/LTL9237882528564530245.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(i0.u1.MtF<1)"))||((X("((i4.u6.CG<1)||(i3.u7.CwG<1))"))U(((X("((i4.u6.CG<1)||(i3.u7.CwG<1))"))&&(("(i0.u1.MtF>=1)")U(("((i0.u1.MtF>=1)&&((u2.SR<1)||(i0.u1.Mi<1)))")||(G("(i0.u1.MtF>=1)")))))||(X(G("((i4.u6.CG<1)||(i3.u7.CwG<1))")))))))))
Formula 0 simplified : !XF(G"(i0.u1.MtF<1)" | (X"((i4.u6.CG<1)||(i3.u7.CwG<1))" U ((X"((i4.u6.CG<1)||(i3.u7.CwG<1))" & ("(i0.u1.MtF>=1)" U ("((i0.u1.MtF>=1)&&((u2.SR<1)||(i0.u1.Mi<1)))" | G"(i0.u1.MtF>=1)"))) | XG"((i4.u6.CG<1)||(i3.u7.CwG<1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12646190698729375090
[2021-05-09 12:17:29] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12646190698729375090
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/ltsmin12646190698729375090]
Compilation finished in 115 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12646190698729375090]
Link finished in 32 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&(!(LTLAPp0==true) U ((LTLAPp2==true)||[](!(LTLAPp0==true)))))||X([]((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12646190698729375090]
LTSmin run took 1056 ms.
FORMULA ClientsAndServers-PT-N0005P0-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P0-12 finished in 32635 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 15 transition count 11
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 21 place count 13 transition count 9
Applied a total of 21 rules in 1 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2021-05-09 12:17:30] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:17:30] [INFO ] Implicit Places using invariants in 25 ms returned [9, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
[2021-05-09 12:17:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 12:17:30] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:17:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 11/25 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Applied a total of 4 rules in 6 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 12:17:30] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:17:30] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 12:17:30] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:17:31] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s5 1), p1:(OR (LT s1 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7453 reset in 56 ms.
Product exploration explored 100000 steps with 7397 reset in 68 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 7479 reset in 66 ms.
Stack based approach found an accepted trace after 24720 steps with 1855 reset with depth 35 and stack size 35 in 22 ms.
FORMULA ClientsAndServers-PT-N0005P0-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-13 finished in 840 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(G(!p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:17:31] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:17:31] [INFO ] Implicit Places using invariants in 25 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:17:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:17:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 20/25 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 12:17:31] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:17:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 81 ms :[p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s14 1)), p0:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5383 reset in 80 ms.
Product exploration explored 100000 steps with 5325 reset in 126 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 90 ms :[p1, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 5695 reset in 136 ms.
Product exploration explored 100000 steps with 5664 reset in 174 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 102 ms :[p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 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 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 16 transition count 14
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 20 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 2 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 12:17:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-09 12:17:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:17:32] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 5037 reset in 68 ms.
Stack based approach found an accepted trace after 405 steps with 31 reset with depth 53 and stack size 48 in 0 ms.
FORMULA ClientsAndServers-PT-N0005P0-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-14 finished in 1205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 11
Applied a total of 18 rules in 1 ms. Remains 14 /25 variables (removed 11) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-09 12:17:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:17:32] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-09 12:17:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:17:32] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-09 12:17:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-09 12:17:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:17:32] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/25 places, 11/18 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s12 1), p1:(AND (OR (LT s2 1) (LT s10 1)) (OR (GEQ s13 1) (LT s2 1) (LT s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 27 reset in 109 ms.
Stack based approach found an accepted trace after 1270 steps with 0 reset with depth 1271 and stack size 1271 in 5 ms.
FORMULA ClientsAndServers-PT-N0005P0-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-15 finished in 292 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-09 12:17:32] [INFO ] Applying decomposition
[2021-05-09 12:17:32] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin8349263451723694493
[2021-05-09 12:17:32] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 12:17:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 12:17:32] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 12:17:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 12:17:32] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 12:17:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 12:17:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8349263451723694493
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/ltsmin8349263451723694493]
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/graph15049409621734763177.txt, -o, /tmp/graph15049409621734763177.bin, -w, /tmp/graph15049409621734763177.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/graph15049409621734763177.bin, -l, -1, -v, -w, /tmp/graph15049409621734763177.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:17:32] [INFO ] Decomposing Gal with order
[2021-05-09 12:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:17:32] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-09 12:17:32] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:17:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:17:32] [INFO ] Time to serialize gal into /tmp/LTLFireability13382596519983903730.gal : 1 ms
[2021-05-09 12:17:32] [INFO ] Time to serialize properties into /tmp/LTLFireability4333418526088217885.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/LTLFireability13382596519983903730.gal, -t, CGAL, -LTL, /tmp/LTLFireability4333418526088217885.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability13382596519983903730.gal -t CGAL -LTL /tmp/LTLFireability4333418526088217885.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((!("((i1.u6.SR>=1)&&(i1.u3.Mi>=1))"))U(((!("((i1.u6.SR>=1)&&(i1.u3.Mi>=1))"))&&(((F("((i2.u7.CR>=1)&&(i2.u2.Si>=1))"))U(((!("((i2.u7.CR>=1)&&(i2.u2.Si>=1))"))&&(F("((i2.u7.CR>=1)&&(i2.u2.Si>=1))")))||(G(F("((i2.u7.CR>=1)&&(i2.u2.Si>=1))")))))U(((X(G("(i2.u7.StR<1)")))&&((F("((i2.u7.CR>=1)&&(i2.u2.Si>=1))"))U(((!("((i2.u7.CR>=1)&&(i2.u2.Si>=1))"))&&(F("((i2.u7.CR>=1)&&(i2.u2.Si>=1))")))||(G(F("((i2.u7.CR>=1)&&(i2.u2.Si>=1))"))))))||(G((F("((i2.u7.CR>=1)&&(i2.u2.Si>=1))"))U(((!("((i2.u7.CR>=1)&&(i2.u2.Si>=1))"))&&(F("((i2.u7.CR>=1)&&(i2.u2.Si>=1))")))||(G(F("((i2.u7.CR>=1)&&(i2.u2.Si>=1))")))))))))||(G(!("((i1.u6.SR>=1)&&(i1.u3.Mi>=1))")))))))
Formula 0 simplified : !F(!"((i1.u6.SR>=1)&&(i1.u3.Mi>=1))" U ((!"((i1.u6.SR>=1)&&(i1.u3.Mi>=1))" & ((F"((i2.u7.CR>=1)&&(i2.u2.Si>=1))" U ((!"((i2.u7.CR>=1)&&(i2.u2.Si>=1))" & F"((i2.u7.CR>=1)&&(i2.u2.Si>=1))") | GF"((i2.u7.CR>=1)&&(i2.u2.Si>=1))")) U (((F"((i2.u7.CR>=1)&&(i2.u2.Si>=1))" U ((!"((i2.u7.CR>=1)&&(i2.u2.Si>=1))" & F"((i2.u7.CR>=1)&&(i2.u2.Si>=1))") | GF"((i2.u7.CR>=1)&&(i2.u2.Si>=1))")) & XG"(i2.u7.StR<1)") | G(F"((i2.u7.CR>=1)&&(i2.u2.Si>=1))" U ((!"((i2.u7.CR>=1)&&(i2.u2.Si>=1))" & F"((i2.u7.CR>=1)&&(i2.u2.Si>=1))") | GF"((i2.u7.CR>=1)&&(i2.u2.Si>=1))"))))) | G!"((i1.u6.SR>=1)&&(i1.u3.Mi>=1))"))
Compilation finished in 188 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8349263451723694493]
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))||((LTLAPp0==true)&&<>(((X([]((LTLAPp1==true)))&&<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))||[](<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8349263451723694493]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.205: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.206: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.205: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.203: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.205: LTL layer: formula: <>(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(((X([]((LTLAPp1==true)))&&<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))||[](<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true)))))))))))
pins2lts-mc-linux64( 1/ 8), 0.209: "<>(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(((X([]((LTLAPp1==true)))&&<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))||[](<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true)))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.209: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.212: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.219: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.219: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.460: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.460: State length is 26, there are 31 groups
pins2lts-mc-linux64( 0/ 8), 0.460: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.460: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.460: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.460: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.583: [Blue] ~36 levels ~960 states ~1648 transitions
pins2lts-mc-linux64( 6/ 8), 0.610: [Blue] ~75 levels ~1920 states ~4040 transitions
pins2lts-mc-linux64( 7/ 8), 0.619: [Blue] ~47 levels ~3840 states ~7664 transitions
pins2lts-mc-linux64( 7/ 8), 0.622: [Blue] ~47 levels ~7680 states ~14744 transitions
pins2lts-mc-linux64( 4/ 8), 0.627: [Blue] ~70 levels ~15360 states ~34496 transitions
pins2lts-mc-linux64( 5/ 8), 0.630: [Blue] ~105 levels ~30720 states ~77920 transitions
pins2lts-mc-linux64( 5/ 8), 0.649: [Blue] ~105 levels ~61440 states ~147968 transitions
pins2lts-mc-linux64( 5/ 8), 0.675: [Blue] ~105 levels ~122880 states ~305344 transitions
pins2lts-mc-linux64( 5/ 8), 0.773: [Blue] ~105 levels ~245760 states ~633864 transitions
pins2lts-mc-linux64( 2/ 8), 0.925: [Blue] ~196 levels ~491520 states ~1446888 transitions
pins2lts-mc-linux64( 1/ 8), 1.171: [Blue] ~132 levels ~983040 states ~2714704 transitions
pins2lts-mc-linux64( 4/ 8), 1.766: [Blue] ~1277 levels ~1966080 states ~6050600 transitions
pins2lts-mc-linux64( 4/ 8), 3.045: [Blue] ~1290 levels ~3932160 states ~12160272 transitions
pins2lts-mc-linux64( 7/ 8), 5.738: [Blue] ~172 levels ~7864320 states ~24772392 transitions
pins2lts-mc-linux64( 4/ 8), 12.837: [Blue] ~1316 levels ~15728640 states ~48955200 transitions
pins2lts-mc-linux64( 4/ 8), 23.603: [Blue] ~1343 levels ~31457280 states ~101576488 transitions
pins2lts-mc-linux64( 4/ 8), 57.722: [Blue] ~1455 levels ~62914560 states ~211994480 transitions
pins2lts-mc-linux64( 4/ 8), 115.818: [Blue] ~1455 levels ~125829120 states ~470715608 transitions
pins2lts-mc-linux64( 1/ 8), 157.157: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 157.167:
pins2lts-mc-linux64( 0/ 8), 157.167: Explored 136994180 states 567265307 transitions, fanout: 4.141
pins2lts-mc-linux64( 0/ 8), 157.167: Total exploration time 156.700 sec (156.660 sec minimum, 156.676 sec on average)
pins2lts-mc-linux64( 0/ 8), 157.167: States per second: 874245, Transitions per second: 3620072
pins2lts-mc-linux64( 0/ 8), 157.167:
pins2lts-mc-linux64( 0/ 8), 157.167: State space has 134216143 states, 13933238 are accepting
pins2lts-mc-linux64( 0/ 8), 157.167: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 157.167: blue states: 136994180 (102.07%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 157.167: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 157.167: all-red states: 89424227 (66.63%), bogus 2369803 (1.77%)
pins2lts-mc-linux64( 0/ 8), 157.167:
pins2lts-mc-linux64( 0/ 8), 157.167: Total memory used for local state coloring: 19.4MB
pins2lts-mc-linux64( 0/ 8), 157.167:
pins2lts-mc-linux64( 0/ 8), 157.167: Queue width: 8B, total height: 1272327, memory: 9.71MB
pins2lts-mc-linux64( 0/ 8), 157.167: Tree memory: 1170.3MB, 9.1 B/state, compr.: 8.6%
pins2lts-mc-linux64( 0/ 8), 157.167: Tree fill ratio (roots/leafs): 99.0%/57.0%
pins2lts-mc-linux64( 0/ 8), 157.167: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 157.167: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 157.167: Est. total memory use: 1180.0MB (~1033.7MB 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))||((LTLAPp0==true)&&<>(((X([]((LTLAPp1==true)))&&<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))||[](<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8349263451723694493]
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))||((LTLAPp0==true)&&<>(((X([]((LTLAPp1==true)))&&<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))||[](<>(((!(LTLAPp2==true)&&<>((LTLAPp2==true)))||[](<>((LTLAPp2==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8349263451723694493]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 12:38:19] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:38:19] [INFO ] Time to serialize gal into /tmp/LTLFireability14916586636046187239.gal : 0 ms
[2021-05-09 12:38:19] [INFO ] Time to serialize properties into /tmp/LTLFireability9620078226896160482.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/LTLFireability14916586636046187239.gal, -t, CGAL, -LTL, /tmp/LTLFireability9620078226896160482.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/LTLFireability14916586636046187239.gal -t CGAL -LTL /tmp/LTLFireability9620078226896160482.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((!("((SR>=1)&&(Mi>=1))"))U(((!("((SR>=1)&&(Mi>=1))"))&&(((F("((CR>=1)&&(Si>=1))"))U(((!("((CR>=1)&&(Si>=1))"))&&(F("((CR>=1)&&(Si>=1))")))||(G(F("((CR>=1)&&(Si>=1))")))))U(((X(G("(StR<1)")))&&((F("((CR>=1)&&(Si>=1))"))U(((!("((CR>=1)&&(Si>=1))"))&&(F("((CR>=1)&&(Si>=1))")))||(G(F("((CR>=1)&&(Si>=1))"))))))||(G((F("((CR>=1)&&(Si>=1))"))U(((!("((CR>=1)&&(Si>=1))"))&&(F("((CR>=1)&&(Si>=1))")))||(G(F("((CR>=1)&&(Si>=1))")))))))))||(G(!("((SR>=1)&&(Mi>=1))")))))))
Formula 0 simplified : !F(!"((SR>=1)&&(Mi>=1))" U ((!"((SR>=1)&&(Mi>=1))" & ((F"((CR>=1)&&(Si>=1))" U ((!"((CR>=1)&&(Si>=1))" & F"((CR>=1)&&(Si>=1))") | GF"((CR>=1)&&(Si>=1))")) U (((F"((CR>=1)&&(Si>=1))" U ((!"((CR>=1)&&(Si>=1))" & F"((CR>=1)&&(Si>=1))") | GF"((CR>=1)&&(Si>=1))")) & XG"(StR<1)") | G(F"((CR>=1)&&(Si>=1))" U ((!"((CR>=1)&&(Si>=1))" & F"((CR>=1)&&(Si>=1))") | GF"((CR>=1)&&(Si>=1))"))))) | G!"((SR>=1)&&(Mi>=1))"))
Reverse transition relation is NOT exact ! Due to transitions ssA, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2021-05-09 12:59:05] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:59:05] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 12:59:05] [INFO ] Transformed 25 places.
[2021-05-09 12:59:05] [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 12:59:05] [INFO ] Time to serialize gal into /tmp/LTLFireability16133325464374622824.gal : 1 ms
[2021-05-09 12:59:05] [INFO ] Time to serialize properties into /tmp/LTLFireability11671788406658271931.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/LTLFireability16133325464374622824.gal, -t, CGAL, -LTL, /tmp/LTLFireability11671788406658271931.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16133325464374622824.gal -t CGAL -LTL /tmp/LTLFireability11671788406658271931.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((!("((SR>=1)&&(Mi>=1))"))U(((!("((SR>=1)&&(Mi>=1))"))&&(((F("((CR>=1)&&(Si>=1))"))U(((!("((CR>=1)&&(Si>=1))"))&&(F("((CR>=1)&&(Si>=1))")))||(G(F("((CR>=1)&&(Si>=1))")))))U(((X(G("(StR<1)")))&&((F("((CR>=1)&&(Si>=1))"))U(((!("((CR>=1)&&(Si>=1))"))&&(F("((CR>=1)&&(Si>=1))")))||(G(F("((CR>=1)&&(Si>=1))"))))))||(G((F("((CR>=1)&&(Si>=1))"))U(((!("((CR>=1)&&(Si>=1))"))&&(F("((CR>=1)&&(Si>=1))")))||(G(F("((CR>=1)&&(Si>=1))")))))))))||(G(!("((SR>=1)&&(Mi>=1))")))))))
Formula 0 simplified : !F(!"((SR>=1)&&(Mi>=1))" U ((!"((SR>=1)&&(Mi>=1))" & ((F"((CR>=1)&&(Si>=1))" U ((!"((CR>=1)&&(Si>=1))" & F"((CR>=1)&&(Si>=1))") | GF"((CR>=1)&&(Si>=1))")) U (((F"((CR>=1)&&(Si>=1))" U ((!"((CR>=1)&&(Si>=1))" & F"((CR>=1)&&(Si>=1))") | GF"((CR>=1)&&(Si>=1))")) & XG"(StR<1)") | G(F"((CR>=1)&&(Si>=1))" U ((!"((CR>=1)&&(Si>=1))" & F"((CR>=1)&&(Si>=1))") | GF"((CR>=1)&&(Si>=1))"))))) | G!"((SR>=1)&&(Mi>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-N0005P0"
export BK_EXAMINATION="LTLFireability"
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-N0005P0, examination is LTLFireability"
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-162038291500133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0005P0.tgz
mv ClientsAndServers-PT-N0005P0 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;