fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r311-tall-162132107900173
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ServersAndClients-PT-200080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10665.607 784272.00 1684827.00 16843.50 TFFFFFFFFTFFFFFF 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-162132107900173.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-200080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132107900173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 32M
-rw-r--r-- 1 mcc users 19K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 107K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K 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.5K May 11 20:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 20:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 11 17:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 17:26 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 31M 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-200080-00
FORMULA_NAME ServersAndClients-PT-200080-01
FORMULA_NAME ServersAndClients-PT-200080-02
FORMULA_NAME ServersAndClients-PT-200080-03
FORMULA_NAME ServersAndClients-PT-200080-04
FORMULA_NAME ServersAndClients-PT-200080-05
FORMULA_NAME ServersAndClients-PT-200080-06
FORMULA_NAME ServersAndClients-PT-200080-07
FORMULA_NAME ServersAndClients-PT-200080-08
FORMULA_NAME ServersAndClients-PT-200080-09
FORMULA_NAME ServersAndClients-PT-200080-10
FORMULA_NAME ServersAndClients-PT-200080-11
FORMULA_NAME ServersAndClients-PT-200080-12
FORMULA_NAME ServersAndClients-PT-200080-13
FORMULA_NAME ServersAndClients-PT-200080-14
FORMULA_NAME ServersAndClients-PT-200080-15

=== Now, execution of the tool begins

BK_START 1621441913310

Running Version 0
[2021-05-19 16:31:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 16:31:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 16:31:55] [INFO ] Load time of PNML (sax parser for PT used): 888 ms
[2021-05-19 16:31:55] [INFO ] Transformed 16881 places.
[2021-05-19 16:31:55] [INFO ] Transformed 32400 transitions.
[2021-05-19 16:31:55] [INFO ] Found NUPN structural information;
[2021-05-19 16:31:55] [INFO ] Parsed PT model containing 16881 places and 32400 transitions in 1031 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 16:31:55] [INFO ] Initial state test concluded for 4 properties.
FORMULA ServersAndClients-PT-200080-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 294 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:31:57] [INFO ] Computed 481 place invariants in 600 ms
[2021-05-19 16:31:59] [INFO ] Implicit Places using invariants in 2941 ms returned []
Implicit Place search using SMT only with invariants took 2966 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:31:59] [INFO ] Computed 481 place invariants in 305 ms
[2021-05-19 16:32:01] [INFO ] Dead Transitions using invariants and state equation in 2508 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
[2021-05-19 16:32:03] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-19 16:32:03] [INFO ] Flatten gal took : 1406 ms
FORMULA ServersAndClients-PT-200080-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 16:32:04] [INFO ] Flatten gal took : 1069 ms
[2021-05-19 16:32:06] [INFO ] Input system was already deterministic with 32400 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 6013 ms. (steps per millisecond=16 ) properties (out of 26) seen :18
Running SMT prover for 8 properties.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:32:13] [INFO ] Computed 481 place invariants in 280 ms
[2021-05-19 16:32:19] [INFO ] [Real]Absence check using 281 positive place invariants in 1207 ms returned sat
[2021-05-19 16:32:19] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 375 ms returned sat
[2021-05-19 16:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:33:11] [INFO ] [Real]Absence check using state equation in 50938 ms returned unsat :3 sat :4 real:1
Attempting to minimize the solution found.
Minimization took 3693 ms.
[2021-05-19 16:33:15] [INFO ] SMT Verify possible in real domain returnedunsat :3 sat :4 real:1
[2021-05-19 16:33:20] [INFO ] [Nat]Absence check using 281 positive place invariants in 1197 ms returned sat
[2021-05-19 16:33:21] [INFO ] [Nat]Absence check using 281 positive and 200 generalized place invariants in 363 ms returned sat
[2021-05-19 16:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 16:34:19] [INFO ] [Nat]Absence check using state equation in 56702 ms returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 4437 ms.
[2021-05-19 16:34:23] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :8
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2021-05-19 16:34:23] [INFO ] Initial state test concluded for 1 properties.
FORMULA ServersAndClients-PT-200080-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F((p0&&X(p1))))||(G(p0)&&p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 240 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:34:24] [INFO ] Computed 481 place invariants in 283 ms
[2021-05-19 16:34:26] [INFO ] Implicit Places using invariants in 2478 ms returned []
Implicit Place search using SMT only with invariants took 2483 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:34:26] [INFO ] Computed 481 place invariants in 271 ms
[2021-05-19 16:34:29] [INFO ] Dead Transitions using invariants and state equation in 2500 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200080-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (NEQ s777 1) (NEQ s4218 1)), p1:(NEQ s10636 1), p2:(AND (EQ s10636 0) (OR (EQ s579 0) (EQ s3213 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 9150 ms.
Product exploration explored 100000 steps with 25000 reset in 8883 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 8744 ms.
Product exploration explored 100000 steps with 25000 reset in 8802 ms.
[2021-05-19 16:35:09] [INFO ] Flatten gal took : 1045 ms
[2021-05-19 16:35:10] [INFO ] Flatten gal took : 941 ms
[2021-05-19 16:35:10] [INFO ] Time to serialize gal into /tmp/LTL7706776917585348720.gal : 800 ms
[2021-05-19 16:35:10] [INFO ] Time to serialize properties into /tmp/LTL1965093329988778237.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/LTL7706776917585348720.gal, -t, CGAL, -LTL, /tmp/LTL1965093329988778237.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/LTL7706776917585348720.gal -t CGAL -LTL /tmp/LTL1965093329988778237.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(F(("((sys_req188==0)||(sv17==0))")&&(X("(sv48_c186==0)")))))||((("(sv48_c186==0)")&&(G("((sys_req188==0)||(sv17==0))")))&&("((sys_req89==0)||(sv12==0))")))))
Formula 0 simplified : !X(XF("((sys_req188==0)||(sv17==0))" & X"(sv48_c186==0)") | ("((sys_req89==0)||(sv12==0))" & "(sv48_c186==0)" & G"((sys_req188==0)||(sv17==0))"))
Detected timeout of ITS tools.
[2021-05-19 16:35:26] [INFO ] Flatten gal took : 952 ms
[2021-05-19 16:35:26] [INFO ] Applying decomposition
[2021-05-19 16:35:27] [INFO ] Flatten gal took : 950 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/graph17960420391648478347.txt, -o, /tmp/graph17960420391648478347.bin, -w, /tmp/graph17960420391648478347.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/graph17960420391648478347.bin, -l, -1, -v, -w, /tmp/graph17960420391648478347.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 16:35:29] [INFO ] Decomposing Gal with order
[2021-05-19 16:35:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 16:35:41] [INFO ] Removed a total of 31833 redundant transitions.
[2021-05-19 16:35:42] [INFO ] Flatten gal took : 9512 ms
[2021-05-19 16:35:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 362 ms.
[2021-05-19 16:35:43] [INFO ] Time to serialize gal into /tmp/LTL1145924872388574793.gal : 168 ms
[2021-05-19 16:35:43] [INFO ] Time to serialize properties into /tmp/LTL6449124852735903087.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/LTL1145924872388574793.gal, -t, CGAL, -LTL, /tmp/LTL6449124852735903087.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/LTL1145924872388574793.gal -t CGAL -LTL /tmp/LTL6449124852735903087.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(F(("((i177.u188.sys_req188==0)||(i44.u217.sv17==0))")&&(X("(u186.sv48_c186==0)")))))||((("(u186.sv48_c186==0)")&&(G("((i177.u188.sys_req188==0)||(i44.u217.sv17==0))")))&&("((u89.sys_req89==0)||(i146.u212.sv12==0))")))))
Formula 0 simplified : !X(XF("((i177.u188.sys_req188==0)||(i44.u217.sv17==0))" & X"(u186.sv48_c186==0)") | ("((u89.sys_req89==0)||(i146.u212.sv12==0))" & "(u186.sv48_c186==0)" & G"((i177.u188.sys_req188==0)||(i44.u217.sv17==0))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5596031086076995720
[2021-05-19 16:35:58] [INFO ] Built C files in 330ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5596031086076995720
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/ltsmin5596031086076995720]
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/ltsmin5596031086076995720] 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/ltsmin5596031086076995720] 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-200080-00 finished in 96160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&(p1||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 81 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:36:00] [INFO ] Computed 481 place invariants in 267 ms
[2021-05-19 16:36:02] [INFO ] Implicit Places using invariants in 2424 ms returned []
Implicit Place search using SMT only with invariants took 2427 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:36:02] [INFO ] Computed 481 place invariants in 263 ms
[2021-05-19 16:36:04] [INFO ] Dead Transitions using invariants and state equation in 2468 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200080-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s713 1) (EQ s8238 1)), p0:(AND (EQ s8931 1) (EQ s2561 0))], 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 0 reset in 5347 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-200080-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-01 finished in 10507 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 76 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:36:17] [INFO ] Computed 481 place invariants in 320 ms
[2021-05-19 16:36:19] [INFO ] Implicit Places using invariants in 2463 ms returned []
Implicit Place search using SMT only with invariants took 2465 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:36:19] [INFO ] Computed 481 place invariants in 269 ms
[2021-05-19 16:36:21] [INFO ] Dead Transitions using invariants and state equation in 2423 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200080-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s12518 1) (NEQ s1060 1)), p1:(OR (NEQ s717 1) (NEQ s14469 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 102 steps with 0 reset in 7 ms.
FORMULA ServersAndClients-PT-200080-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-03 finished in 11650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 75 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:36:22] [INFO ] Computed 481 place invariants in 265 ms
[2021-05-19 16:36:24] [INFO ] Implicit Places using invariants in 2309 ms returned []
Implicit Place search using SMT only with invariants took 2310 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:36:24] [INFO ] Computed 481 place invariants in 263 ms
[2021-05-19 16:36:27] [INFO ] Dead Transitions using invariants and state equation in 2530 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 2838 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ServersAndClients-PT-200080-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s2086 1), p0:(EQ s7814 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-200080-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-04 finished in 7811 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U p1))], workingDir=/home/mcc/execution]
Support contains 3 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15919 transitions
Trivial Post-agglo rules discarded 15919 transitions
Performed 15919 trivial Post agglomeration. Transition count delta: 15919
Iterating post reduction 0 with 15919 rules applied. Total rules applied 15919 place count 16881 transition count 16481
Reduce places removed 15919 places and 0 transitions.
Iterating post reduction 1 with 15919 rules applied. Total rules applied 31838 place count 962 transition count 16481
Applied a total of 31838 rules in 1341 ms. Remains 962 /16881 variables (removed 15919) and now considering 16481/32400 (removed 15919) transitions.
[2021-05-19 16:36:31] [INFO ] Flow matrix only has 761 transitions (discarded 15720 similar events)
// Phase 1: matrix 761 rows 962 cols
[2021-05-19 16:36:31] [INFO ] Computed 481 place invariants in 6 ms
[2021-05-19 16:36:42] [INFO ] Implicit Places using invariants in 11052 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, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 801, 803, 805, 807, 809, 811, 813, 815, 817, 819, 821, 823, 825, 827, 829, 831, 833, 835, 837, 839, 841, 843, 845, 847, 849, 851, 853, 855, 857, 859, 861, 863, 865, 867, 869, 871, 873, 875, 877, 879, 881, 883, 886, 888, 890, 892, 894, 896, 898, 900, 902, 904, 906, 908, 910, 912, 914, 916, 918, 920, 922, 924, 926, 928, 930, 932, 934, 936, 938, 940, 942, 944, 946, 948, 950, 952, 954, 956, 958, 960]
Discarding 479 places :
Ensure Unique test removed 15720 transitions
Reduce isomorphic transitions removed 15720 transitions.
Implicit Place search using SMT only with invariants took 11099 ms to find 479 implicit places.
[2021-05-19 16:36:42] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 761 rows 483 cols
[2021-05-19 16:36:42] [INFO ] Computed 2 place invariants in 11 ms
[2021-05-19 16:36:42] [INFO ] Dead Transitions using invariants and state equation in 319 ms returned []
Starting structural reductions, iteration 1 : 483/16881 places, 761/32400 transitions.
Graph (trivial) has 677 edges and 483 vertex of which 399 / 483 are part of one of the 1 SCC in 4 ms
Free SCC test removed 398 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 6 transition count 86
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 6 transition count 86
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 0 with 79 rules applied. Total rules applied 238 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 238 place count 6 transition count 6
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 240 place count 5 transition count 6
Applied a total of 240 rules in 18 ms. Remains 5 /483 variables (removed 478) and now considering 6/761 (removed 755) transitions.
// Phase 1: matrix 6 rows 5 cols
[2021-05-19 16:36:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 16:36:42] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-19 16:36:42] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 16:36:42] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/16881 places, 6/32400 transitions.
Stuttering acceptance computed with spot in 689 ms :[true, (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200080-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s0 1) (EQ s2 1)), p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200080-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-05 finished in 13569 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 89 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:36:44] [INFO ] Computed 481 place invariants in 272 ms
[2021-05-19 16:36:46] [INFO ] Implicit Places using invariants in 2454 ms returned []
Implicit Place search using SMT only with invariants took 2454 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:36:46] [INFO ] Computed 481 place invariants in 346 ms
[2021-05-19 16:36:48] [INFO ] Dead Transitions using invariants and state equation in 2528 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 8553 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200080-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s1265 1), p1:(AND (EQ s767 1) (EQ s12861 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17235 reset in 9612 ms.
Stack based approach found an accepted trace after 4273 steps with 1422 reset with depth 8 and stack size 8 in 564 ms.
FORMULA ServersAndClients-PT-200080-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-07 finished in 24225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15444 transitions
Trivial Post-agglo rules discarded 15444 transitions
Performed 15444 trivial Post agglomeration. Transition count delta: 15444
Iterating post reduction 0 with 15444 rules applied. Total rules applied 15444 place count 16881 transition count 16956
Reduce places removed 15444 places and 0 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 1 with 15600 rules applied. Total rules applied 31044 place count 1437 transition count 16800
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 15400 transitions
Reduce isomorphic transitions removed 15400 transitions.
Iterating post reduction 2 with 15634 rules applied. Total rules applied 46678 place count 1203 transition count 1400
Applied a total of 46678 rules in 477 ms. Remains 1203 /16881 variables (removed 15678) and now considering 1400/32400 (removed 31000) transitions.
// Phase 1: matrix 1400 rows 1203 cols
[2021-05-19 16:37:08] [INFO ] Computed 403 place invariants in 10 ms
[2021-05-19 16:37:08] [INFO ] Implicit Places using invariants in 678 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, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 682 ms to find 400 implicit places.
[2021-05-19 16:37:08] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1400 rows 803 cols
[2021-05-19 16:37:08] [INFO ] Computed 3 place invariants in 23 ms
[2021-05-19 16:37:09] [INFO ] Dead Transitions using invariants and state equation in 643 ms returned []
Starting structural reductions, iteration 1 : 803/16881 places, 1400/32400 transitions.
Graph (trivial) has 596 edges and 803 vertex of which 397 / 803 are part of one of the 1 SCC in 0 ms
Free SCC test removed 396 places
Ensure Unique test removed 593 transitions
Reduce isomorphic transitions removed 593 transitions.
Discarding 395 places :
Symmetric choice reduction at 0 with 395 rule applications. Total rules 396 place count 12 transition count 412
Iterating global reduction 0 with 395 rules applied. Total rules applied 791 place count 12 transition count 412
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Iterating post reduction 0 with 394 rules applied. Total rules applied 1185 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1187 place count 10 transition count 16
Iterating global reduction 1 with 2 rules applied. Total rules applied 1189 place count 10 transition count 16
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 1191 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1193 place count 7 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 1195 place count 7 transition count 13
Applied a total of 1195 rules in 18 ms. Remains 7 /803 variables (removed 796) and now considering 13/1400 (removed 1387) transitions.
// Phase 1: matrix 13 rows 7 cols
[2021-05-19 16:37:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 16:37:09] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2021-05-19 16:37:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 16:37:09] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/16881 places, 13/32400 transitions.
Stuttering acceptance computed with spot in 1193 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s5 0) (AND (EQ s1 1) (EQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200080-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property ServersAndClients-PT-200080-09 finished in 3085 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 201 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:37:11] [INFO ] Computed 481 place invariants in 268 ms
[2021-05-19 16:37:13] [INFO ] Implicit Places using invariants in 2490 ms returned []
Implicit Place search using SMT only with invariants took 2491 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:37:13] [INFO ] Computed 481 place invariants in 269 ms
[2021-05-19 16:37:16] [INFO ] Dead Transitions using invariants and state equation in 2520 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200080-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s6051 0), p1:(EQ s6051 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5317 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 3 ms.
FORMULA ServersAndClients-PT-200080-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-10 finished in 10660 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15721 transitions
Trivial Post-agglo rules discarded 15721 transitions
Performed 15721 trivial Post agglomeration. Transition count delta: 15721
Iterating post reduction 0 with 15721 rules applied. Total rules applied 15721 place count 16881 transition count 16679
Reduce places removed 15721 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 15800 rules applied. Total rules applied 31521 place count 1160 transition count 16600
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 15600 transitions
Reduce isomorphic transitions removed 15600 transitions.
Iterating post reduction 2 with 15758 rules applied. Total rules applied 47279 place count 1002 transition count 1000
Applied a total of 47279 rules in 427 ms. Remains 1002 /16881 variables (removed 15879) and now considering 1000/32400 (removed 31400) transitions.
// Phase 1: matrix 1000 rows 1002 cols
[2021-05-19 16:37:24] [INFO ] Computed 402 place invariants in 6 ms
[2021-05-19 16:37:25] [INFO ] Implicit Places using invariants in 690 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, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 698 ms to find 400 implicit places.
[2021-05-19 16:37:25] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 1000 rows 602 cols
[2021-05-19 16:37:25] [INFO ] Computed 2 place invariants in 17 ms
[2021-05-19 16:37:25] [INFO ] Dead Transitions using invariants and state equation in 443 ms returned []
Starting structural reductions, iteration 1 : 602/16881 places, 1000/32400 transitions.
Graph (trivial) has 598 edges and 602 vertex of which 399 / 602 are part of one of the 1 SCC in 1 ms
Free SCC test removed 398 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 6 transition count 206
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 6 transition count 206
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 595 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 597 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 4 transition count 6
Applied a total of 599 rules in 10 ms. Remains 4 /602 variables (removed 598) and now considering 6/1000 (removed 994) transitions.
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 16:37:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 16:37:25] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-19 16:37:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 16:37:25] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/16881 places, 6/32400 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200080-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200080-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-11 finished in 4439 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X((p1 U p2))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16881 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Applied a total of 0 rules in 71 ms. Remains 16881 /16881 variables (removed 0) and now considering 32400/32400 (removed 0) transitions.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:37:26] [INFO ] Computed 481 place invariants in 269 ms
[2021-05-19 16:37:28] [INFO ] Implicit Places using invariants in 2416 ms returned []
Implicit Place search using SMT only with invariants took 2417 ms to find 0 implicit places.
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:37:28] [INFO ] Computed 481 place invariants in 265 ms
[2021-05-19 16:37:30] [INFO ] Dead Transitions using invariants and state equation in 2410 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16881/16881 places, 32400/32400 transitions.
Stuttering acceptance computed with spot in 5819 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200080-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s9779 1) (AND (EQ s477 1) (EQ s1404 1))), p2:(EQ s13627 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 132 reset in 5350 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-200080-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-12 finished in 16126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 16881 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 16881/16881 places, 32400/32400 transitions.
Drop transitions removed 15720 transitions
Trivial Post-agglo rules discarded 15720 transitions
Performed 15720 trivial Post agglomeration. Transition count delta: 15720
Iterating post reduction 0 with 15720 rules applied. Total rules applied 15720 place count 16881 transition count 16680
Reduce places removed 15720 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 15799 rules applied. Total rules applied 31519 place count 1161 transition count 16601
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 15400 transitions
Reduce isomorphic transitions removed 15400 transitions.
Iterating post reduction 2 with 15557 rules applied. Total rules applied 47076 place count 1004 transition count 1201
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 3 with 198 rules applied. Total rules applied 47274 place count 1004 transition count 1003
Applied a total of 47274 rules in 335 ms. Remains 1004 /16881 variables (removed 15877) and now considering 1003/32400 (removed 31397) transitions.
[2021-05-19 16:37:42] [INFO ] Flow matrix only has 1002 transitions (discarded 1 similar events)
// Phase 1: matrix 1002 rows 1004 cols
[2021-05-19 16:37:42] [INFO ] Computed 403 place invariants in 6 ms
[2021-05-19 16:37:43] [INFO ] Implicit Places using invariants in 678 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, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 1002]
Discarding 401 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 681 ms to find 401 implicit places.
[2021-05-19 16:37:43] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 1002 rows 603 cols
[2021-05-19 16:37:43] [INFO ] Computed 2 place invariants in 16 ms
[2021-05-19 16:37:43] [INFO ] Dead Transitions using invariants and state equation in 440 ms returned []
Starting structural reductions, iteration 1 : 603/16881 places, 1002/32400 transitions.
Graph (trivial) has 598 edges and 603 vertex of which 399 / 603 are part of one of the 1 SCC in 0 ms
Free SCC test removed 398 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 7 transition count 208
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 7 transition count 208
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 595 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 597 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 5 transition count 8
Applied a total of 599 rules in 4 ms. Remains 5 /603 variables (removed 598) and now considering 8/1002 (removed 994) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 16:37:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 16:37:43] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-19 16:37:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 16:37:43] [INFO ] Implicit Places using invariants and state equation in 8 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/16881 places, 8/32400 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200080-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s2 1)), p2:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200080-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200080-14 finished in 1580 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7115971622928189815
[2021-05-19 16:37:44] [INFO ] Too many transitions (32400) to apply POR reductions. Disabling POR matrices.
[2021-05-19 16:37:44] [INFO ] Built C files in 230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7115971622928189815
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/ltsmin7115971622928189815]
[2021-05-19 16:37:44] [INFO ] Applying decomposition
[2021-05-19 16:37:45] [INFO ] Flatten gal took : 1002 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/graph15002714581671821242.txt, -o, /tmp/graph15002714581671821242.bin, -w, /tmp/graph15002714581671821242.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/graph15002714581671821242.bin, -l, -1, -v, -w, /tmp/graph15002714581671821242.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 16:37:50] [INFO ] Decomposing Gal with order
[2021-05-19 16:37:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 16:37:58] [INFO ] Removed a total of 31831 redundant transitions.
[2021-05-19 16:37:59] [INFO ] Flatten gal took : 5179 ms
[2021-05-19 16:38:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 253 ms.
[2021-05-19 16:38:05] [INFO ] Time to serialize gal into /tmp/LTLFireability18247519392135138871.gal : 5007 ms
[2021-05-19 16:38:05] [INFO ] Time to serialize properties into /tmp/LTLFireability5457306587182538786.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/LTLFireability18247519392135138871.gal, -t, CGAL, -LTL, /tmp/LTLFireability5457306587182538786.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/LTLFireability18247519392135138871.gal -t CGAL -LTL /tmp/LTLFireability5457306587182538786.ltl -c -stutter-deadlock
Read 1 LTL properties
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/ltsmin7115971622928189815] killed by timeout after 30 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/ltsmin7115971622928189815] killed by timeout after 30 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Checking formula 0 : !((X((("((i135.u186.sv48_c186==0)&&((i59.u89.sys_req89==0)||(i139.u212.sv12==0)))")&&(G(!("((u188.sys_req188==1)&&(i144.u217.sv17==1))"))))||(X(F((!("((u188.sys_req188==1)&&(i144.u217.sv17==1))"))&&(X("(i135.u186.sv48_c186!=1)"))))))))
Formula 0 simplified : !X(("((i135.u186.sv48_c186==0)&&((i59.u89.sys_req89==0)||(i139.u212.sv12==0)))" & G!"((u188.sys_req188==1)&&(i144.u217.sv17==1))") | XF(!"((u188.sys_req188==1)&&(i144.u217.sv17==1))" & X"(i135.u186.sv48_c186!=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
39461 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,405.027,3523000,1,0,818983,713100,236705,515646,1970,2.20873e+06,53871687
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ServersAndClients-PT-200080-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1621442697582

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

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

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