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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 6.0K Apr 29 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 29 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K May 9 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 5.1M 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-200040-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-200040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652974881188

Running Version 202205111006
[2022-05-19 15:41:22] [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:41:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:41:22] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2022-05-19 15:41:22] [INFO ] Transformed 8841 places.
[2022-05-19 15:41:22] [INFO ] Transformed 16400 transitions.
[2022-05-19 15:41:22] [INFO ] Parsed PT model containing 8841 places and 16400 transitions in 503 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ServersAndClients-PT-200040-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2286 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:41:25] [INFO ] Computed 441 place invariants in 234 ms
[2022-05-19 15:41:26] [INFO ] Implicit Places using invariants in 1288 ms returned []
Implicit Place search using SMT only with invariants took 1324 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:41:26] [INFO ] Computed 441 place invariants in 133 ms
[2022-05-19 15:41:27] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Support contains 32 out of 8841 places after structural reductions.
[2022-05-19 15:41:28] [INFO ] Flatten gal took : 674 ms
[2022-05-19 15:41:29] [INFO ] Flatten gal took : 663 ms
[2022-05-19 15:41:30] [INFO ] Input system was already deterministic with 16400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1205 ms. (steps per millisecond=8 ) properties (out of 27) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:41:32] [INFO ] Computed 441 place invariants in 133 ms
[2022-05-19 15:41:35] [INFO ] [Real]Absence check using 241 positive place invariants in 282 ms returned sat
[2022-05-19 15:41:35] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 145 ms returned sat
[2022-05-19 15:41:53] [INFO ] After 16254ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10
[2022-05-19 15:41:57] [INFO ] After 20600ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-19 15:41:57] [INFO ] After 25104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :10
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 10 properties in 51 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X(X(((p0 U p1)&&G(p2)))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2238 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:00] [INFO ] Computed 441 place invariants in 131 ms
[2022-05-19 15:42:01] [INFO ] Implicit Places using invariants in 1123 ms returned []
Implicit Place search using SMT only with invariants took 1124 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:01] [INFO ] Computed 441 place invariants in 114 ms
[2022-05-19 15:42:02] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 382 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (LT s685 1) (LT s3816 1)), p1:(GEQ s6341 1), p0:(GEQ s1387 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 25 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-00 finished in 4674 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F((p1||G(p2))))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7997 transitions
Trivial Post-agglo rules discarded 7997 transitions
Performed 7997 trivial Post agglomeration. Transition count delta: 7997
Iterating post reduction 0 with 7997 rules applied. Total rules applied 7997 place count 8841 transition count 8403
Reduce places removed 8034 places and 0 transitions.
Ensure Unique test removed 7200 transitions
Reduce isomorphic transitions removed 7200 transitions.
Iterating post reduction 1 with 15234 rules applied. Total rules applied 23231 place count 807 transition count 1203
Drop transitions removed 597 transitions
Redundant transition composition rules discarded 597 transitions
Iterating global reduction 2 with 597 rules applied. Total rules applied 23828 place count 807 transition count 606
Discarding 197 places :
Implicit places reduction removed 197 places
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 2 with 591 rules applied. Total rules applied 24419 place count 610 transition count 212
Reduce places removed 591 places and 0 transitions.
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 787 rules applied. Total rules applied 25206 place count 19 transition count 16
Applied a total of 25206 rules in 202 ms. Remains 19 /8841 variables (removed 8822) and now considering 16/16400 (removed 16384) transitions.
// Phase 1: matrix 16 rows 19 cols
[2022-05-19 15:42:03] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 15:42:03] [INFO ] Implicit Places using invariants in 38 ms returned [0, 1, 2, 3, 4, 5, 13, 15, 17]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 53 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/8841 places, 16/16400 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 7 / 10 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Applied a total of 1 rules in 4 ms. Remains 4 /10 variables (removed 6) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:42:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:03] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-19 15:42:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:03] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/8841 places, 7/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/8841 places, 7/16400 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(LT s2 1), p2:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-01 finished in 456 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((F(X(F(p0))) U (X(p2)||p1))))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1719 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:05] [INFO ] Computed 441 place invariants in 243 ms
[2022-05-19 15:42:06] [INFO ] Implicit Places using invariants in 1532 ms returned []
Implicit Place search using SMT only with invariants took 1542 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:06] [INFO ] Computed 441 place invariants in 144 ms
[2022-05-19 15:42:17] [INFO ] Dead Transitions using invariants and state equation in 11197 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s6233 1) (GEQ s6950 1)), p2:(GEQ s5326 1), p0:(GEQ s6950 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 3508 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-200040-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-03 finished in 18190 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 1 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8841 transition count 8401
Reduce places removed 8038 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 1 with 15638 rules applied. Total rules applied 23637 place count 803 transition count 801
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 2 with 199 rules applied. Total rules applied 23836 place count 803 transition count 602
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 2 with 597 rules applied. Total rules applied 24433 place count 604 transition count 204
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 795 rules applied. Total rules applied 25228 place count 7 transition count 6
Applied a total of 25228 rules in 139 ms. Remains 7 /8841 variables (removed 8834) and now considering 6/16400 (removed 16394) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 15:42:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 15:42:21] [INFO ] Implicit Places using invariants in 33 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8841 places, 6/16400 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:42:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:21] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:42:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:21] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/8841 places, 3/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/8841 places, 3/16400 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-04 finished in 437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((F(p0) U F(X(F(p1)))))&&p2))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1779 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:23] [INFO ] Computed 441 place invariants in 170 ms
[2022-05-19 15:42:25] [INFO ] Implicit Places using invariants in 1780 ms returned []
Implicit Place search using SMT only with invariants took 1787 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:25] [INFO ] Computed 441 place invariants in 144 ms
[2022-05-19 15:42:26] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s739 1) (GEQ s8037 1)), p2:(OR (GEQ s5820 1) (GEQ s4129 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][false, false, false]]
Product exploration explored 100000 steps with 6 reset in 3057 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-200040-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-06 finished in 7800 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(F(X(F(X((X(F(p0))||p0))))))))))'
Support contains 1 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1884 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:31] [INFO ] Computed 441 place invariants in 127 ms
[2022-05-19 15:42:33] [INFO ] Implicit Places using invariants in 1776 ms returned []
Implicit Place search using SMT only with invariants took 1785 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:33] [INFO ] Computed 441 place invariants in 128 ms
[2022-05-19 15:42:34] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LT s2834 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 4807 ms.
Product exploration explored 100000 steps with 16666 reset in 4765 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished probabilistic random walk after 12717 steps, run visited all 1 properties in 1473 ms. (steps per millisecond=8 )
Probabilistic random walk after 12717 steps, saw 4394 distinct states, run finished after 1473 ms. (steps per millisecond=8 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1808 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:49] [INFO ] Computed 441 place invariants in 101 ms
[2022-05-19 15:42:51] [INFO ] Implicit Places using invariants in 1774 ms returned []
Implicit Place search using SMT only with invariants took 1788 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:51] [INFO ] Computed 441 place invariants in 109 ms
[2022-05-19 15:43:05] [INFO ] Dead Transitions using invariants and state equation in 14061 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished probabilistic random walk after 12717 steps, run visited all 1 properties in 1265 ms. (steps per millisecond=10 )
Probabilistic random walk after 12717 steps, saw 4394 distinct states, run finished after 1266 ms. (steps per millisecond=10 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 4962 ms.
Product exploration explored 100000 steps with 16666 reset in 4886 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Performed 7999 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8841 transition count 16400
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 8037 place count 8803 transition count 8800
Deduced a syphon composed of 7999 places in 2 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 8075 place count 8803 transition count 8800
Discarding 7600 places :
Symmetric choice reduction at 1 with 7600 rule applications. Total rules 15675 place count 1203 transition count 1200
Deduced a syphon composed of 399 places in 1 ms
Iterating global reduction 1 with 7600 rules applied. Total rules applied 23275 place count 1203 transition count 1200
Deduced a syphon composed of 399 places in 0 ms
Applied a total of 23275 rules in 5386 ms. Remains 1203 /8841 variables (removed 7638) and now considering 1200/16400 (removed 15200) transitions.
[2022-05-19 15:43:24] [INFO ] Redundant transitions in 72 ms returned []
[2022-05-19 15:43:24] [INFO ] Flow matrix only has 1001 transitions (discarded 199 similar events)
// Phase 1: matrix 1001 rows 1203 cols
[2022-05-19 15:43:24] [INFO ] Computed 403 place invariants in 8 ms
[2022-05-19 15:43:25] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1203/8841 places, 1200/16400 transitions.
Finished structural reductions, in 1 iterations. Remains : 1203/8841 places, 1200/16400 transitions.
Product exploration explored 100000 steps with 16666 reset in 6979 ms.
Product exploration explored 100000 steps with 16666 reset in 6815 ms.
Built C files in :
/tmp/ltsmin18049939276725851586
[2022-05-19 15:43:39] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18049939276725851586
Running compilation step : cd /tmp/ltsmin18049939276725851586;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18049939276725851586;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18049939276725851586;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2591 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:43:45] [INFO ] Computed 441 place invariants in 136 ms
[2022-05-19 15:43:47] [INFO ] Implicit Places using invariants in 1770 ms returned []
Implicit Place search using SMT only with invariants took 1778 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:43:47] [INFO ] Computed 441 place invariants in 135 ms
[2022-05-19 15:43:48] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Built C files in :
/tmp/ltsmin1087298635020740096
[2022-05-19 15:43:48] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1087298635020740096
Running compilation step : cd /tmp/ltsmin1087298635020740096;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1087298635020740096;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1087298635020740096;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 15:43:53] [INFO ] Flatten gal took : 479 ms
[2022-05-19 15:43:53] [INFO ] Flatten gal took : 521 ms
[2022-05-19 15:43:53] [INFO ] Time to serialize gal into /tmp/LTL8638147172198606153.gal : 95 ms
[2022-05-19 15:43:53] [INFO ] Time to serialize properties into /tmp/LTL10536718012817551812.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8638147172198606153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10536718012817551812.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8638147...267
Read 1 LTL properties
Checking formula 0 : !((F(X(X(X(F(X(F(X((X(F("(sv10_c22<1)")))||("(sv10_c22<1)")))))))))))
Formula 0 simplified : !FXXXFXFX("(sv10_c22<1)" | XF"(sv10_c22<1)")
Detected timeout of ITS tools.
[2022-05-19 15:44:09] [INFO ] Flatten gal took : 593 ms
[2022-05-19 15:44:09] [INFO ] Applying decomposition
[2022-05-19 15:44:10] [INFO ] Flatten gal took : 617 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13861104120604046445.txt' '-o' '/tmp/graph13861104120604046445.bin' '-w' '/tmp/graph13861104120604046445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13861104120604046445.bin' '-l' '-1' '-v' '-w' '/tmp/graph13861104120604046445.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:44:11] [INFO ] Decomposing Gal with order
[2022-05-19 15:44:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:44:14] [INFO ] Removed a total of 16290 redundant transitions.
[2022-05-19 15:44:14] [INFO ] Flatten gal took : 2332 ms
[2022-05-19 15:44:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 273 ms.
[2022-05-19 15:44:15] [INFO ] Time to serialize gal into /tmp/LTL14665891291742430286.gal : 296 ms
[2022-05-19 15:44:15] [INFO ] Time to serialize properties into /tmp/LTL12506718406879733439.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14665891291742430286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12506718406879733439.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1466589...247
Read 1 LTL properties
Checking formula 0 : !((F(X(X(X(F(X(F(X((X(F("(i189.u22.sv10_c22<1)")))||("(i189.u22.sv10_c22<1)")))))))))))
Formula 0 simplified : !FXXXFXFX("(i189.u22.sv10_c22<1)" | XF"(i189.u22.sv10_c22<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10458559991027623070
[2022-05-19 15:44:31] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10458559991027623070
Running compilation step : cd /tmp/ltsmin10458559991027623070;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10458559991027623070;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10458559991027623070;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ServersAndClients-PT-200040-LTLFireability-07 finished in 124279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7761 transitions
Trivial Post-agglo rules discarded 7761 transitions
Performed 7761 trivial Post agglomeration. Transition count delta: 7761
Iterating post reduction 0 with 7761 rules applied. Total rules applied 7761 place count 8841 transition count 8639
Reduce places removed 7761 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 7800 rules applied. Total rules applied 15561 place count 1080 transition count 8600
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 2 with 7678 rules applied. Total rules applied 23239 place count 1002 transition count 1000
Applied a total of 23239 rules in 396 ms. Remains 1002 /8841 variables (removed 7839) and now considering 1000/16400 (removed 15400) transitions.
// Phase 1: matrix 1000 rows 1002 cols
[2022-05-19 15:44:34] [INFO ] Computed 402 place invariants in 17 ms
[2022-05-19 15:44:35] [INFO ] Implicit Places using invariants in 953 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 955 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 602/8841 places, 1000/16400 transitions.
Graph (trivial) has 598 edges and 602 vertex of which 399 / 602 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 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 5 ms. Remains 4 /602 variables (removed 598) and now considering 6/1000 (removed 994) transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:44:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:44:35] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:44:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:44:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/8841 places, 6/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/8841 places, 6/16400 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ 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-200040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-08 finished in 1466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&p1) U !X(X(p2))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 3119 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:44:38] [INFO ] Computed 441 place invariants in 139 ms
[2022-05-19 15:44:39] [INFO ] Implicit Places using invariants in 761 ms returned []
Implicit Place search using SMT only with invariants took 762 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:44:39] [INFO ] Computed 441 place invariants in 138 ms
[2022-05-19 15:44:56] [INFO ] Dead Transitions using invariants and state equation in 17033 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 191 ms :[p2, p2, p2, p2, true, (AND (NOT p0) p2), p2, p2, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0), acceptance={} source=2 dest: 7}], [{ cond=p2, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 8}], [{ cond=p2, acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=7 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=7 dest: 6}, { cond=(AND p1 p0 p2), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s1093 1), p0:(GEQ s6077 1), p2:(OR (LT s6077 1) (GEQ s6425 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, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-10 finished in 21161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(F(G(p0)))))&&(X(p1) U X(p2))))'
Support contains 5 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1785 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:44:58] [INFO ] Computed 441 place invariants in 111 ms
[2022-05-19 15:44:59] [INFO ] Implicit Places using invariants in 702 ms returned []
Implicit Place search using SMT only with invariants took 702 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:44:59] [INFO ] Computed 441 place invariants in 106 ms
[2022-05-19 15:45:07] [INFO ] Dead Transitions using invariants and state equation in 8766 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s635 1) (GEQ s3816 1)), p1:(AND (GEQ s451 1) (GEQ s6429 1)), p0:(LT s7975 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-12 finished in 11388 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(((p0 U p1)||X(!p1)))))))'
Support contains 3 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1683 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:45:09] [INFO ] Computed 441 place invariants in 114 ms
[2022-05-19 15:45:11] [INFO ] Implicit Places using invariants in 1496 ms returned []
Implicit Place search using SMT only with invariants took 1497 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:45:11] [INFO ] Computed 441 place invariants in 99 ms
[2022-05-19 15:45:28] [INFO ] Dead Transitions using invariants and state equation in 16979 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, p1, false, false, false, false]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s619 1) (GEQ s6429 1)), p0:(GEQ s3563 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 829 steps with 0 reset in 25 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLFireability-14 finished in 20352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7998 transitions
Trivial Post-agglo rules discarded 7998 transitions
Performed 7998 trivial Post agglomeration. Transition count delta: 7998
Iterating post reduction 0 with 7998 rules applied. Total rules applied 7998 place count 8841 transition count 8402
Reduce places removed 8036 places and 0 transitions.
Ensure Unique test removed 7400 transitions
Reduce isomorphic transitions removed 7400 transitions.
Iterating post reduction 1 with 15436 rules applied. Total rules applied 23434 place count 805 transition count 1002
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 2 with 398 rules applied. Total rules applied 23832 place count 805 transition count 604
Discarding 198 places :
Implicit places reduction removed 198 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 2 with 594 rules applied. Total rules applied 24426 place count 607 transition count 208
Reduce places removed 594 places and 0 transitions.
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 3 with 791 rules applied. Total rules applied 25217 place count 13 transition count 11
Applied a total of 25217 rules in 155 ms. Remains 13 /8841 variables (removed 8828) and now considering 11/16400 (removed 16389) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 15:45:28] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-19 15:45:28] [INFO ] Implicit Places using invariants in 70 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 74 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8841 places, 11/16400 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 0 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:45:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:45:28] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:45:28] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:45:28] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/8841 places, 5/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 3/8841 places, 5/16400 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s2 1), p0:(LT s1 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 176 ms.
Product exploration explored 100000 steps with 0 reset in 67 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 295 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:45:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:45:29] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2022-05-19 15:45:29] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 317 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-200040-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-200040-LTLFireability-15 finished in 1888 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(F(X(F(X((X(F(p0))||p0))))))))))'
Found a CL insensitive property : ServersAndClients-PT-200040-LTLFireability-07
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8841 transition count 8401
Reduce places removed 8038 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 1 with 15638 rules applied. Total rules applied 23637 place count 803 transition count 801
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 2 with 199 rules applied. Total rules applied 23836 place count 803 transition count 602
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 2 with 597 rules applied. Total rules applied 24433 place count 604 transition count 204
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 795 rules applied. Total rules applied 25228 place count 7 transition count 6
Applied a total of 25228 rules in 156 ms. Remains 7 /8841 variables (removed 8834) and now considering 6/16400 (removed 16394) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 15:45:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 15:45:30] [INFO ] Implicit Places using invariants in 50 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 4/8841 places, 6/16400 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:45:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:45:30] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:45:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:45:31] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 2/8841 places, 3/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/8841 places, 3/16400 transitions.
Running random walk in product with property : ServersAndClients-PT-200040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15757 reset in 272 ms.
Product exploration explored 100000 steps with 15774 reset in 272 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 559 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:45:32] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:45:32] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:45:32] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:45:32] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:45:32] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:45:32] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 3/3 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 366 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15759 reset in 40 ms.
Product exploration explored 100000 steps with 15769 reset in 57 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2022-05-19 15:45:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:45:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:45:34] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 3/3 transitions.
Product exploration explored 100000 steps with 15761 reset in 96 ms.
Product exploration explored 100000 steps with 15773 reset in 57 ms.
Built C files in :
/tmp/ltsmin2781806129847912298
[2022-05-19 15:45:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2781806129847912298
Running compilation step : cd /tmp/ltsmin2781806129847912298;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin2781806129847912298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2781806129847912298;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6703674500031708114.hoa' '--buchi-type=spotba'
LTSmin run took 204 ms.
Treatment of property ServersAndClients-PT-200040-LTLFireability-07 finished in 4663 ms.
FORMULA ServersAndClients-PT-200040-LTLFireability-07 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-19 15:45:36] [INFO ] Flatten gal took : 987 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 253656 ms.

BK_STOP 1652975136278

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

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