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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15336.403 3600000.00 4025071.00 317.50 TFFFT?FFFTFFFFFF 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-162038291600237.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-N0500P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291600237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K 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.2K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.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-N0500P0-00
FORMULA_NAME ClientsAndServers-PT-N0500P0-01
FORMULA_NAME ClientsAndServers-PT-N0500P0-02
FORMULA_NAME ClientsAndServers-PT-N0500P0-03
FORMULA_NAME ClientsAndServers-PT-N0500P0-04
FORMULA_NAME ClientsAndServers-PT-N0500P0-05
FORMULA_NAME ClientsAndServers-PT-N0500P0-06
FORMULA_NAME ClientsAndServers-PT-N0500P0-07
FORMULA_NAME ClientsAndServers-PT-N0500P0-08
FORMULA_NAME ClientsAndServers-PT-N0500P0-09
FORMULA_NAME ClientsAndServers-PT-N0500P0-10
FORMULA_NAME ClientsAndServers-PT-N0500P0-11
FORMULA_NAME ClientsAndServers-PT-N0500P0-12
FORMULA_NAME ClientsAndServers-PT-N0500P0-13
FORMULA_NAME ClientsAndServers-PT-N0500P0-14
FORMULA_NAME ClientsAndServers-PT-N0500P0-15

=== Now, execution of the tool begins

BK_START 1620570506689

Running Version 0
[2021-05-09 14:28:30] [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 14:28:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:28:30] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-09 14:28:30] [INFO ] Transformed 25 places.
[2021-05-09 14:28:30] [INFO ] Transformed 18 transitions.
[2021-05-09 14:28:30] [INFO ] Parsed PT model containing 25 places and 18 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:28:30] [INFO ] Initial state test concluded for 5 properties.
FORMULA ClientsAndServers-PT-N0500P0-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 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 23 transition count 18
Applied a total of 2 rules in 40 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:28:30] [INFO ] Computed 6 place invariants in 10 ms
[2021-05-09 14:28:30] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:28:30] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 14:28:30] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:28:30] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 14:28:31] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/25 places, 18/18 transitions.
[2021-05-09 14:28:31] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 14:28:31] [INFO ] Flatten gal took : 16 ms
FORMULA ClientsAndServers-PT-N0500P0-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:28:31] [INFO ] Flatten gal took : 3 ms
[2021-05-09 14:28:31] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100091 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=1316 ) properties (out of 16) seen :15
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:28:31] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 14:28:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 14:28:31] [INFO ] [Real]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-09 14:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:28:31] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-09 14:28:31] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-09 14:28:31] [INFO ] Added : 13 causal constraints over 3 iterations in 110 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F(p1)&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:28:31] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 14:28:31] [INFO ] Implicit Places using invariants in 40 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:28:31] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-09 14:28:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:28:31] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:28:31] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p2:(OR (LT s0 1) (LT s13 1)), p0:(GEQ s20 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 1 reset in 358 ms.
Product exploration explored 100000 steps with 0 reset in 457 ms.
Knowledge obtained : [(NOT p1), p2, p0]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), true]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Product exploration explored 100000 steps with 0 reset in 152 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), true]
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 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 21 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 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 18 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 18 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 17 rules in 13 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 14:28:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2021-05-09 14:28:34] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 14:28:34] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/21 places, 14/18 transitions.
Product exploration explored 100000 steps with 1 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 232 ms.
[2021-05-09 14:28:34] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:28:34] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:28:34] [INFO ] Time to serialize gal into /tmp/LTL14997770671101227688.gal : 7 ms
[2021-05-09 14:28:34] [INFO ] Time to serialize properties into /tmp/LTL9278946835521804427.ltl : 12 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/LTL14997770671101227688.gal, -t, CGAL, -LTL, /tmp/LTL9278946835521804427.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/LTL14997770671101227688.gal -t CGAL -LTL /tmp/LTL9278946835521804427.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((X(G("(Ci>=1)")))&&(F("((CA>=1)&&(CwA>=1))")))&&(F("((Uf<1)||(MwU<1))"))))
Formula 0 simplified : !(XG"(Ci>=1)" & F"((CA>=1)&&(CwA>=1))" & F"((Uf<1)||(MwU<1))")
Detected timeout of ITS tools.
[2021-05-09 14:28:49] [INFO ] Flatten gal took : 7 ms
[2021-05-09 14:28:49] [INFO ] Applying decomposition
[2021-05-09 14:28:49] [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/graph3410286761159050445.txt, -o, /tmp/graph3410286761159050445.bin, -w, /tmp/graph3410286761159050445.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/graph3410286761159050445.bin, -l, -1, -v, -w, /tmp/graph3410286761159050445.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:28:49] [INFO ] Decomposing Gal with order
[2021-05-09 14:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:28:49] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:28:50] [INFO ] Flatten gal took : 87 ms
[2021-05-09 14:28:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 14:28:50] [INFO ] Time to serialize gal into /tmp/LTL11263912119879162798.gal : 1 ms
[2021-05-09 14:28:50] [INFO ] Time to serialize properties into /tmp/LTL16348333427043012042.ltl : 18 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/LTL11263912119879162798.gal, -t, CGAL, -LTL, /tmp/LTL16348333427043012042.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/LTL11263912119879162798.gal -t CGAL -LTL /tmp/LTL16348333427043012042.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((X(G("(u2.Ci>=1)")))&&(F("((u2.CA>=1)&&(u1.CwA>=1))")))&&(F("((u3.Uf<1)||(u5.MwU<1))"))))
Formula 0 simplified : !(XG"(u2.Ci>=1)" & F"((u2.CA>=1)&&(u1.CwA>=1))" & F"((u3.Uf<1)||(u5.MwU<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15699160463445900375
[2021-05-09 14:29:05] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15699160463445900375
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/ltsmin15699160463445900375]
Compilation finished in 269 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15699160463445900375]
Link finished in 52 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/ltsmin15699160463445900375]
LTSmin run took 4345 ms.
FORMULA ClientsAndServers-PT-N0500P0-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0500P0-01 finished in 38274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:29:09] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 14:29:09] [INFO ] Implicit Places using invariants in 71 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:29:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:29:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 2 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 14:29:10] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 14:29:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LT s9 1), p0:(GEQ s15 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 110 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0500P0-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-02 finished in 271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:29:10] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 14:29:10] [INFO ] Implicit Places using invariants in 34 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:29:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:29:10] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 20/23 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 14:29:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:29:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s17 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 54 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-03 finished in 224 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:29:10] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 14:29:10] [INFO ] Implicit Places using invariants in 26 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:29:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:29:10] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:29:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:29:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
[2021-05-09 14:29:11] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:29:11] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:29:11] [INFO ] Time to serialize gal into /tmp/LTL4652638716682631009.gal : 0 ms
[2021-05-09 14:29:11] [INFO ] Time to serialize properties into /tmp/LTL10266650409497631143.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/LTL4652638716682631009.gal, -t, CGAL, -LTL, /tmp/LTL10266650409497631143.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/LTL4652638716682631009.gal -t CGAL -LTL /tmp/LTL10266650409497631143.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(MpA<1)")&&(X("(MpA<1)")))))
Formula 0 simplified : !F("(MpA<1)" & X"(MpA<1)")
Detected timeout of ITS tools.
[2021-05-09 14:29:26] [INFO ] Flatten gal took : 3 ms
[2021-05-09 14:29:26] [INFO ] Applying decomposition
[2021-05-09 14:29:26] [INFO ] Flatten gal took : 4 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/graph16340355118670090532.txt, -o, /tmp/graph16340355118670090532.bin, -w, /tmp/graph16340355118670090532.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/graph16340355118670090532.bin, -l, -1, -v, -w, /tmp/graph16340355118670090532.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:29:26] [INFO ] Decomposing Gal with order
[2021-05-09 14:29:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:29:26] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:29:26] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:29:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:29:26] [INFO ] Time to serialize gal into /tmp/LTL14094444389599902312.gal : 0 ms
[2021-05-09 14:29:26] [INFO ] Time to serialize properties into /tmp/LTL6733452438521402556.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/LTL14094444389599902312.gal, -t, CGAL, -LTL, /tmp/LTL6733452438521402556.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/LTL14094444389599902312.gal -t CGAL -LTL /tmp/LTL6733452438521402556.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("(u0.MpA<1)")&&(X("(u0.MpA<1)")))))
Formula 0 simplified : !F("(u0.MpA<1)" & X"(u0.MpA<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6254788674453551532
[2021-05-09 14:29:41] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6254788674453551532
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/ltsmin6254788674453551532]
Compilation finished in 115 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6254788674453551532]
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((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin6254788674453551532]
LTSmin run took 211 ms.
FORMULA ClientsAndServers-PT-N0500P0-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0500P0-04 finished in 31470 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:29:41] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 14:29:41] [INFO ] Implicit Places using invariants in 42 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:29:41] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:29:41] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 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 14:29:41] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:29:41] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s18 1), p0:(GEQ s15 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12848 reset in 67 ms.
Product exploration explored 100000 steps with 12465 reset in 59 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 12873 reset in 51 ms.
Product exploration explored 100000 steps with 12594 reset in 61 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 16 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 16 transition count 14
Performed 3 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 3 rules applied. Total rules applied 20 place count 16 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 14 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 14 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 24 rules in 5 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2021-05-09 14:29:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2021-05-09 14:29:42] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:29:42] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/20 places, 12/18 transitions.
Product exploration explored 100000 steps with 15136 reset in 80 ms.
Product exploration explored 100000 steps with 15120 reset in 74 ms.
[2021-05-09 14:29:42] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:29:42] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:29:42] [INFO ] Time to serialize gal into /tmp/LTL992614180929352553.gal : 0 ms
[2021-05-09 14:29:42] [INFO ] Time to serialize properties into /tmp/LTL6689252445584144483.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/LTL992614180929352553.gal, -t, CGAL, -LTL, /tmp/LTL6689252445584144483.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/LTL992614180929352553.gal -t CGAL -LTL /tmp/LTL6689252445584144483.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(StR>=1)"))U("(Cb>=1)"))))
Formula 0 simplified : !X(F"(StR>=1)" U "(Cb>=1)")
Detected timeout of ITS tools.
[2021-05-09 14:29:57] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:29:57] [INFO ] Applying decomposition
[2021-05-09 14:29:57] [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/graph4576466977487784188.txt, -o, /tmp/graph4576466977487784188.bin, -w, /tmp/graph4576466977487784188.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/graph4576466977487784188.bin, -l, -1, -v, -w, /tmp/graph4576466977487784188.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:29:57] [INFO ] Decomposing Gal with order
[2021-05-09 14:29:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:29:57] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:29:57] [INFO ] Flatten gal took : 4 ms
[2021-05-09 14:29:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:29:57] [INFO ] Time to serialize gal into /tmp/LTL7511642950214466245.gal : 6 ms
[2021-05-09 14:29:57] [INFO ] Time to serialize properties into /tmp/LTL8876992881121037610.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/LTL7511642950214466245.gal, -t, CGAL, -LTL, /tmp/LTL8876992881121037610.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/LTL7511642950214466245.gal -t CGAL -LTL /tmp/LTL8876992881121037610.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(u1.StR>=1)"))U("(u4.Cb>=1)"))))
Formula 0 simplified : !X(F"(u1.StR>=1)" U "(u4.Cb>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14759837326762108406
[2021-05-09 14:30:12] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14759837326762108406
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/ltsmin14759837326762108406]
Compilation finished in 103 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14759837326762108406]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true)) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14759837326762108406]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0500P0-05 finished in 46037 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 13
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 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 19 place count 13 transition count 9
Applied a total of 19 rules in 4 ms. Remains 13 /23 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2021-05-09 14:30:27] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:30:27] [INFO ] Implicit Places using invariants in 13 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-09 14:30:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:30:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:30:27] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 12/23 places, 9/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 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
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 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 2 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 14:30:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:30:27] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 14:30:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:30:27] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LT s6 1), p1:(AND (GEQ s2 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-06 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||((!p2 U (p3||G(!p2)))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
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 3 rules applied. Total rules applied 3 place count 23 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 7 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 18 transition count 13
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 11 place count 17 transition count 13
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 17 place count 14 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 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 18 place count 13 transition count 9
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 12 transition count 9
Applied a total of 20 rules in 4 ms. Remains 12 /23 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:30:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:30:28] [INFO ] Implicit Places using invariants in 15 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
[2021-05-09 14:30:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 14:30:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:30:28] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 11/23 places, 9/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2021-05-09 14:30:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 14:30:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:30:28] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/23 places, 9/18 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p3) p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LT s10 1) (OR (LT s2 1) (LT s7 1))), p3:(AND (LT s10 1) (GEQ s2 1) (GEQ s7 1)), p2:(GEQ s10 1), p0:(AND (OR (LT s2 1) (LT s7 1)) (LT s10 1))], nbAcceptance=2, 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 88 reset in 148 ms.
Stack based approach found an accepted trace after 34 steps with 2 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-07 finished in 337 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:30:28] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 14:30:28] [INFO ] Implicit Places using invariants in 30 ms returned [19, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:30:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:30:28] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:30:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:30:28] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s2 1) (GEQ s14 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-N0500P0-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-08 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:30:28] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 14:30:28] [INFO ] Implicit Places using invariants in 16 ms returned [19, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:30:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:30:28] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:30:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:30:28] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 90 ms :[p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-09 automaton TGBA [mat=[[{ cond=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:(AND (GEQ s2 1) (GEQ 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 56 ms.
Product exploration explored 100000 steps with 33333 reset in 60 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Product exploration explored 100000 steps with 33333 reset in 60 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 78 ms :[p0, p0, 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 5 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 14:30:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 14:30:29] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:30:29] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 33333 reset in 107 ms.
Product exploration explored 100000 steps with 33333 reset in 104 ms.
[2021-05-09 14:30:29] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:30:29] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:30:29] [INFO ] Time to serialize gal into /tmp/LTL17879265598244839650.gal : 1 ms
[2021-05-09 14:30:29] [INFO ] Time to serialize properties into /tmp/LTL15153540358633959074.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/LTL17879265598244839650.gal, -t, CGAL, -LTL, /tmp/LTL15153540358633959074.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/LTL17879265598244839650.gal -t CGAL -LTL /tmp/LTL15153540358633959074.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((SF<1)||(Mi<1))")))))
Formula 0 simplified : !XXF"((SF<1)||(Mi<1))"
Detected timeout of ITS tools.
[2021-05-09 14:30:44] [INFO ] Flatten gal took : 3 ms
[2021-05-09 14:30:44] [INFO ] Applying decomposition
[2021-05-09 14:30:44] [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/graph7907144389369320988.txt, -o, /tmp/graph7907144389369320988.bin, -w, /tmp/graph7907144389369320988.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/graph7907144389369320988.bin, -l, -1, -v, -w, /tmp/graph7907144389369320988.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:30:44] [INFO ] Decomposing Gal with order
[2021-05-09 14:30:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:30:44] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:30:44] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:30:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:30:44] [INFO ] Time to serialize gal into /tmp/LTL6062504243717939135.gal : 1 ms
[2021-05-09 14:30:44] [INFO ] Time to serialize properties into /tmp/LTL16242690544017096917.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/LTL6062504243717939135.gal, -t, CGAL, -LTL, /tmp/LTL16242690544017096917.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/LTL6062504243717939135.gal -t CGAL -LTL /tmp/LTL16242690544017096917.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((u3.SF<1)||(i0.u1.Mi<1))")))))
Formula 0 simplified : !XXF"((u3.SF<1)||(i0.u1.Mi<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3526636756233906438
[2021-05-09 14:30:59] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3526636756233906438
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/ltsmin3526636756233906438]
Compilation finished in 99 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3526636756233906438]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3526636756233906438]
LTSmin run took 506 ms.
FORMULA ClientsAndServers-PT-N0500P0-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0500P0-09 finished in 31656 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
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 6 rules applied. Total rules applied 6 place count 23 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 13 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 15 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 11 transition count 7
Applied a total of 23 rules in 1 ms. Remains 11 /23 variables (removed 12) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2021-05-09 14:31:00] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 14:31:00] [INFO ] Implicit Places using invariants in 18 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 18 ms to find 2 implicit places.
[2021-05-09 14:31:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 14:31:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 9/23 places, 7/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
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 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 7 transition count 5
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 6 place count 6 transition count 4
Applied a total of 6 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-09 14:31:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:31:00] [INFO ] Implicit Places using invariants in 14 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 5/23 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-09 14:31:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 14:31:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 3 iterations. Remains : 5/23 places, 4/18 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s2 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 0 reset in 57 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-N0500P0-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-11 finished in 161 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 14:31:00] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 14:31:00] [INFO ] Implicit Places using invariants in 36 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:31:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:31:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s15 1), p1:(GEQ 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 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 207 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 193 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 17 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 17 transition count 15
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 18 place count 17 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 16 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 16 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 3 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 14:31:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-09 14:31:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 14/18 transitions.
Product exploration explored 100000 steps with 0 reset in 56 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 38 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-12 finished in 1152 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 18 transition count 12
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 16 transition count 12
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 16 transition count 11
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 15 transition count 11
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 12 transition count 8
Applied a total of 21 rules in 3 ms. Remains 12 /23 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-09 14:31:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:31:01] [INFO ] Implicit Places using invariants in 15 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
[2021-05-09 14:31:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 14:31:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 10/23 places, 8/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:31:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:31:01] [INFO ] Implicit Places using invariants in 12 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 7/23 places, 6/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-09 14:31:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 14:31:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 3 iterations. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 1) (LT s3 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 3738 reset in 63 ms.
Stack based approach found an accepted trace after 244 steps with 8 reset with depth 23 and stack size 23 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-13 finished in 194 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
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 3 rules applied. Total rules applied 3 place count 23 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 7 place count 20 transition count 14
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 14
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 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 12 place count 17 transition count 12
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 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 13 place count 16 transition count 11
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 15 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 4 with 4 rules applied. Total rules applied 19 place count 13 transition count 9
Applied a total of 19 rules in 2 ms. Remains 13 /23 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2021-05-09 14:31:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:31:01] [INFO ] Implicit Places using invariants in 12 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12 ms to find 2 implicit places.
[2021-05-09 14:31:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 14:31:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 11/23 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
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 9 transition count 6
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 8 transition count 6
Applied a total of 6 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:31:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:31:01] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:31:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:31:01] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1) (LT s6 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 0 reset in 72 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-14 finished in 171 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 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 19 transition count 14
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 2 with 4 rules applied. Total rules applied 12 place count 17 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 16 transition count 12
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 16 transition count 11
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 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 14 transition count 10
Applied a total of 17 rules in 1 ms. Remains 14 /23 variables (removed 9) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-09 14:31:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 14:31:01] [INFO ] Implicit Places using invariants in 21 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
[2021-05-09 14:31:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 14:31:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 13/23 places, 10/18 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 1 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 14:31:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:31:01] [INFO ] Implicit Places using invariants in 14 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 11/23 places, 9/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2021-05-09 14:31:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 14:31:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:31:02] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 3 iterations. Remains : 11/23 places, 9/18 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s8 1)), p1:(AND (GEQ s1 1) (GEQ s9 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 15 reset in 81 ms.
Stack based approach found an accepted trace after 563 steps with 6 reset with depth 535 and stack size 535 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-15 finished in 262 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1100686972684289776
[2021-05-09 14:31:02] [INFO ] Applying decomposition
[2021-05-09 14:31:02] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 14:31:02] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:31:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:31:02] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 14:31:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 14:31:02] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 14:31:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5388943516019637069.txt, -o, /tmp/graph5388943516019637069.bin, -w, /tmp/graph5388943516019637069.weights], workingDir=null]
[2021-05-09 14:31:02] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1100686972684289776
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/ltsmin1100686972684289776]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5388943516019637069.bin, -l, -1, -v, -w, /tmp/graph5388943516019637069.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:31:02] [INFO ] Decomposing Gal with order
[2021-05-09 14:31:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:31:02] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:31:02] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:31:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:31:02] [INFO ] Time to serialize gal into /tmp/LTLFireability5926973269375828948.gal : 0 ms
[2021-05-09 14:31:02] [INFO ] Time to serialize properties into /tmp/LTLFireability13129956037235951004.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/LTLFireability5926973269375828948.gal, -t, CGAL, -LTL, /tmp/LTLFireability13129956037235951004.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/LTLFireability5926973269375828948.gal -t CGAL -LTL /tmp/LTLFireability13129956037235951004.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(u2.StR>=1)"))U("(i5.u7.Cb>=1)"))))
Formula 0 simplified : !X(F"(u2.StR>=1)" U "(i5.u7.Cb>=1)")
Compilation finished in 130 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1100686972684289776]
Link finished in 49 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)) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin1100686972684289776]
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( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.296: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.296: LTL layer: formula: X((<>((LTLAPp0==true)) U (LTLAPp1==true)))
pins2lts-mc-linux64( 7/ 8), 0.293: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.296: "X((<>((LTLAPp0==true)) U (LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.296: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.302: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.295: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.303: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.307: buchi has 4 states
pins2lts-mc-linux64( 6/ 8), 0.301: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.302: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.294: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.308: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.357: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.357: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.357: State length is 24, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.357: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.357: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.357: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.357: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.518: ~87 levels ~960 states ~1912 transitions
pins2lts-mc-linux64( 6/ 8), 0.519: ~168 levels ~1920 states ~3208 transitions
pins2lts-mc-linux64( 1/ 8), 0.525: ~394 levels ~3840 states ~10264 transitions
pins2lts-mc-linux64( 1/ 8), 0.526: ~715 levels ~7680 states ~15400 transitions
pins2lts-mc-linux64( 1/ 8), 0.527: ~1358 levels ~15360 states ~25688 transitions
pins2lts-mc-linux64( 1/ 8), 0.530: ~2646 levels ~30720 states ~46280 transitions
pins2lts-mc-linux64( 4/ 8), 0.557: ~3521 levels ~61440 states ~136792 transitions
pins2lts-mc-linux64( 4/ 8), 0.601: ~4024 levels ~122880 states ~269128 transitions
pins2lts-mc-linux64( 6/ 8), 0.684: ~4038 levels ~245760 states ~479504 transitions
pins2lts-mc-linux64( 6/ 8), 0.857: ~4038 levels ~491520 states ~928568 transitions
pins2lts-mc-linux64( 6/ 8), 1.236: ~4038 levels ~983040 states ~1904136 transitions
pins2lts-mc-linux64( 6/ 8), 1.885: ~4038 levels ~1966080 states ~3747376 transitions
pins2lts-mc-linux64( 6/ 8), 3.327: ~4038 levels ~3932160 states ~7610888 transitions
pins2lts-mc-linux64( 7/ 8), 6.684: ~4090 levels ~7864320 states ~20858456 transitions
pins2lts-mc-linux64( 6/ 8), 13.394: ~4042 levels ~15728640 states ~35297408 transitions
pins2lts-mc-linux64( 6/ 8), 27.692: ~4050 levels ~31457280 states ~74996736 transitions
pins2lts-mc-linux64( 6/ 8), 56.815: ~4050 levels ~62914560 states ~158541168 transitions
pins2lts-mc-linux64( 0/ 8), 102.290: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 102.325:
pins2lts-mc-linux64( 0/ 8), 102.325: mean standard work distribution: 5.5% (states) 4.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 102.325:
pins2lts-mc-linux64( 0/ 8), 102.325: Explored 94562503 states 278954726 transitions, fanout: 2.950
pins2lts-mc-linux64( 0/ 8), 102.325: Total exploration time 101.940 sec (101.910 sec minimum, 101.927 sec on average)
pins2lts-mc-linux64( 0/ 8), 102.325: States per second: 927629, Transitions per second: 2736460
pins2lts-mc-linux64( 0/ 8), 102.325:
pins2lts-mc-linux64( 0/ 8), 102.325: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 102.325: Redundant explorations: 1.3701
pins2lts-mc-linux64( 0/ 8), 102.325:
pins2lts-mc-linux64( 0/ 8), 102.325: Queue width: 8B, total height: 33965, memory: 0.26MB
pins2lts-mc-linux64( 0/ 8), 102.325: Tree memory: 967.7MB, 10.9 B/state, compr.: 11.1%
pins2lts-mc-linux64( 0/ 8), 102.325: Tree fill ratio (roots/leafs): 69.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 102.325: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 102.325: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 102.325: Est. total memory use: 968.0MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true)) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin1100686972684289776]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true)) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin1100686972684289776]
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 14:51:52] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:51:52] [INFO ] Time to serialize gal into /tmp/LTLFireability4092598091671111611.gal : 1 ms
[2021-05-09 14:51:52] [INFO ] Time to serialize properties into /tmp/LTLFireability861209037051876849.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/LTLFireability4092598091671111611.gal, -t, CGAL, -LTL, /tmp/LTLFireability861209037051876849.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/LTLFireability4092598091671111611.gal -t CGAL -LTL /tmp/LTLFireability861209037051876849.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(StR>=1)"))U("(Cb>=1)"))))
Formula 0 simplified : !X(F"(StR>=1)" U "(Cb>=1)")
Detected timeout of ITS tools.
[2021-05-09 15:12:42] [INFO ] Flatten gal took : 16 ms
[2021-05-09 15:12:42] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 15:12:42] [INFO ] Transformed 23 places.
[2021-05-09 15:12:42] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 15:12:42] [INFO ] Time to serialize gal into /tmp/LTLFireability3122545445307421483.gal : 0 ms
[2021-05-09 15:12:42] [INFO ] Time to serialize properties into /tmp/LTLFireability14362363804904531287.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/LTLFireability3122545445307421483.gal, -t, CGAL, -LTL, /tmp/LTLFireability14362363804904531287.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/LTLFireability3122545445307421483.gal -t CGAL -LTL /tmp/LTLFireability14362363804904531287.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 : !((X((F("(StR>=1)"))U("(Cb>=1)"))))
Formula 0 simplified : !X(F"(StR>=1)" U "(Cb>=1)")

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

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