Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599300492.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ServersAndClients-PT-100320, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599300492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 8.4K Apr 29 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 29 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 20M May 10 09:34 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-100320-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100320-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652974456278

Running Version 202205111006
[2022-05-19 15:34:17] [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]
[2022-05-19 15:34:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:34:19] [INFO ] Load time of PNML (sax parser for PT used): 1264 ms
[2022-05-19 15:34:19] [INFO ] Transformed 32721 places.
[2022-05-19 15:34:19] [INFO ] Transformed 64200 transitions.
[2022-05-19 15:34:19] [INFO ] Parsed PT model containing 32721 places and 64200 transitions in 1615 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ServersAndClients-PT-100320-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100320-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 720 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:34:21] [INFO ] Computed 521 place invariants in 932 ms
[2022-05-19 15:34:24] [INFO ] Implicit Places using invariants in 3983 ms returned []
Implicit Place search using SMT only with invariants took 4043 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:34:25] [INFO ] Computed 521 place invariants in 888 ms
[2022-05-19 15:34:27] [INFO ] Dead Transitions using invariants and state equation in 3241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Support contains 37 out of 32721 places after structural reductions.
[2022-05-19 15:34:30] [INFO ] Flatten gal took : 2106 ms
[2022-05-19 15:34:32] [INFO ] Flatten gal took : 1788 ms
[2022-05-19 15:34:35] [INFO ] Input system was already deterministic with 64200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1605 ms. (steps per millisecond=6 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:34:39] [INFO ] Computed 521 place invariants in 671 ms
[2022-05-19 15:34:50] [INFO ] [Real]Absence check using 421 positive place invariants in 2731 ms returned sat
[2022-05-19 15:34:50] [INFO ] [Real]Absence check using 421 positive and 100 generalized place invariants in 612 ms returned sat
[2022-05-19 15:35:04] [INFO ] After 7584ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2022-05-19 15:35:04] [INFO ] After 7643ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-19 15:35:04] [INFO ] After 25121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :9
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31990 transitions
Trivial Post-agglo rules discarded 31990 transitions
Performed 31990 trivial Post agglomeration. Transition count delta: 31990
Iterating post reduction 0 with 31990 rules applied. Total rules applied 31990 place count 32721 transition count 32210
Reduce places removed 32300 places and 0 transitions.
Ensure Unique test removed 30900 transitions
Reduce isomorphic transitions removed 30900 transitions.
Iterating post reduction 1 with 63200 rules applied. Total rules applied 95190 place count 421 transition count 1310
Drop transitions removed 990 transitions
Redundant transition composition rules discarded 990 transitions
Iterating global reduction 2 with 990 rules applied. Total rules applied 96180 place count 421 transition count 320
Discarding 90 places :
Implicit places reduction removed 90 places
Drop transitions removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 2 with 270 rules applied. Total rules applied 96450 place count 331 transition count 140
Reduce places removed 270 places and 0 transitions.
Drop transitions removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 360 rules applied. Total rules applied 96810 place count 61 transition count 50
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 96820 place count 61 transition count 50
Applied a total of 96820 rules in 765 ms. Remains 61 /32721 variables (removed 32660) and now considering 50/64200 (removed 64150) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/32721 places, 50/64200 transitions.
Finished random walk after 124 steps, including 0 resets, run visited all 10 properties in 3 ms. (steps per millisecond=41 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((p0&&(F(p1)||p2)))))))'
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31579 transitions
Trivial Post-agglo rules discarded 31579 transitions
Performed 31579 trivial Post agglomeration. Transition count delta: 31579
Iterating post reduction 0 with 31579 rules applied. Total rules applied 31579 place count 32721 transition count 32621
Reduce places removed 31579 places and 0 transitions.
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Iterating post reduction 1 with 31898 rules applied. Total rules applied 63477 place count 1142 transition count 32302
Reduce places removed 636 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 2 with 32236 rules applied. Total rules applied 95713 place count 506 transition count 702
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 3 with 198 rules applied. Total rules applied 95911 place count 506 transition count 504
Applied a total of 95911 rules in 1010 ms. Remains 506 /32721 variables (removed 32215) and now considering 504/64200 (removed 63696) transitions.
// Phase 1: matrix 504 rows 506 cols
[2022-05-19 15:35:06] [INFO ] Computed 204 place invariants in 3 ms
[2022-05-19 15:35:07] [INFO ] Implicit Places using invariants in 397 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, 401, 504]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 405 ms to find 202 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 304/32721 places, 504/64200 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 10 ms. Remains 6 /304 variables (removed 298) and now considering 10/504 (removed 494) transitions.
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:35:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:35:07] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:35:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 15:35:07] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32721 places, 10/64200 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/32721 places, 10/64200 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s3 1)), p2:(LT s2 1), p1:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 173 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 4 in 1 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-01 finished in 1999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(G(F(G(p0)))))&&G(X(p1))))'
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 557 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:09] [INFO ] Computed 521 place invariants in 576 ms
[2022-05-19 15:35:11] [INFO ] Implicit Places using invariants in 2863 ms returned []
Implicit Place search using SMT only with invariants took 2866 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:11] [INFO ] Computed 521 place invariants in 540 ms
[2022-05-19 15:35:14] [INFO ] Dead Transitions using invariants and state equation in 3210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s18808 1), p0:(OR (LT s275 1) (LT s2421 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-02 finished in 6963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U !X(X(F(X((G(p0) U F(p0))))))))'
Support contains 1 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 752 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:16] [INFO ] Computed 521 place invariants in 594 ms
[2022-05-19 15:35:18] [INFO ] Implicit Places using invariants in 3326 ms returned []
Implicit Place search using SMT only with invariants took 3341 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:19] [INFO ] Computed 521 place invariants in 577 ms
[2022-05-19 15:35:21] [INFO ] Dead Transitions using invariants and state equation in 2726 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s19404 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8472 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 4 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-03 finished in 15630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 717 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:31] [INFO ] Computed 521 place invariants in 545 ms
[2022-05-19 15:35:34] [INFO ] Implicit Places using invariants in 2930 ms returned []
Implicit Place search using SMT only with invariants took 2936 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:34] [INFO ] Computed 521 place invariants in 532 ms
[2022-05-19 15:35:38] [INFO ] Dead Transitions using invariants and state equation in 4092 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s267 1) (LT s22924 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 193 steps with 0 reset in 17 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-04 finished in 8018 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||p1))))'
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 862 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:39] [INFO ] Computed 521 place invariants in 577 ms
[2022-05-19 15:35:44] [INFO ] Implicit Places using invariants in 4622 ms returned []
Implicit Place search using SMT only with invariants took 4636 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:44] [INFO ] Computed 521 place invariants in 547 ms
[2022-05-19 15:35:48] [INFO ] Dead Transitions using invariants and state equation in 3987 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s371 1) (LT s18682 1)), p1:(GEQ s8523 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 8 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-06 finished in 9777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(F(p0)))&&G(X(p1))))))'
Support contains 5 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31163 transitions
Trivial Post-agglo rules discarded 31163 transitions
Performed 31163 trivial Post agglomeration. Transition count delta: 31163
Iterating post reduction 0 with 31163 rules applied. Total rules applied 31163 place count 32721 transition count 33037
Reduce places removed 31163 places and 0 transitions.
Performed 636 Post agglomeration using F-continuation condition.Transition count delta: 636
Iterating post reduction 1 with 31799 rules applied. Total rules applied 62962 place count 1558 transition count 32401
Reduce places removed 953 places and 0 transitions.
Ensure Unique test removed 31600 transitions
Reduce isomorphic transitions removed 31600 transitions.
Iterating post reduction 2 with 32553 rules applied. Total rules applied 95515 place count 605 transition count 801
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 95614 place count 605 transition count 702
Applied a total of 95614 rules in 791 ms. Remains 605 /32721 variables (removed 32116) and now considering 702/64200 (removed 63498) transitions.
// Phase 1: matrix 702 rows 605 cols
[2022-05-19 15:35:49] [INFO ] Computed 204 place invariants in 3 ms
[2022-05-19 15:35:49] [INFO ] Implicit Places using invariants in 421 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, 603]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 430 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/32721 places, 702/64200 transitions.
Graph (trivial) has 296 edges and 404 vertex of which 197 / 404 are part of one of the 1 SCC in 0 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 13 transition count 214
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 13 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 11 transition count 18
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 11 transition count 18
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 591 place count 10 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 8 transition count 15
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 8 transition count 15
Applied a total of 595 rules in 13 ms. Remains 8 /404 variables (removed 396) and now considering 15/702 (removed 687) transitions.
// Phase 1: matrix 15 rows 8 cols
[2022-05-19 15:35:49] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:35:49] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 15 rows 8 cols
[2022-05-19 15:35:49] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:35:49] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/32721 places, 15/64200 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/32721 places, 15/64200 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s5 1) (LT s7 1)), p0:(OR (LT s1 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-10 finished in 1413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(F(G(X((X(p0)&&G(p1))))))))))'
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31164 transitions
Trivial Post-agglo rules discarded 31164 transitions
Performed 31164 trivial Post agglomeration. Transition count delta: 31164
Iterating post reduction 0 with 31164 rules applied. Total rules applied 31164 place count 32721 transition count 33036
Reduce places removed 31164 places and 0 transitions.
Performed 636 Post agglomeration using F-continuation condition.Transition count delta: 636
Iterating post reduction 1 with 31800 rules applied. Total rules applied 62964 place count 1557 transition count 32400
Reduce places removed 954 places and 0 transitions.
Ensure Unique test removed 31700 transitions
Reduce isomorphic transitions removed 31700 transitions.
Iterating post reduction 2 with 32654 rules applied. Total rules applied 95618 place count 603 transition count 700
Applied a total of 95618 rules in 780 ms. Remains 603 /32721 variables (removed 32118) and now considering 700/64200 (removed 63500) transitions.
// Phase 1: matrix 700 rows 603 cols
[2022-05-19 15:35:50] [INFO ] Computed 203 place invariants in 2 ms
[2022-05-19 15:35:51] [INFO ] Implicit Places using invariants in 570 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 598 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/32721 places, 700/64200 transitions.
Graph (trivial) has 296 edges and 403 vertex of which 197 / 403 are part of one of the 1 SCC in 0 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 12 transition count 212
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 12 transition count 212
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 10 transition count 16
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 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 591 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 7 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 7 transition count 13
Applied a total of 595 rules in 4 ms. Remains 7 /403 variables (removed 396) and now considering 13/700 (removed 687) transitions.
// Phase 1: matrix 13 rows 7 cols
[2022-05-19 15:35:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 15:35:51] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2022-05-19 15:35:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 15:35:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32721 places, 13/64200 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/32721 places, 13/64200 transitions.
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s5 1)), p0:(OR (LT s1 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-11 finished in 1545 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(F(X((F(X(p0))&&!p0)))))||F(p1)))'
Support contains 3 out of 32721 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Drop transitions removed 31580 transitions
Trivial Post-agglo rules discarded 31580 transitions
Performed 31580 trivial Post agglomeration. Transition count delta: 31580
Iterating post reduction 0 with 31580 rules applied. Total rules applied 31580 place count 32721 transition count 32620
Reduce places removed 31580 places and 0 transitions.
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Iterating post reduction 1 with 31899 rules applied. Total rules applied 63479 place count 1141 transition count 32301
Reduce places removed 637 places and 0 transitions.
Ensure Unique test removed 31700 transitions
Reduce isomorphic transitions removed 31700 transitions.
Iterating post reduction 2 with 32337 rules applied. Total rules applied 95816 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 95915 place count 504 transition count 502
Applied a total of 95915 rules in 659 ms. Remains 504 /32721 variables (removed 32217) and now considering 502/64200 (removed 63698) transitions.
// Phase 1: matrix 502 rows 504 cols
[2022-05-19 15:35:51] [INFO ] Computed 203 place invariants in 2 ms
[2022-05-19 15:35:52] [INFO ] Implicit Places using invariants in 458 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 :
Implicit Place search using SMT only with invariants took 473 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 303/32721 places, 502/64200 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 3 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-19 15:35:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 15:35:52] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-19 15:35:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 15:35:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/32721 places, 8/64200 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/32721 places, 8/64200 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s2 1)), p0:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-12 finished in 1412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)&&p1) U ((p2 U p3)&&!F(p1)))))'
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 556 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:53] [INFO ] Computed 521 place invariants in 571 ms
[2022-05-19 15:35:57] [INFO ] Implicit Places using invariants in 3967 ms returned []
Implicit Place search using SMT only with invariants took 3969 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:35:57] [INFO ] Computed 521 place invariants in 544 ms
[2022-05-19 15:36:00] [INFO ] Dead Transitions using invariants and state equation in 2826 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p3) p1), (OR (NOT p3) p1), true, p1, (NOT p0), (NOT p3)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s8668 1), p0:(GEQ s7188 1), p3:(GEQ s13058 1), p2:(GEQ s6979 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-13 finished in 7688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(p0)))&&(G(p1)||X(F(X(F(p2)))))))'
Support contains 5 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 603 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:36:01] [INFO ] Computed 521 place invariants in 694 ms
[2022-05-19 15:36:05] [INFO ] Implicit Places using invariants in 4111 ms returned []
Implicit Place search using SMT only with invariants took 4120 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:36:05] [INFO ] Computed 521 place invariants in 637 ms
[2022-05-19 15:36:08] [INFO ] Dead Transitions using invariants and state equation in 3445 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s7853 1), p1:(AND (GEQ s331 1) (GEQ s6259 1)), p2:(AND (GEQ s207 1) (GEQ s30701 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 8489 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 5 ms.
FORMULA ServersAndClients-PT-100320-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100320-LTLFireability-14 finished in 17021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0 U (G(!p0)||(!p0&&F(!p1)))))))'
Support contains 4 out of 32721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32721/32721 places, 64200/64200 transitions.
Applied a total of 0 rules in 662 ms. Remains 32721 /32721 variables (removed 0) and now considering 64200/64200 (removed 0) transitions.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:36:18] [INFO ] Computed 521 place invariants in 556 ms
[2022-05-19 15:36:24] [INFO ] Implicit Places using invariants in 6046 ms returned []
Implicit Place search using SMT only with invariants took 6060 ms to find 0 implicit places.
// Phase 1: matrix 64200 rows 32721 cols
[2022-05-19 15:36:24] [INFO ] Computed 521 place invariants in 539 ms
[2022-05-19 15:36:30] [INFO ] Dead Transitions using invariants and state equation in 6120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32721/32721 places, 64200/64200 transitions.
Stuttering acceptance computed with spot in 103 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : ServersAndClients-PT-100320-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s373 1) (GEQ s22823 1)), p1:(AND (GEQ s387 1) (GEQ s4138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 38640 steps with 19126 reset in 10013 ms.
Product exploration timeout after 39030 steps with 19315 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-100320-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100320-LTLFireability-15 finished in 33618 ms.
All properties solved by simple procedures.
Total runtime 153231 ms.

BK_STOP 1652974611062

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-100320"
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-100320, 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 r204-oct2-165281599300492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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