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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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.7K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-N1000P0-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-15

=== Now, execution of the tool begins

BK_START 1620571057278

Running Version 0
[2021-05-09 14:37:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 14:37:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:37:40] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-09 14:37:40] [INFO ] Transformed 25 places.
[2021-05-09 14:37:40] [INFO ] Transformed 18 transitions.
[2021-05-09 14:37:40] [INFO ] Parsed PT model containing 25 places and 18 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:37:40] [INFO ] Initial state test concluded for 2 properties.
FORMULA ClientsAndServers-PT-N1000P0-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 43 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:37:40] [INFO ] Computed 8 place invariants in 20 ms
[2021-05-09 14:37:40] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:37:40] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 14:37:40] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:37:40] [INFO ] Computed 8 place invariants in 20 ms
[2021-05-09 14:37:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
[2021-05-09 14:37:40] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 14:37:40] [INFO ] Flatten gal took : 16 ms
FORMULA ClientsAndServers-PT-N1000P0-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:37:40] [INFO ] Flatten gal took : 4 ms
[2021-05-09 14:37:41] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100043 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=2565 ) properties (out of 23) seen :17
Running SMT prover for 6 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 14:37:41] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 14:37:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 14:37:41] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 14:37:41] [INFO ] Added : 12 causal constraints over 3 iterations in 51 ms. Result :sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-09 14:37:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 14:37:41] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-09 14:37:41] [INFO ] Added : 12 causal constraints over 3 iterations in 21 ms. Result :sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-09 14:37:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 14:37:41] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 14:37:41] [INFO ] Added : 16 causal constraints over 4 iterations in 24 ms. Result :sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:37:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:41] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:37:41] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 14:37:41] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-09 14:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:37:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 14:37:41] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 14:37:41] [INFO ] Added : 13 causal constraints over 3 iterations in 17 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2021-05-09 14:37:41] [INFO ] Initial state test concluded for 1 properties.
FORMULA ClientsAndServers-PT-N1000P0-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 15 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 16 place count 15 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 18 place count 14 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 24 place count 11 transition count 8
Applied a total of 24 rules in 7 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 14:37:41] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:37:41] [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:37:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 14:37:41] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:37:41] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 10/25 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.
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 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 5 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:37:41] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:37:41] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 14:37:41] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:37:41] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s4 s3), p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
[2021-05-09 14:37:42] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:37:42] [INFO ] Flatten gal took : 0 ms
[2021-05-09 14:37:42] [INFO ] Time to serialize gal into /tmp/LTL14066550094241252365.gal : 0 ms
[2021-05-09 14:37:42] [INFO ] Time to serialize properties into /tmp/LTL3071470417062725762.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/LTL14066550094241252365.gal, -t, CGAL, -LTL, /tmp/LTL3071470417062725762.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/LTL14066550094241252365.gal -t CGAL -LTL /tmp/LTL3071470417062725762.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(CR>=1)")||(G("(MpG<=SG)")))))
Formula 0 simplified : !F("(CR>=1)" | G"(MpG<=SG)")
Detected timeout of ITS tools.
[2021-05-09 14:37:57] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:37:57] [INFO ] Applying decomposition
[2021-05-09 14:37:57] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18136270912625838087.txt, -o, /tmp/graph18136270912625838087.bin, -w, /tmp/graph18136270912625838087.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/graph18136270912625838087.bin, -l, -1, -v, -w, /tmp/graph18136270912625838087.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:37:57] [INFO ] Decomposing Gal with order
[2021-05-09 14:37:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:37:57] [INFO ] Flatten gal took : 17 ms
[2021-05-09 14:37:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:37:57] [INFO ] Time to serialize gal into /tmp/LTL12534128870816312454.gal : 0 ms
[2021-05-09 14:37:57] [INFO ] Time to serialize properties into /tmp/LTL3810506396119708164.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/LTL12534128870816312454.gal, -t, CGAL, -LTL, /tmp/LTL3810506396119708164.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/LTL12534128870816312454.gal -t CGAL -LTL /tmp/LTL3810506396119708164.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(gi0.gu1.CR>=1)")||(G("(gu2.MpG<=gu2.SG)")))))
Formula 0 simplified : !F("(gi0.gu1.CR>=1)" | G"(gu2.MpG<=gu2.SG)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10710177366922817454
[2021-05-09 14:38:12] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10710177366922817454
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/ltsmin10710177366922817454]
Compilation finished in 210 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10710177366922817454]
Link finished in 58 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(((LTLAPp0==true)||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10710177366922817454]
LTSmin run took 488 ms.
FORMULA ClientsAndServers-PT-N1000P0-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-01 finished in 31805 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&(p1 U p2)))||X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:38:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:38:13] [INFO ] Implicit Places using invariants in 33 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:38:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:38:13] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 14:38:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:38:13] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-02 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=5 dest: 6}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 4}]], initial=5, aps=[p2:(GT s8 s7), p1:(LEQ 2 s7), p0:(LEQ s15 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Knowledge obtained : [(NOT p2), (NOT p1), p0]
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Applying partial POR strategy [true, true, false, true, true, false, false]
Stuttering acceptance computed with spot in 336 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 4 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 17 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 17 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 17 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 4 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 14:38:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-09 14:38:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:38:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 14/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
[2021-05-09 14:38:15] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:38:15] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:38:15] [INFO ] Time to serialize gal into /tmp/LTL1808368201443112914.gal : 20 ms
[2021-05-09 14:38:15] [INFO ] Time to serialize properties into /tmp/LTL17880657878260746545.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/LTL1808368201443112914.gal, -t, CGAL, -LTL, /tmp/LTL17880657878260746545.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/LTL1808368201443112914.gal -t CGAL -LTL /tmp/LTL17880657878260746545.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(("(StR<=Uf)")&&(("(CG>=2)")U("(CR>CG)"))))||(X(X(G("(StR<=Uf)"))))))
Formula 0 simplified : !(F("(StR<=Uf)" & ("(CG>=2)" U "(CR>CG)")) | XXG"(StR<=Uf)")
Detected timeout of ITS tools.
[2021-05-09 14:38:30] [INFO ] Flatten gal took : 19 ms
[2021-05-09 14:38:30] [INFO ] Applying decomposition
[2021-05-09 14:38:30] [INFO ] Flatten gal took : 10 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/graph7418178877477756979.txt, -o, /tmp/graph7418178877477756979.bin, -w, /tmp/graph7418178877477756979.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/graph7418178877477756979.bin, -l, -1, -v, -w, /tmp/graph7418178877477756979.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:38:30] [INFO ] Decomposing Gal with order
[2021-05-09 14:38:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:38:30] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:38:30] [INFO ] Flatten gal took : 5 ms
[2021-05-09 14:38:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:38:30] [INFO ] Time to serialize gal into /tmp/LTL14980326534323271872.gal : 7 ms
[2021-05-09 14:38:30] [INFO ] Time to serialize properties into /tmp/LTL1552807246672040359.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/LTL14980326534323271872.gal, -t, CGAL, -LTL, /tmp/LTL1552807246672040359.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/LTL14980326534323271872.gal -t CGAL -LTL /tmp/LTL1552807246672040359.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(("(gu5.StR<=gu5.Uf)")&&(("(gu1.CG>=2)")U("(gu1.CR>gu1.CG)"))))||(X(X(G("(gu5.StR<=gu5.Uf)"))))))
Formula 0 simplified : !(F("(gu5.StR<=gu5.Uf)" & ("(gu1.CG>=2)" U "(gu1.CR>gu1.CG)")) | XXG"(gu5.StR<=gu5.Uf)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7493641917060712910
[2021-05-09 14:38:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7493641917060712910
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/ltsmin7493641917060712910]
Compilation finished in 112 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7493641917060712910]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>(((LTLAPp0==true)&&((LTLAPp1==true) U (LTLAPp2==true))))||X(X([]((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7493641917060712910]
LTSmin run took 413 ms.
FORMULA ClientsAndServers-PT-N1000P0-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-02 finished in 32624 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&F(p1)) U X(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 0 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:38:46] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 14:38:46] [INFO ] Implicit Places using invariants in 48 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:38:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:38:46] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 14 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:38:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:38:46] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s3 s0), p1:(GT s15 s16), p2:(LEQ s15 s10)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
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 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 20 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 20 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 14 rules in 16 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 14:38:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 14:38:48] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-09 14:38:48] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
[2021-05-09 14:38:48] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:38:48] [INFO ] Flatten gal took : 14 ms
[2021-05-09 14:38:48] [INFO ] Time to serialize gal into /tmp/LTL1984970307380170817.gal : 1 ms
[2021-05-09 14:38:48] [INFO ] Time to serialize properties into /tmp/LTL13357951674970426857.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/LTL1984970307380170817.gal, -t, CGAL, -LTL, /tmp/LTL13357951674970426857.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/LTL1984970307380170817.gal -t CGAL -LTL /tmp/LTL13357951674970426857.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(SR<=Uf)")&&(F("(StR>SwG)")))U(X("(StR<=MtF)"))))
Formula 0 simplified : !(("(SR<=Uf)" & F"(StR>SwG)") U X"(StR<=MtF)")
Detected timeout of ITS tools.
[2021-05-09 14:39:03] [INFO ] Flatten gal took : 2 ms
[2021-05-09 14:39:03] [INFO ] Applying decomposition
[2021-05-09 14:39:03] [INFO ] Flatten gal took : 8 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/graph5285389651646616633.txt, -o, /tmp/graph5285389651646616633.bin, -w, /tmp/graph5285389651646616633.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/graph5285389651646616633.bin, -l, -1, -v, -w, /tmp/graph5285389651646616633.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:39:03] [INFO ] Decomposing Gal with order
[2021-05-09 14:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:39:03] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:39:03] [INFO ] Flatten gal took : 11 ms
[2021-05-09 14:39:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 14:39:03] [INFO ] Time to serialize gal into /tmp/LTL4662172661286090036.gal : 18 ms
[2021-05-09 14:39:03] [INFO ] Time to serialize properties into /tmp/LTL1363399630922012391.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4662172661286090036.gal, -t, CGAL, -LTL, /tmp/LTL1363399630922012391.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/LTL4662172661286090036.gal -t CGAL -LTL /tmp/LTL1363399630922012391.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("(gu0.SR<=gu0.Uf)")&&(F("(gu5.StR>gu5.SwG)")))U(X("(gu5.StR<=gu5.MtF)"))))
Formula 0 simplified : !(("(gu0.SR<=gu0.Uf)" & F"(gu5.StR>gu5.SwG)") U X"(gu5.StR<=gu5.MtF)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3418960929682018559
[2021-05-09 14:39:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3418960929682018559
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/ltsmin3418960929682018559]
Compilation finished in 151 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3418960929682018559]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp0==true)&&<>((LTLAPp1==true))) U X((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3418960929682018559]
LTSmin run took 722 ms.
FORMULA ClientsAndServers-PT-N1000P0-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-04 finished in 33460 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 16 transition count 11
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 18 place count 14 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 2 with 6 rules applied. Total rules applied 24 place count 11 transition count 8
Applied a total of 24 rules in 2 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 14:39:19] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:19] [INFO ] Implicit Places using invariants in 22 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
[2021-05-09 14:39:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 14:39:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:39:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 10/25 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-09 14:39:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 14:39:19] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-09 14:39:19] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 10/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s8 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Stack based approach found an accepted trace after 172 steps with 0 reset with depth 173 and stack size 173 in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-05 finished in 171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G((F(p1)&&F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
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 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 17 transition count 11
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 18 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 2 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 14:39:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:39:19] [INFO ] Implicit Places using invariants in 24 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
[2021-05-09 14:39:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 14:39:19] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-09 14:39:19] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 12/25 places, 10/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 12 transition count 8
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 8
Applied a total of 4 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 14:39:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 14:39:19] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 14:39:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 14:39:19] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s6), p1:(LEQ s2 s8), p2:(LEQ 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 0 reset in 226 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 143 ms.
[2021-05-09 14:39:20] [INFO ] Flatten gal took : 0 ms
[2021-05-09 14:39:20] [INFO ] Flatten gal took : 0 ms
[2021-05-09 14:39:20] [INFO ] Time to serialize gal into /tmp/LTL8825353854039722897.gal : 0 ms
[2021-05-09 14:39:20] [INFO ] Time to serialize properties into /tmp/LTL9516562701149082201.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/LTL8825353854039722897.gal, -t, CGAL, -LTL, /tmp/LTL9516562701149082201.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/LTL8825353854039722897.gal -t CGAL -LTL /tmp/LTL9516562701149082201.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(MpG>=3)"))||(G((F("(CA<=Si)"))&&(F(G("(Ci>=2)")))))))
Formula 0 simplified : !(G"(MpG>=3)" | G(F"(CA<=Si)" & FG"(Ci>=2)"))
Detected timeout of ITS tools.
[2021-05-09 14:39:35] [INFO ] Flatten gal took : 7 ms
[2021-05-09 14:39:35] [INFO ] Applying decomposition
[2021-05-09 14:39:35] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14660930826698806054.txt, -o, /tmp/graph14660930826698806054.bin, -w, /tmp/graph14660930826698806054.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/graph14660930826698806054.bin, -l, -1, -v, -w, /tmp/graph14660930826698806054.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:39:35] [INFO ] Decomposing Gal with order
[2021-05-09 14:39:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:39:35] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 14:39:35] [INFO ] Flatten gal took : 3 ms
[2021-05-09 14:39:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-09 14:39:35] [INFO ] Time to serialize gal into /tmp/LTL10669358392758785411.gal : 1 ms
[2021-05-09 14:39:35] [INFO ] Time to serialize properties into /tmp/LTL6589781023818891494.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/LTL10669358392758785411.gal, -t, CGAL, -LTL, /tmp/LTL6589781023818891494.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/LTL10669358392758785411.gal -t CGAL -LTL /tmp/LTL6589781023818891494.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(gi0.gu0.MpG>=3)"))||(G((F("(gu1.CA<=gu1.Si)"))&&(F(G("(gi0.gu2.Ci>=2)")))))))
Formula 0 simplified : !(G"(gi0.gu0.MpG>=3)" | G(F"(gu1.CA<=gu1.Si)" & FG"(gi0.gu2.Ci>=2)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18401657877813159006
[2021-05-09 14:39:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18401657877813159006
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/ltsmin18401657877813159006]
Compilation finished in 130 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin18401657877813159006]
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, ([]((LTLAPp0==true))||[]((<>((LTLAPp1==true))&&<>([]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin18401657877813159006]
LTSmin run took 930 ms.
FORMULA ClientsAndServers-PT-N1000P0-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-07 finished in 32302 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(G(p1)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 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 0 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:39:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 14:39:52] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:39:52] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-09 14:39:52] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:39:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 14:39:52] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-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: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (LEQ s17 s8) (LEQ s14 s20)), p1:(AND (LEQ s14 s20) (GT 2 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-08 finished in 335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((G(p0)||(p1&&X(p2))))||((G(p0)||(p1&&X(p2)))&&F(p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 0 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:39:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 14:39:52] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:52] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:52] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 14:39:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
[2021-05-09 14:39:52] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 403 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND p1 (NOT p3) (NOT p2))), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(GT s18 s6), p1:(OR (GT s19 s2) (LEQ s15 s17)), p3:(LEQ s15 s17), p2:(GT s18 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-10 finished in 592 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(X(X((p1&&G(F(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 14:39:53] [INFO ] Computed 5 place invariants in 9 ms
[2021-05-09 14:39:53] [INFO ] Implicit Places using invariants in 169 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:53] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:39:53] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 14:39:53] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 14:39:53] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 939 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 9}, { cond=(NOT p0), acceptance={} source=3 dest: 10}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=p1, acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 11}, { cond=(NOT p0), acceptance={} source=9 dest: 12}], [{ cond=true, acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 12}, { cond=(AND p0 p1), acceptance={} source=11 dest: 14}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=11 dest: 15}], [{ cond=p1, acceptance={} source=12 dest: 8}, { cond=(NOT p1), acceptance={} source=12 dest: 13}], [{ cond=(NOT p1), acceptance={} source=13 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=13 dest: 7}, { cond=p1, acceptance={} source=13 dest: 8}], [{ cond=(NOT p0), acceptance={} source=14 dest: 8}, { cond=p0, acceptance={} source=14 dest: 14}, { cond=(AND p0 (NOT p2)), acceptance={} source=14 dest: 15}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=15 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0} source=15 dest: 15}]], initial=0, aps=[p0:(LEQ s20 s16), p1:(LEQ 1 s9), p2:(GT s19 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-11 finished in 1234 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620571194767

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N1000P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N1000P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r045-oct2-162038291700244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N1000P0.tgz
mv ClientsAndServers-PT-N1000P0 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;