About the Execution of ITS-Tools for ServersAndClients-PT-100040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6189.092 | 172766.00 | 410928.00 | 486.80 | TTFFFTFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r311-tall-162132107900133.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ServersAndClients-PT-100040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132107900133
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.2M
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.8K May 11 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 11 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 7.9M May 12 08:13 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 ServersAndClients-PT-100040-00
FORMULA_NAME ServersAndClients-PT-100040-01
FORMULA_NAME ServersAndClients-PT-100040-02
FORMULA_NAME ServersAndClients-PT-100040-03
FORMULA_NAME ServersAndClients-PT-100040-04
FORMULA_NAME ServersAndClients-PT-100040-05
FORMULA_NAME ServersAndClients-PT-100040-06
FORMULA_NAME ServersAndClients-PT-100040-07
FORMULA_NAME ServersAndClients-PT-100040-08
FORMULA_NAME ServersAndClients-PT-100040-09
FORMULA_NAME ServersAndClients-PT-100040-10
FORMULA_NAME ServersAndClients-PT-100040-11
FORMULA_NAME ServersAndClients-PT-100040-12
FORMULA_NAME ServersAndClients-PT-100040-13
FORMULA_NAME ServersAndClients-PT-100040-14
FORMULA_NAME ServersAndClients-PT-100040-15
=== Now, execution of the tool begins
BK_START 1621437238265
Running Version 0
[2021-05-19 15:13:59] [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-19 15:13:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 15:14:00] [INFO ] Load time of PNML (sax parser for PT used): 368 ms
[2021-05-19 15:14:00] [INFO ] Transformed 4441 places.
[2021-05-19 15:14:00] [INFO ] Transformed 8200 transitions.
[2021-05-19 15:14:00] [INFO ] Found NUPN structural information;
[2021-05-19 15:14:00] [INFO ] Parsed PT model containing 4441 places and 8200 transitions in 440 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 15:14:00] [INFO ] Initial state test concluded for 1 properties.
Support contains 52 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 709 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:01] [INFO ] Computed 241 place invariants in 149 ms
[2021-05-19 15:14:02] [INFO ] Implicit Places using invariants in 969 ms returned []
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:02] [INFO ] Computed 241 place invariants in 80 ms
[2021-05-19 15:14:02] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:02] [INFO ] Computed 241 place invariants in 51 ms
[2021-05-19 15:14:03] [INFO ] Dead Transitions using invariants and state equation in 742 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4441/4441 places, 8200/8200 transitions.
[2021-05-19 15:14:04] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-19 15:14:04] [INFO ] Flatten gal took : 444 ms
FORMULA ServersAndClients-PT-100040-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 15:14:04] [INFO ] Flatten gal took : 295 ms
[2021-05-19 15:14:05] [INFO ] Input system was already deterministic with 8200 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2143 ms. (steps per millisecond=46 ) properties (out of 27) seen :25
Running SMT prover for 2 properties.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:07] [INFO ] Computed 241 place invariants in 58 ms
[2021-05-19 15:14:08] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:2
[2021-05-19 15:14:09] [INFO ] [Nat]Absence check using 141 positive place invariants in 310 ms returned sat
[2021-05-19 15:14:09] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 60 ms returned sat
[2021-05-19 15:14:09] [INFO ] SMT Verify possible in nat domain returned unsat :2 sat :0
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 480 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:09] [INFO ] Computed 241 place invariants in 41 ms
[2021-05-19 15:14:10] [INFO ] Implicit Places using invariants in 742 ms returned []
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:10] [INFO ] Computed 241 place invariants in 41 ms
[2021-05-19 15:14:11] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:11] [INFO ] Computed 241 place invariants in 40 ms
[2021-05-19 15:14:12] [INFO ] Dead Transitions using invariants and state equation in 708 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100040-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s3079 0), p1:(OR (EQ s217 0) (EQ s1714 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 1923 ms.
Product exploration explored 100000 steps with 0 reset in 1945 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1800 ms.
Product exploration explored 100000 steps with 0 reset in 1914 ms.
[2021-05-19 15:14:20] [INFO ] Flatten gal took : 250 ms
[2021-05-19 15:14:20] [INFO ] Flatten gal took : 247 ms
[2021-05-19 15:14:21] [INFO ] Time to serialize gal into /tmp/LTL14634966474630226908.gal : 91 ms
[2021-05-19 15:14:21] [INFO ] Time to serialize properties into /tmp/LTL12835790856857779933.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/LTL14634966474630226908.gal, -t, CGAL, -LTL, /tmp/LTL12835790856857779933.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/LTL14634966474630226908.gal -t CGAL -LTL /tmp/LTL12835790856857779933.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(sv26_c51==0)")||(X("((sys_req8==0)||(sv13==0))"))))))
Formula 0 simplified : !FG("(sv26_c51==0)" | X"((sys_req8==0)||(sv13==0))")
Detected timeout of ITS tools.
[2021-05-19 15:14:36] [INFO ] Flatten gal took : 286 ms
[2021-05-19 15:14:36] [INFO ] Applying decomposition
[2021-05-19 15:14:36] [INFO ] Flatten gal took : 228 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/graph13140408062821269458.txt, -o, /tmp/graph13140408062821269458.bin, -w, /tmp/graph13140408062821269458.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/graph13140408062821269458.bin, -l, -1, -v, -w, /tmp/graph13140408062821269458.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 15:14:37] [INFO ] Decomposing Gal with order
[2021-05-19 15:14:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 15:14:38] [INFO ] Removed a total of 7874 redundant transitions.
[2021-05-19 15:14:38] [INFO ] Flatten gal took : 1228 ms
[2021-05-19 15:14:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 106 ms.
[2021-05-19 15:14:39] [INFO ] Time to serialize gal into /tmp/LTL4897118078435724565.gal : 56 ms
[2021-05-19 15:14:39] [INFO ] Time to serialize properties into /tmp/LTL6674074825031871335.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/LTL4897118078435724565.gal, -t, CGAL, -LTL, /tmp/LTL6674074825031871335.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/LTL4897118078435724565.gal -t CGAL -LTL /tmp/LTL6674074825031871335.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("(u51.sv26_c51==0)")||(X("((u8.sys_req8==0)||(i63.u114.sv13==0))"))))))
Formula 0 simplified : !FG("(u51.sv26_c51==0)" | X"((u8.sys_req8==0)||(i63.u114.sv13==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3292293040865377666
[2021-05-19 15:14:54] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3292293040865377666
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/ltsmin3292293040865377666]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin3292293040865377666] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin3292293040865377666] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ServersAndClients-PT-100040-01 finished in 45857 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 623 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:55] [INFO ] Computed 241 place invariants in 43 ms
[2021-05-19 15:14:56] [INFO ] Implicit Places using invariants in 698 ms returned []
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:56] [INFO ] Computed 241 place invariants in 43 ms
[2021-05-19 15:14:57] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:14:57] [INFO ] Computed 241 place invariants in 41 ms
[2021-05-19 15:14:58] [INFO ] Dead Transitions using invariants and state equation in 701 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s321 1) (EQ s4037 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 267 reset in 1972 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-100040-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-02 finished in 4771 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F(p0))||(p1&&F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 505 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:00] [INFO ] Computed 241 place invariants in 41 ms
[2021-05-19 15:15:01] [INFO ] Implicit Places using invariants in 725 ms returned []
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:01] [INFO ] Computed 241 place invariants in 40 ms
[2021-05-19 15:15:01] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:02] [INFO ] Computed 241 place invariants in 40 ms
[2021-05-19 15:15:02] [INFO ] Dead Transitions using invariants and state equation in 641 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s2883 1), p0:(EQ s1437 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9 reset in 1999 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-100040-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-03 finished in 4689 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (G(p0)||(p0&&(p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 515 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:05] [INFO ] Computed 241 place invariants in 40 ms
[2021-05-19 15:15:05] [INFO ] Implicit Places using invariants in 716 ms returned []
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:06] [INFO ] Computed 241 place invariants in 43 ms
[2021-05-19 15:15:06] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:06] [INFO ] Computed 241 place invariants in 40 ms
[2021-05-19 15:15:07] [INFO ] Dead Transitions using invariants and state equation in 710 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100040-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (EQ s201 1) (EQ s906 1)), p1:(AND (EQ s217 1) (EQ s2017 1)), p0:(NEQ s3914 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19692 steps with 59 reset in 405 ms.
FORMULA ServersAndClients-PT-100040-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-04 finished in 3243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)||F(((p1&&F(p2))||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 391 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:08] [INFO ] Computed 241 place invariants in 39 ms
[2021-05-19 15:15:09] [INFO ] Implicit Places using invariants in 660 ms returned []
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:09] [INFO ] Computed 241 place invariants in 39 ms
[2021-05-19 15:15:09] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:09] [INFO ] Computed 241 place invariants in 39 ms
[2021-05-19 15:15:10] [INFO ] Dead Transitions using invariants and state equation in 713 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100040-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s293 1) (NEQ s502 1)), p2:(OR (NEQ s331 1) (NEQ s2219 1)), p0:(EQ s506 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 272 reset in 2028 ms.
Product exploration explored 100000 steps with 229 reset in 1962 ms.
Knowledge obtained : [p1, p2, (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 268 reset in 1841 ms.
Product exploration explored 100000 steps with 254 reset in 1927 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 4441 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Performed 3800 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3800 rules applied. Total rules applied 3800 place count 4441 transition count 8200
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 3837 place count 4404 transition count 4500
Deduced a syphon composed of 3800 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 3874 place count 4404 transition count 4500
Discarding 3700 places :
Symmetric choice reduction at 1 with 3700 rule applications. Total rules 7574 place count 704 transition count 800
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 3700 rules applied. Total rules applied 11274 place count 704 transition count 800
Deduced a syphon composed of 100 places in 1 ms
Applied a total of 11274 rules in 1432 ms. Remains 704 /4441 variables (removed 3737) and now considering 800/8200 (removed 7400) transitions.
[2021-05-19 15:15:20] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 800 rows 704 cols
[2021-05-19 15:15:20] [INFO ] Computed 204 place invariants in 4 ms
[2021-05-19 15:15:20] [INFO ] Dead Transitions using invariants and state equation in 474 ms returned []
Finished structural reductions, in 1 iterations. Remains : 704/4441 places, 800/8200 transitions.
Product exploration explored 100000 steps with 259 reset in 2013 ms.
Product exploration explored 100000 steps with 263 reset in 2004 ms.
[2021-05-19 15:15:25] [INFO ] Flatten gal took : 225 ms
[2021-05-19 15:15:25] [INFO ] Flatten gal took : 230 ms
[2021-05-19 15:15:25] [INFO ] Time to serialize gal into /tmp/LTL6378609997130226454.gal : 33 ms
[2021-05-19 15:15:25] [INFO ] Time to serialize properties into /tmp/LTL8895083680951100980.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/LTL6378609997130226454.gal, -t, CGAL, -LTL, /tmp/LTL8895083680951100980.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/LTL6378609997130226454.gal -t CGAL -LTL /tmp/LTL8895083680951100980.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X("(sv1_c3==1)"))||(F((("((sys_req46==0)||(sv1==0))")&&(F("((sys_req65==0)||(sv18==0))")))||(G("((sys_req46==0)||(sv1==0))")))))))
Formula 0 simplified : !G(X"(sv1_c3==1)" | F(("((sys_req46==0)||(sv1==0))" & F"((sys_req65==0)||(sv18==0))") | G"((sys_req46==0)||(sv1==0))"))
Detected timeout of ITS tools.
[2021-05-19 15:15:40] [INFO ] Flatten gal took : 224 ms
[2021-05-19 15:15:40] [INFO ] Applying decomposition
[2021-05-19 15:15:40] [INFO ] Flatten gal took : 233 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/graph14892468586991279829.txt, -o, /tmp/graph14892468586991279829.bin, -w, /tmp/graph14892468586991279829.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/graph14892468586991279829.bin, -l, -1, -v, -w, /tmp/graph14892468586991279829.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 15:15:41] [INFO ] Decomposing Gal with order
[2021-05-19 15:15:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 15:15:42] [INFO ] Removed a total of 7909 redundant transitions.
[2021-05-19 15:15:42] [INFO ] Flatten gal took : 877 ms
[2021-05-19 15:15:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 67 ms.
[2021-05-19 15:15:42] [INFO ] Time to serialize gal into /tmp/LTL680514917365473475.gal : 40 ms
[2021-05-19 15:15:42] [INFO ] Time to serialize properties into /tmp/LTL12599335139094642914.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/LTL680514917365473475.gal, -t, CGAL, -LTL, /tmp/LTL12599335139094642914.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/LTL680514917365473475.gal -t CGAL -LTL /tmp/LTL12599335139094642914.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X("(i3.u3.sv1_c3==1)"))||(F((("((u46.sys_req46==0)||(i2.u101.sv1==0))")&&(F("((u65.sys_req65==0)||(i79.u118.sv18==0))")))||(G("((u46.sys_req46==0)||(i2.u101.sv1==0))")))))))
Formula 0 simplified : !G(X"(i3.u3.sv1_c3==1)" | F(("((u46.sys_req46==0)||(i2.u101.sv1==0))" & F"((u65.sys_req65==0)||(i79.u118.sv18==0))") | G"((u46.sys_req46==0)||(i2.u101.sv1==0))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12887485352966598586
[2021-05-19 15:15:57] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12887485352966598586
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/ltsmin12887485352966598586]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin12887485352966598586] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin12887485352966598586] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ServersAndClients-PT-100040-05 finished in 50964 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 544 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:15:59] [INFO ] Computed 241 place invariants in 41 ms
[2021-05-19 15:16:00] [INFO ] Implicit Places using invariants in 567 ms returned []
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:16:00] [INFO ] Computed 241 place invariants in 41 ms
[2021-05-19 15:16:00] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:16:00] [INFO ] Computed 241 place invariants in 40 ms
[2021-05-19 15:16:01] [INFO ] Dead Transitions using invariants and state equation in 650 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s361 1) (EQ s1209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100040-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-06 finished in 2668 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3859 transitions
Trivial Post-agglo rules discarded 3859 transitions
Performed 3859 trivial Post agglomeration. Transition count delta: 3859
Iterating post reduction 0 with 3859 rules applied. Total rules applied 3859 place count 4441 transition count 4341
Reduce places removed 3859 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 3898 rules applied. Total rules applied 7757 place count 582 transition count 4302
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 3600 transitions
Reduce isomorphic transitions removed 3600 transitions.
Iterating post reduction 2 with 3676 rules applied. Total rules applied 11433 place count 506 transition count 702
Drop transitions removed 196 transitions
Redundant transition composition rules discarded 196 transitions
Iterating global reduction 3 with 196 rules applied. Total rules applied 11629 place count 506 transition count 506
Applied a total of 11629 rules in 184 ms. Remains 506 /4441 variables (removed 3935) and now considering 506/8200 (removed 7694) transitions.
[2021-05-19 15:16:01] [INFO ] Flow matrix only has 504 transitions (discarded 2 similar events)
// Phase 1: matrix 504 rows 506 cols
[2021-05-19 15:16:01] [INFO ] Computed 204 place invariants in 2 ms
[2021-05-19 15:16:02] [INFO ] Implicit Places using invariants in 516 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502, 504]
Discarding 202 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 519 ms to find 202 implicit places.
[2021-05-19 15:16:02] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 504 rows 304 cols
[2021-05-19 15:16:02] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-19 15:16:02] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Starting structural reductions, iteration 1 : 304/4441 places, 504/8200 transitions.
Graph (trivial) has 298 edges and 304 vertex of which 199 / 304 are part of one of the 1 SCC in 2 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 8 transition count 110
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 8 transition count 110
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 7 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 6 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 6 transition count 10
Applied a total of 299 rules in 8 ms. Remains 6 /304 variables (removed 298) and now considering 10/504 (removed 494) transitions.
// Phase 1: matrix 10 rows 6 cols
[2021-05-19 15:16:02] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 15:16:02] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 6 cols
[2021-05-19 15:16:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:16:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/4441 places, 10/8200 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100040-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1), p1:(AND (OR (NEQ s0 1) (NEQ s2 1)) (NEQ s5 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 264 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 4 in 1 ms.
FORMULA ServersAndClients-PT-100040-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-07 finished in 1315 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3999 transitions
Trivial Post-agglo rules discarded 3999 transitions
Performed 3999 trivial Post agglomeration. Transition count delta: 3999
Iterating post reduction 0 with 3999 rules applied. Total rules applied 3999 place count 4441 transition count 4201
Reduce places removed 4038 places and 0 transitions.
Ensure Unique test removed 3800 transitions
Reduce isomorphic transitions removed 3800 transitions.
Iterating post reduction 1 with 7838 rules applied. Total rules applied 11837 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 11936 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 12233 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 12628 place count 7 transition count 6
Applied a total of 12628 rules in 63 ms. Remains 7 /4441 variables (removed 4434) and now considering 6/8200 (removed 8194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 15:16:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-19 15:16:03] [INFO ] Implicit Places using invariants in 30 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
[2021-05-19 15:16:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:16:03] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:16:03] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Starting structural reductions, iteration 1 : 4/4441 places, 6/8200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 15:16:03] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:16:03] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 15:16:03] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:16:03] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/4441 places, 3/8200 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-08 finished in 389 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 664 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:16:04] [INFO ] Computed 241 place invariants in 69 ms
[2021-05-19 15:16:04] [INFO ] Implicit Places using invariants in 622 ms returned []
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:16:04] [INFO ] Computed 241 place invariants in 47 ms
[2021-05-19 15:16:05] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:16:05] [INFO ] Computed 241 place invariants in 43 ms
[2021-05-19 15:16:05] [INFO ] Dead Transitions using invariants and state equation in 669 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1222 1) (AND (EQ s319 1) (EQ s1007 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 279 reset in 1946 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-100040-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-09 finished in 4613 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3998 transitions
Trivial Post-agglo rules discarded 3998 transitions
Performed 3998 trivial Post agglomeration. Transition count delta: 3998
Iterating post reduction 0 with 3998 rules applied. Total rules applied 3998 place count 4441 transition count 4202
Reduce places removed 4036 places and 0 transitions.
Ensure Unique test removed 3700 transitions
Reduce isomorphic transitions removed 3700 transitions.
Iterating post reduction 1 with 7736 rules applied. Total rules applied 11734 place count 405 transition count 502
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 11932 place count 405 transition count 304
Discarding 98 places :
Implicit places reduction removed 98 places
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 2 with 294 rules applied. Total rules applied 12226 place count 307 transition count 108
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 391 rules applied. Total rules applied 12617 place count 13 transition count 11
Applied a total of 12617 rules in 57 ms. Remains 13 /4441 variables (removed 4428) and now considering 11/8200 (removed 8189) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-19 15:16:07] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-19 15:16:08] [INFO ] Implicit Places using invariants in 14 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 15 ms to find 6 implicit places.
[2021-05-19 15:16:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 7 cols
[2021-05-19 15:16:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:16:08] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 7/4441 places, 11/8200 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 0 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-19 15:16:08] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-19 15:16:08] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-19 15:16:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 15:16:08] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/4441 places, 5/8200 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100040-10 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:(NEQ s1 1), p0:(EQ s2 1)], 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 20054 reset in 69 ms.
Stack based approach found an accepted trace after 7 steps with 3 reset with depth 2 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-100040-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-10 finished in 240 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((p0 U p1))&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 489 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:16:08] [INFO ] Computed 241 place invariants in 41 ms
[2021-05-19 15:16:09] [INFO ] Implicit Places using invariants in 727 ms returned []
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:16:09] [INFO ] Computed 241 place invariants in 42 ms
[2021-05-19 15:16:10] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
// Phase 1: matrix 8200 rows 4441 cols
[2021-05-19 15:16:10] [INFO ] Computed 241 place invariants in 62 ms
[2021-05-19 15:16:10] [INFO ] Dead Transitions using invariants and state equation in 605 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100040-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s3581 1), p1:(OR (EQ s309 0) (EQ s2522 0)), p0:(EQ s1913 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5 reset in 1885 ms.
Stack based approach found an accepted trace after 11 steps with 2 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-100040-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-11 finished in 4572 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(p0)], workingDir=/home/mcc/execution]
Support contains 1 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3999 transitions
Trivial Post-agglo rules discarded 3999 transitions
Performed 3999 trivial Post agglomeration. Transition count delta: 3999
Iterating post reduction 0 with 3999 rules applied. Total rules applied 3999 place count 4441 transition count 4201
Reduce places removed 4038 places and 0 transitions.
Ensure Unique test removed 3800 transitions
Reduce isomorphic transitions removed 3800 transitions.
Iterating post reduction 1 with 7838 rules applied. Total rules applied 11837 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 11936 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 12233 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 12628 place count 7 transition count 6
Applied a total of 12628 rules in 63 ms. Remains 7 /4441 variables (removed 4434) and now considering 6/8200 (removed 8194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 15:16:12] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-19 15:16:12] [INFO ] Implicit Places using invariants in 10 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 11 ms to find 3 implicit places.
[2021-05-19 15:16:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:16:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:16:12] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 4/4441 places, 6/8200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 15:16:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:16:12] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-19 15:16:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 15:16:12] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/4441 places, 3/8200 transitions.
[2021-05-19 15:16:12] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-12 finished in 144 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 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3861 transitions
Trivial Post-agglo rules discarded 3861 transitions
Performed 3861 trivial Post agglomeration. Transition count delta: 3861
Iterating post reduction 0 with 3861 rules applied. Total rules applied 3861 place count 4441 transition count 4339
Reduce places removed 3861 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 3900 rules applied. Total rules applied 7761 place count 580 transition count 4300
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 3800 transitions
Reduce isomorphic transitions removed 3800 transitions.
Iterating post reduction 2 with 3878 rules applied. Total rules applied 11639 place count 502 transition count 500
Applied a total of 11639 rules in 83 ms. Remains 502 /4441 variables (removed 3939) and now considering 500/8200 (removed 7700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2021-05-19 15:16:12] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-19 15:16:13] [INFO ] Implicit Places using invariants in 326 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 336 ms to find 200 implicit places.
[2021-05-19 15:16:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 500 rows 302 cols
[2021-05-19 15:16:13] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-19 15:16:13] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Starting structural reductions, iteration 1 : 302/4441 places, 500/8200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 6 transition count 106
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 4 transition count 6
Applied a total of 299 rules in 7 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:16:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:16:13] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 15:16:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:16:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/4441 places, 6/8200 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-14 finished in 731 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3860 transitions
Trivial Post-agglo rules discarded 3860 transitions
Performed 3860 trivial Post agglomeration. Transition count delta: 3860
Iterating post reduction 0 with 3860 rules applied. Total rules applied 3860 place count 4441 transition count 4340
Reduce places removed 3860 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 3899 rules applied. Total rules applied 7759 place count 581 transition count 4301
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 3700 transitions
Reduce isomorphic transitions removed 3700 transitions.
Iterating post reduction 2 with 3777 rules applied. Total rules applied 11536 place count 504 transition count 601
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 3 with 98 rules applied. Total rules applied 11634 place count 504 transition count 503
Applied a total of 11634 rules in 76 ms. Remains 504 /4441 variables (removed 3937) and now considering 503/8200 (removed 7697) transitions.
[2021-05-19 15:16:13] [INFO ] Flow matrix only has 502 transitions (discarded 1 similar events)
// Phase 1: matrix 502 rows 504 cols
[2021-05-19 15:16:13] [INFO ] Computed 203 place invariants in 2 ms
[2021-05-19 15:16:14] [INFO ] Implicit Places using invariants in 315 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502]
Discarding 201 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 317 ms to find 201 implicit places.
[2021-05-19 15:16:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 502 rows 303 cols
[2021-05-19 15:16:14] [INFO ] Computed 2 place invariants in 9 ms
[2021-05-19 15:16:14] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Starting structural reductions, iteration 1 : 303/4441 places, 502/8200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 2 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:16:14] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 15:16:14] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 15:16:14] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 15:16:14] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/4441 places, 8/8200 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-15 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:(AND (EQ s0 1) (EQ s2 1) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-15 finished in 682 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin155921420930858394
[2021-05-19 15:16:14] [INFO ] Too many transitions (8200) to apply POR reductions. Disabling POR matrices.
[2021-05-19 15:16:14] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin155921420930858394
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/ltsmin155921420930858394]
[2021-05-19 15:16:14] [INFO ] Applying decomposition
[2021-05-19 15:16:14] [INFO ] Flatten gal took : 232 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/graph10441216683716825038.txt, -o, /tmp/graph10441216683716825038.bin, -w, /tmp/graph10441216683716825038.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/graph10441216683716825038.bin, -l, -1, -v, -w, /tmp/graph10441216683716825038.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 15:16:15] [INFO ] Decomposing Gal with order
[2021-05-19 15:16:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 15:16:16] [INFO ] Removed a total of 7913 redundant transitions.
[2021-05-19 15:16:16] [INFO ] Flatten gal took : 1050 ms
[2021-05-19 15:16:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2021-05-19 15:16:16] [INFO ] Time to serialize gal into /tmp/LTLFireability3091073942378092337.gal : 79 ms
[2021-05-19 15:16:16] [INFO ] Time to serialize properties into /tmp/LTLFireability993803348619688927.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/LTLFireability3091073942378092337.gal, -t, CGAL, -LTL, /tmp/LTLFireability993803348619688927.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/LTLFireability3091073942378092337.gal -t CGAL -LTL /tmp/LTLFireability993803348619688927.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F(G(("((((i97.u56.sys_req56==1)&&(i8.u113.sv13==1))&&(i6.u8.sys_req8==1))&&((u80.sys_req80==0)||(i72.u105.sv5==0)))")U(("(u51.sv26_c51==0)")||(X("((i6.u8.sys_req8==0)||(i8.u113.sv13==0))")))))))
Formula 0 simplified : !FG("((((i97.u56.sys_req56==1)&&(i8.u113.sv13==1))&&(i6.u8.sys_req8==1))&&((u80.sys_req80==0)||(i72.u105.sv5==0)))" U ("(u51.sv26_c51==0)" | X"((i6.u8.sys_req8==0)||(i8.u113.sv13==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin155921420930858394] killed by timeout after 25 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin155921420930858394] killed by timeout after 25 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3061 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,31.8319,459628,1,0,148654,91645,68759,108941,1297,294603,5932772
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-100040-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((X("(i3.u3.sv1_c3==1)"))||(F((!("((u46.sys_req46==1)&&(i68.u101.sv1==1))"))U(((!("((u46.sys_req46==1)&&(i68.u101.sv1==1))"))&&(F(!("((u65.sys_req65==1)&&(i82.u118.sv18==1))"))))||(G(!("((u46.sys_req46==1)&&(i68.u101.sv1==1))")))))))))
Formula 1 simplified : !G(X"(i3.u3.sv1_c3==1)" | F(!"((u46.sys_req46==1)&&(i68.u101.sv1==1))" U ((!"((u46.sys_req46==1)&&(i68.u101.sv1==1))" & F!"((u65.sys_req65==1)&&(i82.u118.sv18==1))") | G!"((u46.sys_req46==1)&&(i68.u101.sv1==1))")))
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,31.9102,464588,1,0,150233,91645,68800,108980,1300,294603,5972963
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-100040-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1621437411031
--------------------
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="ServersAndClients-PT-100040"
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 ServersAndClients-PT-100040, 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 r311-tall-162132107900133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-100040.tgz
mv ServersAndClients-PT-100040 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 '
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 ;