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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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.0K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620566198356

Running Version 0
[2021-05-09 13:16:42] [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 13:16:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 13:16:42] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-09 13:16:42] [INFO ] Transformed 25 places.
[2021-05-09 13:16:42] [INFO ] Transformed 18 transitions.
[2021-05-09 13:16:42] [INFO ] Parsed PT model containing 25 places and 18 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 13:16:42] [INFO ] Initial state test concluded for 3 properties.
FORMULA ClientsAndServers-PT-N0020P1-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P1-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P1-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 47 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:16:42] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-09 13:16:42] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:16:42] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 13:16:43] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:16:43] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-09 13:16:44] [INFO ] Dead Transitions using invariants and state equation in 965 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
[2021-05-09 13:16:44] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 13:16:44] [INFO ] Flatten gal took : 20 ms
FORMULA ClientsAndServers-PT-N0020P1-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P1-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P1-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P1-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 13:16:44] [INFO ] Flatten gal took : 4 ms
[2021-05-09 13:16:44] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 18184 steps, including 9 resets, run visited all 15 properties in 54 ms. (steps per millisecond=336 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0)&&X((p1||X((p2 U p3))))) U X(!p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:16:44] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:16:44] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:16:44] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:16:44] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:16:44] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:16:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 583 ms :[p2, p2, (AND (NOT p0) p2), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s14 1)), p2:(GEQ s9 1), p1:(AND (OR (LT s2 1) (LT s14 1)) (OR (LT s11 1) (LT s17 1))), p3:(AND (GEQ s9 1) (OR (LT s2 1) (LT s14 1)) (OR (LT s11 1) (LT s17 1)))], 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 233 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Knowledge obtained : [(NOT p0), (NOT p2), p1, (NOT p3)]
Stuttering acceptance computed with spot in 235 ms :[p2, p2, (AND (NOT p0) p2), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 220 ms :[p2, p2, (AND (NOT p0) p2), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), true, (NOT p0)]
Support contains 5 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 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 3 place count 22 transition count 18
Deduced a syphon composed of 6 places in 4 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 22 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 22 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 21 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 21 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 10 rules in 37 ms. Remains 21 /22 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2021-05-09 13:16:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 21 cols
[2021-05-09 13:16:47] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:16:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 17/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Product exploration explored 100000 steps with 50000 reset in 232 ms.
[2021-05-09 13:16:47] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:16:47] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:16:47] [INFO ] Time to serialize gal into /tmp/LTL5484683079283565695.gal : 14 ms
[2021-05-09 13:16:47] [INFO ] Time to serialize properties into /tmp/LTL18071489990790397039.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/LTL5484683079283565695.gal, -t, CGAL, -LTL, /tmp/LTL18071489990790397039.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/LTL5484683079283565695.gal -t CGAL -LTL /tmp/LTL18071489990790397039.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((F("((SF>=1)&&(Mi>=1))"))&&(X(("(((SF<1)||(Mi<1))&&((SG<1)||(SwG<1)))")||(X(("(MpA>=1)")U("(((MpA>=1)&&((SF<1)||(Mi<1)))&&((SG<1)||(SwG<1)))"))))))U(X("(MpA<1)"))))
Formula 0 simplified : !((F"((SF>=1)&&(Mi>=1))" & X("(((SF<1)||(Mi<1))&&((SG<1)||(SwG<1)))" | X("(MpA>=1)" U "(((MpA>=1)&&((SF<1)||(Mi<1)))&&((SG<1)||(SwG<1)))"))) U X"(MpA<1)")
Detected timeout of ITS tools.
[2021-05-09 13:17:02] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:17:02] [INFO ] Applying decomposition
[2021-05-09 13:17:02] [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/graph16855367858953188581.txt, -o, /tmp/graph16855367858953188581.bin, -w, /tmp/graph16855367858953188581.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/graph16855367858953188581.bin, -l, -1, -v, -w, /tmp/graph16855367858953188581.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:17:02] [INFO ] Decomposing Gal with order
[2021-05-09 13:17:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:17:02] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 13:17:03] [INFO ] Flatten gal took : 108 ms
[2021-05-09 13:17:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 13:17:03] [INFO ] Time to serialize gal into /tmp/LTL10320606504668122569.gal : 3 ms
[2021-05-09 13:17:03] [INFO ] Time to serialize properties into /tmp/LTL12384751158805710724.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/LTL10320606504668122569.gal, -t, CGAL, -LTL, /tmp/LTL12384751158805710724.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/LTL10320606504668122569.gal -t CGAL -LTL /tmp/LTL12384751158805710724.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((F("((i1.u2.SF>=1)&&(i2.u5.Mi>=1))"))&&(X(("(((i1.u2.SF<1)||(i2.u5.Mi<1))&&((i2.u3.SG<1)||(i0.u6.SwG<1)))")||(X(("(i2.u5.MpA>=1)")U("(((i2.u5.MpA>=1)&&((i1.u2.SF<1)||(i2.u5.Mi<1)))&&((i2.u3.SG<1)||(i0.u6.SwG<1)))"))))))U(X("(i2.u5.MpA<1)"))))
Formula 0 simplified : !((F"((i1.u2.SF>=1)&&(i2.u5.Mi>=1))" & X("(((i1.u2.SF<1)||(i2.u5.Mi<1))&&((i2.u3.SG<1)||(i0.u6.SwG<1)))" | X("(i2.u5.MpA>=1)" U "(((i2.u5.MpA>=1)&&((i1.u2.SF<1)||(i2.u5.Mi<1)))&&((i2.u3.SG<1)||(i0.u6.SwG<1)))"))) U X"(i2.u5.MpA<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3540349464407747211
[2021-05-09 13:17:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3540349464407747211
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/ltsmin3540349464407747211]
Compilation finished in 837 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3540349464407747211]
Link finished in 121 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((<>((LTLAPp0==true))&&X(((LTLAPp1==true)||X(((LTLAPp2==true) U (LTLAPp3==true)))))) U X(!(LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3540349464407747211]
LTSmin run took 644 ms.
FORMULA ClientsAndServers-PT-N0020P1-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P1-04 finished in 35324 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 3 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:19] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-09 13:17:19] [INFO ] Implicit Places using invariants in 116 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:17:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:17:20] [INFO ] Dead Transitions using invariants and state equation in 440 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:17:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:17:20] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s14 1)), p1:(OR (LT s16 1) (LT s0 1) (LT s13 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 50000 reset in 119 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 5 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 20 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 18 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 18 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 18 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 13 rules in 2 ms. Remains 18 /20 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 13:17:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2021-05-09 13:17:21] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-09 13:17:21] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/20 places, 16/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
[2021-05-09 13:17:21] [INFO ] Flatten gal took : 3 ms
[2021-05-09 13:17:21] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:17:21] [INFO ] Time to serialize gal into /tmp/LTL1055655117141896545.gal : 0 ms
[2021-05-09 13:17:21] [INFO ] Time to serialize properties into /tmp/LTL14975611150297696172.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/LTL1055655117141896545.gal, -t, CGAL, -LTL, /tmp/LTL14975611150297696172.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/LTL1055655117141896545.gal -t CGAL -LTL /tmp/LTL14975611150297696172.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((CR>=1)&&(Si>=1))"))||(X("(((SpG<1)||(Uf<1))||(MwU<1))"))))
Formula 0 simplified : !(F"((CR>=1)&&(Si>=1))" | X"(((SpG<1)||(Uf<1))||(MwU<1))")
Detected timeout of ITS tools.
[2021-05-09 13:17:36] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:17:36] [INFO ] Applying decomposition
[2021-05-09 13:17:36] [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/graph4314501893131010743.txt, -o, /tmp/graph4314501893131010743.bin, -w, /tmp/graph4314501893131010743.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/graph4314501893131010743.bin, -l, -1, -v, -w, /tmp/graph4314501893131010743.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:17:36] [INFO ] Decomposing Gal with order
[2021-05-09 13:17:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:17:36] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 13:17:36] [INFO ] Flatten gal took : 10 ms
[2021-05-09 13:17:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 13:17:36] [INFO ] Time to serialize gal into /tmp/LTL731169423576460425.gal : 28 ms
[2021-05-09 13:17:36] [INFO ] Time to serialize properties into /tmp/LTL12684205172238088016.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/LTL731169423576460425.gal, -t, CGAL, -LTL, /tmp/LTL12684205172238088016.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/LTL731169423576460425.gal -t CGAL -LTL /tmp/LTL12684205172238088016.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((u1.CR>=1)&&(u4.Si>=1))"))||(X("(((u3.SpG<1)||(u0.Uf<1))||(u4.MwU<1))"))))
Formula 0 simplified : !(F"((u1.CR>=1)&&(u4.Si>=1))" | X"(((u3.SpG<1)||(u0.Uf<1))||(u4.MwU<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12869179712754662192
[2021-05-09 13:17:51] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12869179712754662192
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/ltsmin12869179712754662192]
Compilation finished in 111 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12869179712754662192]
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))||X((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin12869179712754662192]
LTSmin run took 1456 ms.
FORMULA ClientsAndServers-PT-N0020P1-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P1-05 finished in 33747 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 0 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:53] [INFO ] Computed 4 place invariants in 9 ms
[2021-05-09 13:17:53] [INFO ] Implicit Places using invariants in 32 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:17:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:17:53] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:17:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:17:53] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s16 1), p1:(GEQ s12 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 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-06 finished in 308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&G(p1)) U (p0&&G(p1)&&(p2||X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:17:53] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 13:17:53] [INFO ] Implicit Places using invariants in 17 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:17:53] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:17:53] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(AND (OR (LT s0 1) (LT s13 1)) (LT s10 1)), p0:(OR (LT s0 1) (LT s13 1)), p2:(AND (OR (LT s1 1) (LT s17 1)) (OR (LT s0 1) (LT s13 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-10 finished in 242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 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 5 rules applied. Total rules applied 5 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 9 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 11 place count 17 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 11 place count 17 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 21 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 13:17:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:17:54] [INFO ] Implicit Places using invariants in 9 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
[2021-05-09 13:17:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 13:17:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:17:54] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 9/24 places, 8/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 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 6
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 7 transition count 5
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 6 transition count 5
Applied a total of 6 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:17:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:17:54] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:17:54] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 13:17:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s5 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 4 reset in 117 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 14 ms.
FORMULA ClientsAndServers-PT-N0020P1-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-11 finished in 428 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 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 2 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 13:17:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:17:54] [INFO ] Implicit Places using invariants in 36 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
[2021-05-09 13:17:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 13:17:54] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 13:17:54] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 7/24 places, 6/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 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Applied a total of 2 rules in 0 ms. Remains 6 /7 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:17:54] [INFO ] Computed 2 place invariants in 13 ms
[2021-05-09 13:17:54] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:17:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:17:54] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3 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 4 reset in 87 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-12 finished in 228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 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 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 4 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 13:17:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:17:55] [INFO ] Implicit Places using invariants in 477 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 491 ms to find 2 implicit places.
[2021-05-09 13:17:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 13:17:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 13:17:55] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 7/24 places, 6/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 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Applied a total of 2 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:17:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:17:55] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:17:55] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:17:55] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-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 s4 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 2951 reset in 54 ms.
Stack based approach found an accepted trace after 111 steps with 10 reset with depth 15 and stack size 15 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-13 finished in 799 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((F(p0)&&X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 0 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:17:55] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:17:55] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:55] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:17:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s15 1)), p1:(AND (GEQ s3 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 285 reset in 156 ms.
Product exploration explored 100000 steps with 300 reset in 173 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 294 reset in 127 ms.
Product exploration explored 100000 steps with 308 reset in 135 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2021-05-09 13:17:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:56] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 13:17:56] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Product exploration explored 100000 steps with 257 reset in 188 ms.
Stack based approach found an accepted trace after 24952 steps with 67 reset with depth 987 and stack size 985 in 26 ms.
FORMULA ClientsAndServers-PT-N0020P1-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-14 finished in 1690 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0) U X((G(p1)||(p1&&X(X(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:17:57] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:57] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:17:57] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:17:57] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:17:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 728 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p0), false, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 10}, { cond=p1, acceptance={} source=5 dest: 11}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 11}, { cond=(AND p0 p1), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 13}, { cond=(AND p0 p1), acceptance={} source=8 dest: 14}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 15}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 16}], [{ cond=(NOT p1), acceptance={} source=9 dest: 10}, { cond=p1, acceptance={} source=9 dest: 15}], [{ cond=(NOT p2), acceptance={} source=10 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=11 dest: 17}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=12 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=12 dest: 17}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=12 dest: 18}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=13 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=13 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=14 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=14 dest: 12}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=14 dest: 14}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=14 dest: 16}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=15 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={} source=15 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=16 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=16 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=16 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=16 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=16 dest: 9}], [{ cond=(NOT p1), acceptance={} source=17 dest: 4}, { cond=p1, acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=18 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=18 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=18 dest: 17}, { cond=(AND p0 p1), acceptance={} source=18 dest: 18}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s14 1)), p1:(GEQ s18 1), p2:(AND (GEQ s3 1) (GEQ s14 1))], 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, null, null, null][false, false, false, 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 3 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-15 finished in 852 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620566278548

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

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