fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r045-oct2-162038291500157
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ClientsAndServers-PT-N0010P1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2902.783 321639.00 986025.00 101.80 FTFFTFTFFFFFTFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K 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.6K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.2K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0010P1-00
FORMULA_NAME ClientsAndServers-PT-N0010P1-01
FORMULA_NAME ClientsAndServers-PT-N0010P1-02
FORMULA_NAME ClientsAndServers-PT-N0010P1-03
FORMULA_NAME ClientsAndServers-PT-N0010P1-04
FORMULA_NAME ClientsAndServers-PT-N0010P1-05
FORMULA_NAME ClientsAndServers-PT-N0010P1-06
FORMULA_NAME ClientsAndServers-PT-N0010P1-07
FORMULA_NAME ClientsAndServers-PT-N0010P1-08
FORMULA_NAME ClientsAndServers-PT-N0010P1-09
FORMULA_NAME ClientsAndServers-PT-N0010P1-10
FORMULA_NAME ClientsAndServers-PT-N0010P1-11
FORMULA_NAME ClientsAndServers-PT-N0010P1-12
FORMULA_NAME ClientsAndServers-PT-N0010P1-13
FORMULA_NAME ClientsAndServers-PT-N0010P1-14
FORMULA_NAME ClientsAndServers-PT-N0010P1-15

=== Now, execution of the tool begins

BK_START 1620563872422

Running Version 0
[2021-05-09 12:37:54] [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:37:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:37:54] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-09 12:37:54] [INFO ] Transformed 25 places.
[2021-05-09 12:37:54] [INFO ] Transformed 18 transitions.
[2021-05-09 12:37:54] [INFO ] Parsed PT model containing 25 places and 18 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 12:37:54] [INFO ] Initial state test concluded for 3 properties.
FORMULA ClientsAndServers-PT-N0010P1-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 10 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 12:37:54] [INFO ] Computed 7 place invariants in 8 ms
[2021-05-09 12:37:54] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 12:37:54] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-09 12:37:55] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 12:37:55] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-09 12:37:55] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
[2021-05-09 12:37:55] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 12:37:55] [INFO ] Flatten gal took : 22 ms
FORMULA ClientsAndServers-PT-N0010P1-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 12:37:55] [INFO ] Flatten gal took : 5 ms
[2021-05-09 12:37:55] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 679 steps, including 0 resets, run visited all 19 properties in 4 ms. (steps per millisecond=169 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 9 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 12:37:55] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-09 12:37:55] [INFO ] Implicit Places using invariants in 31 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
[2021-05-09 12:37:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 12:37:55] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 12:37:55] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 7/24 places, 6/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 1 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 12:37:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 12:37:55] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 12:37:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 12:37:55] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13621 reset in 179 ms.
Product exploration explored 100000 steps with 13804 reset in 155 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13759 reset in 81 ms.
Product exploration explored 100000 steps with 13973 reset in 111 ms.
[2021-05-09 12:37:56] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:37:56] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:37:56] [INFO ] Time to serialize gal into /tmp/LTL7861317005395047056.gal : 1 ms
[2021-05-09 12:37:56] [INFO ] Time to serialize properties into /tmp/LTL14903526853148570876.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/LTL7861317005395047056.gal, -t, CGAL, -LTL, /tmp/LTL14903526853148570876.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/LTL7861317005395047056.gal -t CGAL -LTL /tmp/LTL14903526853148570876.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(MpG>=1)"))))
Formula 0 simplified : !GF"(MpG>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
47 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,0.488478,25088,1,0,194,38459,24,143,266,39562,369
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0010P1-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ClientsAndServers-PT-N0010P1-00 finished in 1533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0)) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 9 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:37:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:37:57] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:37:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:37:57] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:37:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:37:57] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-03 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s9 1) (AND (GEQ s4 1) (GEQ s18 1))), p0:(AND (GEQ s4 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P1-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-03 finished in 360 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:37:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:37:57] [INFO ] Implicit Places using invariants in 32 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:37:57] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 12:37:57] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:37:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:37:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 2 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
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 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:37:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 12:37:58] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 12:37:58] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
[2021-05-09 12:37:58] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:37:58] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:37:58] [INFO ] Time to serialize gal into /tmp/LTL2760455881142787236.gal : 1 ms
[2021-05-09 12:37:58] [INFO ] Time to serialize properties into /tmp/LTL16490123785645355039.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/LTL2760455881142787236.gal, -t, CGAL, -LTL, /tmp/LTL16490123785645355039.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/LTL2760455881142787236.gal -t CGAL -LTL /tmp/LTL16490123785645355039.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((SF<1)||(Mi<1))"))))
Formula 0 simplified : !XF"((SF<1)||(Mi<1))"
Detected timeout of ITS tools.
[2021-05-09 12:38:13] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:38:13] [INFO ] Applying decomposition
[2021-05-09 12:38:13] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17495063752118350378.txt, -o, /tmp/graph17495063752118350378.bin, -w, /tmp/graph17495063752118350378.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/graph17495063752118350378.bin, -l, -1, -v, -w, /tmp/graph17495063752118350378.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:38:13] [INFO ] Decomposing Gal with order
[2021-05-09 12:38:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:38:13] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:38:13] [INFO ] Flatten gal took : 51 ms
[2021-05-09 12:38:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-09 12:38:13] [INFO ] Time to serialize gal into /tmp/LTL917645698939364120.gal : 2 ms
[2021-05-09 12:38:13] [INFO ] Time to serialize properties into /tmp/LTL15840664144750351318.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/LTL917645698939364120.gal, -t, CGAL, -LTL, /tmp/LTL15840664144750351318.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/LTL917645698939364120.gal -t CGAL -LTL /tmp/LTL15840664144750351318.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i1.u1.SF<1)||(i0.u2.Mi<1))"))))
Formula 0 simplified : !XF"((i1.u1.SF<1)||(i0.u2.Mi<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5993091576406987179
[2021-05-09 12:38:29] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5993091576406987179
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/ltsmin5993091576406987179]
Compilation finished in 190 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5993091576406987179]
Link finished in 37 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin5993091576406987179]
LTSmin run took 1544 ms.
FORMULA ClientsAndServers-PT-N0010P1-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P1-04 finished in 33274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:38:30] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:38:30] [INFO ] Implicit Places using invariants in 24 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:38:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:38:30] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:38:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:38:30] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-05 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s15 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][false, false, false, false]]
Product exploration explored 100000 steps with 6530 reset in 75 ms.
Product exploration explored 100000 steps with 7262 reset in 77 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6953 reset in 66 ms.
Stack based approach found an accepted trace after 46171 steps with 3370 reset with depth 533 and stack size 533 in 34 ms.
FORMULA ClientsAndServers-PT-N0010P1-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-05 finished in 613 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&(F(p1)||X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 12:38:31] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:38:31] [INFO ] Implicit Places using invariants in 40 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:38:31] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:38:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:38:31] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-09 12:38:31] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s19 1)), p1:(GEQ s12 1), p2:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4992 reset in 66 ms.
Product exploration explored 100000 steps with 4991 reset in 65 ms.
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 4907 reset in 62 ms.
Product exploration explored 100000 steps with 4892 reset in 64 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (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 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 21 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 18 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 18 transition count 15
Performed 3 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 3 rules applied. Total rules applied 16 place count 18 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 16 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 16 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 20 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 12:38:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2021-05-09 12:38:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:38:32] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 13/18 transitions.
Product exploration explored 100000 steps with 7556 reset in 158 ms.
Product exploration explored 100000 steps with 7539 reset in 121 ms.
[2021-05-09 12:38:32] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:38:32] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:38:32] [INFO ] Time to serialize gal into /tmp/LTL14500403804145536918.gal : 1 ms
[2021-05-09 12:38:32] [INFO ] Time to serialize properties into /tmp/LTL1589859747906041543.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/LTL14500403804145536918.gal, -t, CGAL, -LTL, /tmp/LTL1589859747906041543.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/LTL14500403804145536918.gal -t CGAL -LTL /tmp/LTL1589859747906041543.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((CG>=1)&&(CwG>=1))"))&&((F("(MpG>=1)"))||(X(G("(SpG<1)")))))))
Formula 0 simplified : !X(F"((CG>=1)&&(CwG>=1))" & (F"(MpG>=1)" | XG"(SpG<1)"))
Detected timeout of ITS tools.
[2021-05-09 12:38:48] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:38:48] [INFO ] Applying decomposition
[2021-05-09 12:38:48] [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/graph17910568094907737414.txt, -o, /tmp/graph17910568094907737414.bin, -w, /tmp/graph17910568094907737414.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/graph17910568094907737414.bin, -l, -1, -v, -w, /tmp/graph17910568094907737414.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:38:48] [INFO ] Decomposing Gal with order
[2021-05-09 12:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:38:48] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:38:48] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:38:48] [INFO ] Time to serialize gal into /tmp/LTL3967951877729929026.gal : 1 ms
[2021-05-09 12:38:48] [INFO ] Time to serialize properties into /tmp/LTL14265176077915390346.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/LTL3967951877729929026.gal, -t, CGAL, -LTL, /tmp/LTL14265176077915390346.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/LTL3967951877729929026.gal -t CGAL -LTL /tmp/LTL14265176077915390346.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("((u5.CG>=1)&&(u5.CwG>=1))"))&&((F("(u3.MpG>=1)"))||(X(G("(u3.SpG<1)")))))))
Formula 0 simplified : !X(F"((u5.CG>=1)&&(u5.CwG>=1))" & (F"(u3.MpG>=1)" | XG"(u3.SpG<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11646785086830211053
[2021-05-09 12:39:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11646785086830211053
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/ltsmin11646785086830211053]
Compilation finished in 118 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11646785086830211053]
Link finished in 28 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&(<>((LTLAPp1==true))||X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11646785086830211053]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0010P1-06 finished in 46706 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 17 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 17 place count 14 transition count 11
Applied a total of 17 rules in 2 ms. Remains 14 /24 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-09 12:39:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:39:18] [INFO ] Implicit Places using invariants in 21 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
[2021-05-09 12:39:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-09 12:39:18] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 12:39:18] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 13/24 places, 11/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 10 transition count 8
Applied a total of 6 rules in 1 ms. Remains 10 /13 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 12:39:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:39:18] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 12:39:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:39:18] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-07 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 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s6 1)), p1:(OR (LT s2 1) (LT s6 1)), p2:(AND (OR (LT s7 1) (LT s8 1)) (OR (LT s4 1) (LT s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 17 reset in 160 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-07 finished in 350 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&G(!p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:39:18] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:39:18] [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 21 cols
[2021-05-09 12:39:18] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:39:18] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:39:18] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:39:18] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (OR p0 p1), p1, (OR p0 p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GEQ s12 1), p0:(AND (GEQ s4 1) (GEQ 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 17 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-08 finished in 192 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 12:39:18] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:39:18] [INFO ] Implicit Places using invariants in 30 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:39:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:39:18] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:39:18] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:39:18] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s16 1)), p1:(GEQ s18 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-09 finished in 178 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)&&(F(G(!p0))||p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:39:18] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:39:18] [INFO ] Implicit Places using invariants in 29 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:39:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:39:18] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:39:18] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-09 12:39:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-10 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s13 1)), p0:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P1-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-10 finished in 207 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 5 rules applied. Total rules applied 5 place count 23 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 10 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 18 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 11 place count 18 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 13 place count 17 transition count 12
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 17 place count 15 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 14 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 10 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2021-05-09 12:39:19] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:39:19] [INFO ] Implicit Places using invariants in 19 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
[2021-05-09 12:39:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 12:39:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:39:19] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 12/24 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 1 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:39:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:39:19] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 12:39:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:39:19] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-11 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1)), p1:(LT s2 1)], nbAcceptance=2, 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 9 reset in 153 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-11 finished in 271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(!p0)||(p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:39:19] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:39:19] [INFO ] Implicit Places using invariants in 23 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:39:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:39:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:39:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:39:19] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s12 1), p1:(LT s15 1), p2:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 75 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Product exploration explored 100000 steps with 50000 reset in 37 ms.
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 104 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
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 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 20 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 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 19 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 19 transition count 17
Performed 3 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 3 rules applied. Total rules applied 13 place count 19 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 17 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 17 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 17 rules in 19 ms. Remains 17 /20 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2021-05-09 12:39:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2021-05-09 12:39:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:39:20] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/20 places, 15/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
[2021-05-09 12:39:20] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:39:20] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:39:20] [INFO ] Time to serialize gal into /tmp/LTL15248826002806166570.gal : 1 ms
[2021-05-09 12:39:20] [INFO ] Time to serialize properties into /tmp/LTL4662582282808669122.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/LTL15248826002806166570.gal, -t, CGAL, -LTL, /tmp/LTL4662582282808669122.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/LTL15248826002806166570.gal -t CGAL -LTL /tmp/LTL4662582282808669122.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(MpG<1)"))||(("(StR<1)")&&(F("(MtF<1)")))))))
Formula 0 simplified : !XF(G"(MpG<1)" | ("(StR<1)" & F"(MtF<1)"))
Detected timeout of ITS tools.
[2021-05-09 12:39:35] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:39:35] [INFO ] Applying decomposition
[2021-05-09 12:39: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/graph16733878221895844284.txt, -o, /tmp/graph16733878221895844284.bin, -w, /tmp/graph16733878221895844284.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/graph16733878221895844284.bin, -l, -1, -v, -w, /tmp/graph16733878221895844284.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:39:35] [INFO ] Decomposing Gal with order
[2021-05-09 12:39:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:39:35] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:39:35] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:39:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 12:39:35] [INFO ] Time to serialize gal into /tmp/LTL79080147161013320.gal : 12 ms
[2021-05-09 12:39:35] [INFO ] Time to serialize properties into /tmp/LTL4863771669706653960.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/LTL79080147161013320.gal, -t, CGAL, -LTL, /tmp/LTL4863771669706653960.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/LTL79080147161013320.gal -t CGAL -LTL /tmp/LTL4863771669706653960.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(u3.MpG<1)"))||(("(u4.StR<1)")&&(F("(u1.MtF<1)")))))))
Formula 0 simplified : !XF(G"(u3.MpG<1)" | ("(u4.StR<1)" & F"(u1.MtF<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12745136159822218736
[2021-05-09 12:39:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12745136159822218736
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/ltsmin12745136159822218736]
Compilation finished in 117 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12745136159822218736]
Link finished in 29 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12745136159822218736]
LTSmin run took 866 ms.
FORMULA ClientsAndServers-PT-N0010P1-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P1-12 finished in 32063 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p0&&G(F(p1)))) U (!p2&&X((p0&&G(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:39:51] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:39:51] [INFO ] Implicit Places using invariants in 12 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:39:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:39:51] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:39:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:39:51] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LT s15 1), p0:(GEQ s18 1), p1:(GEQ s9 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-N0010P1-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-13 finished in 367 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0) U (p1 U (G(p1)||(p1&&F(!p0)&&G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:39:51] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:39:51] [INFO ] Implicit Places using invariants in 27 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:39:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:39:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:39:51] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:39:51] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 987 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 11}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 7}, { cond=p2, acceptance={} source=9 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=10 dest: 10}, { cond=(AND p0 p2 p1), acceptance={} source=10 dest: 11}, { cond=(AND p0 p2 p1), acceptance={} source=10 dest: 12}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=11 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=11 dest: 10}, { cond=(AND p0 p2 p1), acceptance={} source=11 dest: 11}], [{ cond=(AND p0 p1), acceptance={} source=12 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 13}], [{ cond=p0, acceptance={0, 1} source=13 dest: 13}]], initial=0, aps=[p2:(OR (LT s5 1) (LT s15 1)), p1:(LT s16 1), p0:(AND (GEQ s3 1) (GEQ s14 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-14 finished in 1160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||(F(p0)&&F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:39:52] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:39:53] [INFO ] Implicit Places using invariants in 158 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 171 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:39:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:39:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:39:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:39:53] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s19 1), p1:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 66 reset in 104 ms.
Product exploration explored 100000 steps with 68 reset in 119 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 63 reset in 162 ms.
Product exploration explored 100000 steps with 67 reset in 114 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 17 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 17 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 17 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 15 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 15 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 21 rules in 2 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 12:39:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-09 12:39:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:39:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 47 reset in 110 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 146 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-15 finished in 2238 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin829161058074414615
[2021-05-09 12:39:55] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 12:39:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 12:39:55] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 12:39:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 12:39:55] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 12:39:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 12:39:55] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin829161058074414615
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/ltsmin829161058074414615]
[2021-05-09 12:39:55] [INFO ] Applying decomposition
[2021-05-09 12:39:55] [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/graph7331261613809323709.txt, -o, /tmp/graph7331261613809323709.bin, -w, /tmp/graph7331261613809323709.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/graph7331261613809323709.bin, -l, -1, -v, -w, /tmp/graph7331261613809323709.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:39:55] [INFO ] Decomposing Gal with order
[2021-05-09 12:39:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:39:55] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:39:55] [INFO ] Flatten gal took : 7 ms
[2021-05-09 12:39:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:39:55] [INFO ] Time to serialize gal into /tmp/LTLFireability7460492762459274018.gal : 21 ms
[2021-05-09 12:39:55] [INFO ] Time to serialize properties into /tmp/LTLFireability2168245339091413403.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/LTLFireability7460492762459274018.gal, -t, CGAL, -LTL, /tmp/LTLFireability2168245339091413403.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/LTLFireability7460492762459274018.gal -t CGAL -LTL /tmp/LTLFireability2168245339091413403.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((F("(i0.u0.MpG>=1)"))||(X(G("(i3.u6.SpG<1)"))))&&(F(!("((i3.u6.CG<1)||(i4.u7.CwG<1))"))))))
Formula 0 simplified : !X((F"(i0.u0.MpG>=1)" | XG"(i3.u6.SpG<1)") & F!"((i3.u6.CG<1)||(i4.u7.CwG<1))")
Compilation finished in 472 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin829161058074414615]
Link finished in 79 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&(<>((LTLAPp1==true))||X([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin829161058074414615]
LTSmin run took 198165 ms.
FORMULA ClientsAndServers-PT-N0010P1-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620564194061

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

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