Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r069-smll-167814396300340.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ClientsAndServers-PT-N1000P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396300340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.1K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678414855224

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N1000P0
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 02:20:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 02:20:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 02:20:58] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-10 02:20:58] [INFO ] Transformed 25 places.
[2023-03-10 02:20:58] [INFO ] Transformed 18 transitions.
[2023-03-10 02:20:59] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 22 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-10 02:20:59] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-10 02:20:59] [INFO ] Implicit Places using invariants in 219 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 302 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 17 out of 23 places after structural reductions.
[2023-03-10 02:20:59] [INFO ] Flatten gal took : 33 ms
[2023-03-10 02:20:59] [INFO ] Flatten gal took : 12 ms
[2023-03-10 02:20:59] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16004 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=470 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 13) seen :6
Finished Best-First random walk after 395 steps, including 0 resets, run visited all 7 properties in 5 ms. (steps per millisecond=79 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-10 02:21:00] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-10 02:21:00] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-10 02:21:00] [INFO ] Invariant cache hit.
[2023-03-10 02:21:00] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-10 02:21:00] [INFO ] Invariant cache hit.
[2023-03-10 02:21:00] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s6 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-00 finished in 549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
[2023-03-10 02:21:01] [INFO ] Invariant cache hit.
[2023-03-10 02:21:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-10 02:21:01] [INFO ] Invariant cache hit.
[2023-03-10 02:21:01] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-10 02:21:01] [INFO ] Invariant cache hit.
[2023-03-10 02:21:01] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s15 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][false, false]]
Product exploration explored 100000 steps with 25190 reset in 315 ms.
Product exploration explored 100000 steps with 24973 reset in 196 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2667 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-10 02:21:02] [INFO ] Invariant cache hit.
[2023-03-10 02:21:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:02] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-10 02:21:02] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 02:21:02] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 10 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 8 transition count 6
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 6 transition count 4
Applied a total of 28 rules in 15 ms. Remains 6 /20 variables (removed 14) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-10 02:21:02] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-10 02:21:02] [INFO ] Implicit Places using invariants in 39 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/20 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56 ms. Remains : 5/20 places, 4/18 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-01 finished in 1682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 21 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 10 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 8 transition count 5
Applied a total of 28 rules in 9 ms. Remains 8 /23 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-10 02:21:02] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 02:21:02] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 02:21:02] [INFO ] Invariant cache hit.
[2023-03-10 02:21:02] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-10 02:21:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 02:21:02] [INFO ] Invariant cache hit.
[2023-03-10 02:21:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/23 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 8/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s6 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 193 ms.
Stack based approach found an accepted trace after 163 steps with 0 reset with depth 164 and stack size 156 in 2 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-02 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X(F(!p1)))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-10 02:21:03] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-10 02:21:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 02:21:03] [INFO ] Invariant cache hit.
[2023-03-10 02:21:03] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-10 02:21:03] [INFO ] Invariant cache hit.
[2023-03-10 02:21:03] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 341 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=1, aps=[p1:(GEQ s15 1), p0:(GEQ s17 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, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2595 reset in 128 ms.
Product exploration explored 100000 steps with 2812 reset in 177 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[p1, p1, p1, p1, p1]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=2286 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 241 ms :[p1, p1, p1, p1, p1]
Support contains 1 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 02:21:05] [INFO ] Invariant cache hit.
[2023-03-10 02:21:05] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-10 02:21:05] [INFO ] Invariant cache hit.
[2023-03-10 02:21:05] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-10 02:21:05] [INFO ] Invariant cache hit.
[2023-03-10 02:21:05] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 20/20 places, 18/18 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 : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[p1, p1, p1, p1, p1]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 242 ms :[p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 240 ms :[p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 1662 reset in 145 ms.
Product exploration explored 100000 steps with 1683 reset in 187 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 226 ms :[p1, p1, p1, p1, p1]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 16 transition count 14
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 16 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 14 transition count 12
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 14 transition count 12
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 26 rules in 8 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2023-03-10 02:21:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2023-03-10 02:21:07] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 02:21:07] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/20 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 14/20 places, 12/18 transitions.
Built C files in :
/tmp/ltsmin5550818223200543700
[2023-03-10 02:21:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5550818223200543700
Running compilation step : cd /tmp/ltsmin5550818223200543700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 347 ms.
Running link step : cd /tmp/ltsmin5550818223200543700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin5550818223200543700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9704992652474910512.hoa' '--buchi-type=spotba'
LTSmin run took 11185 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-03 finished in 15949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 14 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 10 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 8 transition count 5
Applied a total of 28 rules in 3 ms. Remains 8 /23 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-10 02:21:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 02:21:19] [INFO ] Implicit Places using invariants in 34 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40 ms. Remains : 7/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4064 reset in 100 ms.
Stack based approach found an accepted trace after 60 steps with 1 reset with depth 38 and stack size 36 in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-04 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((X(p1)&&p0))&&X(p1))) U p2))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 02:21:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 02:21:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 02:21:19] [INFO ] Invariant cache hit.
[2023-03-10 02:21:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-10 02:21:19] [INFO ] Invariant cache hit.
[2023-03-10 02:21:19] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s16 1), p2:(OR (GEQ s19 1) (GEQ s16 1)), p0:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 985 reset in 221 ms.
Product exploration explored 100000 steps with 982 reset in 508 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p1))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 449 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=1066 ) properties (out of 6) seen :0
Finished Best-First random walk after 528 steps, including 0 resets, run visited all 6 properties in 5 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p1))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))), (F (AND p2 p0 p1)), (F p2), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 716 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
[2023-03-10 02:21:22] [INFO ] Invariant cache hit.
[2023-03-10 02:21:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-10 02:21:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:21:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-10 02:21:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 02:21:22] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 02:21:22] [INFO ] Invariant cache hit.
[2023-03-10 02:21:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-10 02:21:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:21:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:22] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-10 02:21:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 02:21:22] [INFO ] Added : 9 causal constraints over 2 iterations in 22 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-10 02:21:22] [INFO ] Invariant cache hit.
[2023-03-10 02:21:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 02:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-10 02:21:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 02:21:22] [INFO ] Added : 13 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 02:21:22] [INFO ] Invariant cache hit.
[2023-03-10 02:21:22] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 02:21:22] [INFO ] Invariant cache hit.
[2023-03-10 02:21:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-10 02:21:22] [INFO ] Invariant cache hit.
[2023-03-10 02:21:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 21/21 places, 18/18 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 : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p1))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 476 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 6) seen :0
Finished Best-First random walk after 426 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=142 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p1))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))), (F (AND p2 p0 p1)), (F p2), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 677 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
[2023-03-10 02:21:24] [INFO ] Invariant cache hit.
[2023-03-10 02:21:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:21:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-10 02:21:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:21:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:21:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:24] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-10 02:21:24] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 02:21:24] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 02:21:24] [INFO ] Invariant cache hit.
[2023-03-10 02:21:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:21:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-10 02:21:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:21:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:21:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:25] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-10 02:21:25] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 02:21:25] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-10 02:21:25] [INFO ] Invariant cache hit.
[2023-03-10 02:21:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:21:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:25] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-10 02:21:25] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 02:21:25] [INFO ] Added : 13 causal constraints over 3 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 977 reset in 117 ms.
Product exploration explored 100000 steps with 995 reset in 129 ms.
Built C files in :
/tmp/ltsmin15374652425243121696
[2023-03-10 02:21:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15374652425243121696
Running compilation step : cd /tmp/ltsmin15374652425243121696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 117 ms.
Running link step : cd /tmp/ltsmin15374652425243121696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15374652425243121696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14433871133195769803.hoa' '--buchi-type=spotba'
LTSmin run took 1748 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-05 finished in 8182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 02:21:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 02:21:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 02:21:27] [INFO ] Invariant cache hit.
[2023-03-10 02:21:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-10 02:21:27] [INFO ] Invariant cache hit.
[2023-03-10 02:21:27] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s16 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][false, false]]
Product exploration explored 100000 steps with 5688 reset in 68 ms.
Product exploration explored 100000 steps with 5699 reset in 135 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 1) seen :0
Finished Best-First random walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
[2023-03-10 02:21:28] [INFO ] Invariant cache hit.
[2023-03-10 02:21:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:21:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-10 02:21:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:21:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:21:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-10 02:21:28] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 02:21:28] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 14 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14 place count 14 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 10 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 8 transition count 5
Applied a total of 26 rules in 5 ms. Remains 8 /21 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-10 02:21:28] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 02:21:28] [INFO ] Implicit Places using invariants in 23 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/21 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 7/21 places, 5/18 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
// Phase 1: matrix 5 rows 7 cols
[2023-03-10 02:21:29] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 02:21:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:21:29] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 02:21:29] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 41 ms :[p0]
Product exploration explored 100000 steps with 15096 reset in 67 ms.
Product exploration explored 100000 steps with 15162 reset in 66 ms.
Built C files in :
/tmp/ltsmin5820602388152820882
[2023-03-10 02:21:29] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2023-03-10 02:21:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:21:29] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2023-03-10 02:21:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:21:29] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2023-03-10 02:21:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:21:29] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5820602388152820882
Running compilation step : cd /tmp/ltsmin5820602388152820882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin5820602388152820882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5820602388152820882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4671828209133884372.hoa' '--buchi-type=spotba'
LTSmin run took 11493 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-06 finished in 13400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F((X(p0) U p1))))))'
Support contains 1 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 17 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14 place count 15 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 11 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 3 with 2 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 4 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-10 02:21:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 02:21:41] [INFO ] Implicit Places using invariants in 29 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/23 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36 ms. Remains : 9/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5677 reset in 85 ms.
Product exploration explored 100000 steps with 5736 reset in 87 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5003 ) properties (out of 1) seen :0
Finished Best-First random walk after 146 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=146 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 7 rows 9 cols
[2023-03-10 02:21:41] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 02:21:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-10 02:21:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:21:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:42] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-10 02:21:42] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 02:21:42] [INFO ] Added : 4 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-10 02:21:42] [INFO ] Invariant cache hit.
[2023-03-10 02:21:42] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-10 02:21:42] [INFO ] Invariant cache hit.
[2023-03-10 02:21:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-10 02:21:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 02:21:42] [INFO ] Invariant cache hit.
[2023-03-10 02:21:42] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 9/9 places, 7/7 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Finished Best-First random walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
[2023-03-10 02:21:42] [INFO ] Invariant cache hit.
[2023-03-10 02:21:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-10 02:21:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:21:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:21:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:21:42] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 02:21:42] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5678 reset in 67 ms.
Product exploration explored 100000 steps with 5651 reset in 82 ms.
Built C files in :
/tmp/ltsmin3322969653563680497
[2023-03-10 02:21:43] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2023-03-10 02:21:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:21:43] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2023-03-10 02:21:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:21:43] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2023-03-10 02:21:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:21:43] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3322969653563680497
Running compilation step : cd /tmp/ltsmin3322969653563680497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin3322969653563680497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3322969653563680497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11622442739256053375.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 6 transition count 5
Applied a total of 5 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-10 02:21:58] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 02:21:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 02:21:58] [INFO ] Invariant cache hit.
[2023-03-10 02:21:58] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-10 02:21:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 02:21:58] [INFO ] Invariant cache hit.
[2023-03-10 02:21:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 6/9 places, 5/7 transitions.
Built C files in :
/tmp/ltsmin9870424486652622843
[2023-03-10 02:21:58] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2023-03-10 02:21:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:21:58] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2023-03-10 02:21:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:21:58] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2023-03-10 02:21:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:21:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9870424486652622843
Running compilation step : cd /tmp/ltsmin9870424486652622843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin9870424486652622843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9870424486652622843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3229772912391423792.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 02:22:13] [INFO ] Flatten gal took : 6 ms
[2023-03-10 02:22:13] [INFO ] Flatten gal took : 2 ms
[2023-03-10 02:22:13] [INFO ] Time to serialize gal into /tmp/LTL6384651566711174063.gal : 1 ms
[2023-03-10 02:22:13] [INFO ] Time to serialize properties into /tmp/LTL1403994922203255384.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6384651566711174063.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11708318450710885406.hoa' '-atoms' '/tmp/LTL1403994922203255384.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1403994922203255384.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11708318450710885406.hoa
Detected timeout of ITS tools.
[2023-03-10 02:22:28] [INFO ] Flatten gal took : 3 ms
[2023-03-10 02:22:28] [INFO ] Flatten gal took : 2 ms
[2023-03-10 02:22:28] [INFO ] Time to serialize gal into /tmp/LTL11005203973524444433.gal : 7 ms
[2023-03-10 02:22:28] [INFO ] Time to serialize properties into /tmp/LTL16954672711753179213.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11005203973524444433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16954672711753179213.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(F((X("((SG>=1)&&(SwG>=1))"))U("(MpA>=1)")))))))
Formula 0 simplified : FG(!"(MpA>=1)" & (!"(MpA>=1)" W !"((SG>=1)&&(SwG>=1))"))
Detected timeout of ITS tools.
[2023-03-10 02:22:43] [INFO ] Flatten gal took : 1 ms
[2023-03-10 02:22:43] [INFO ] Applying decomposition
[2023-03-10 02:22:43] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15318333062914186695.txt' '-o' '/tmp/graph15318333062914186695.bin' '-w' '/tmp/graph15318333062914186695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15318333062914186695.bin' '-l' '-1' '-v' '-w' '/tmp/graph15318333062914186695.weights' '-q' '0' '-e' '0.001'
[2023-03-10 02:22:43] [INFO ] Decomposing Gal with order
[2023-03-10 02:22:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 02:22:43] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 02:22:43] [INFO ] Flatten gal took : 39 ms
[2023-03-10 02:22:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-10 02:22:43] [INFO ] Time to serialize gal into /tmp/LTL7981565841854233420.gal : 1 ms
[2023-03-10 02:22:43] [INFO ] Time to serialize properties into /tmp/LTL415727924198828736.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7981565841854233420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL415727924198828736.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(G(F((X("((u1.SG>=1)&&(i2.u3.SwG>=1))"))U("(i2.u2.MpA>=1)")))))))
Formula 0 simplified : FG(!"(i2.u2.MpA>=1)" & (!"(i2.u2.MpA>=1)" W !"((u1.SG>=1)&&(i2.u3.SwG>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14014889757324240147
[2023-03-10 02:22:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14014889757324240147
Running compilation step : cd /tmp/ltsmin14014889757324240147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin14014889757324240147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14014889757324240147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](<>((X((LTLAPp0==true)) U (LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-07 finished in 92834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||X(p0)))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 18
Applied a total of 3 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-10 02:23:13] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 02:23:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-10 02:23:13] [INFO ] Invariant cache hit.
[2023-03-10 02:23:13] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-10 02:23:13] [INFO ] Invariant cache hit.
[2023-03-10 02:23:14] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), false, false]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s0 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-08 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U !p2)&&p0))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 12 transition count 9
Applied a total of 20 rules in 5 ms. Remains 12 /23 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-10 02:23:14] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 02:23:14] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 02:23:14] [INFO ] Invariant cache hit.
[2023-03-10 02:23:14] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 02:23:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 02:23:14] [INFO ] Invariant cache hit.
[2023-03-10 02:23:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 12/23 places, 9/18 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p2), p2]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s9 1)), p0:(AND (GEQ s4 1) (GEQ s7 1)), p1:(GEQ s8 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 1600 reset in 214 ms.
Stack based approach found an accepted trace after 38 steps with 1 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-09 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U X((F(p3)&&p2)))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 02:23:14] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 02:23:14] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 02:23:14] [INFO ] Invariant cache hit.
[2023-03-10 02:23:14] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-10 02:23:14] [INFO ] Invariant cache hit.
[2023-03-10 02:23:14] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s20 1), p1:(AND (GEQ s1 1) (GEQ s17 1)), p2:(AND (GEQ s6 1) (GEQ s1 1) (GEQ s17 1)), p3:(GEQ s6 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 811 reset in 189 ms.
Product exploration explored 100000 steps with 779 reset in 222 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 p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1289 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter sensitive) to 4 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 02:23:16] [INFO ] Invariant cache hit.
[2023-03-10 02:23:17] [INFO ] After 21ms 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 p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (G (NOT (AND (NOT p3) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p3), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 23 factoid took 1856 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
[2023-03-10 02:23:19] [INFO ] Invariant cache hit.
[2023-03-10 02:23:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:23:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (G (NOT (AND (NOT p3) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p3), (F (AND p1 (NOT p2))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 23 factoid took 855 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-10 finished in 5447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X((!p2||F(p0)))&&p1))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2023-03-10 02:23:20] [INFO ] Invariant cache hit.
[2023-03-10 02:23:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-10 02:23:20] [INFO ] Invariant cache hit.
[2023-03-10 02:23:20] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-10 02:23:20] [INFO ] Invariant cache hit.
[2023-03-10 02:23:20] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (OR (NOT p1) (AND (NOT p0) p2)), true, (NOT p0), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s14 1)), p0:(OR (LT s0 1) (LT s13 1)), p2:(AND (GEQ s1 1) (GEQ s17 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 141 ms.
Product exploration explored 100000 steps with 33333 reset in 152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p2))))
Knowledge based reduction with 8 factoid took 271 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-11 finished in 923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(!p0)||X(F(p1))) U X(X(p2)))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 02:23:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 02:23:21] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 02:23:21] [INFO ] Invariant cache hit.
[2023-03-10 02:23:21] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-10 02:23:21] [INFO ] Invariant cache hit.
[2023-03-10 02:23:21] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p1) p0), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 11}], [{ cond=p0, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 8}, { cond=(NOT p1), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 11}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=11 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=11 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=11 dest: 11}]], initial=4, aps=[p0:(OR (LT s11 1) (LT s16 1)), p1:(AND (GEQ s7 1) (GEQ s20 1)), p2:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1780 reset in 138 ms.
Product exploration explored 100000 steps with 1788 reset in 154 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 p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 444 ms. Reduced automaton from 12 states, 37 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 518 ms :[(AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 02:23:23] [INFO ] Invariant cache hit.
[2023-03-10 02:23:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 02:23:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:23:23] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 02:23:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 02:23:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:23:23] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 02:23:23] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-10 02:23:23] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 61 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=20 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 734 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 522 ms :[(AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 541 ms :[(AND (NOT p1) p0), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2023-03-10 02:23:25] [INFO ] Invariant cache hit.
[2023-03-10 02:23:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 7 factoid took 474 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-12 finished in 4646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 14 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 10 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 8 transition count 5
Applied a total of 28 rules in 7 ms. Remains 8 /23 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-10 02:23:25] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 02:23:25] [INFO ] Implicit Places using invariants in 42 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52 ms. Remains : 7/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s6 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 77 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-14 finished in 195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F((X(p0) U p1))))))'
[2023-03-10 02:23:26] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14292793079592722737
[2023-03-10 02:23:26] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-03-10 02:23:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:23:26] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-03-10 02:23:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:23:26] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-03-10 02:23:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 02:23:26] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14292793079592722737
Running compilation step : cd /tmp/ltsmin14292793079592722737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-10 02:23:26] [INFO ] Applying decomposition
[2023-03-10 02:23:26] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18236468393815729738.txt' '-o' '/tmp/graph18236468393815729738.bin' '-w' '/tmp/graph18236468393815729738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18236468393815729738.bin' '-l' '-1' '-v' '-w' '/tmp/graph18236468393815729738.weights' '-q' '0' '-e' '0.001'
[2023-03-10 02:23:26] [INFO ] Decomposing Gal with order
[2023-03-10 02:23:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 02:23:26] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 02:23:26] [INFO ] Flatten gal took : 5 ms
[2023-03-10 02:23:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-10 02:23:26] [INFO ] Time to serialize gal into /tmp/LTLFireability5126838140708237683.gal : 1 ms
[2023-03-10 02:23:26] [INFO ] Time to serialize properties into /tmp/LTLFireability3017464827157361951.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5126838140708237683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3017464827157361951.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(F((X("((i3.u6.SG>=1)&&(u7.SwG>=1))"))U("(i2.u0.MpA>=1)")))))))
Formula 0 simplified : FG(!"(i2.u0.MpA>=1)" & (!"(i2.u0.MpA>=1)" W !"((i3.u6.SG>=1)&&(u7.SwG>=1))"))
Compilation finished in 132 ms.
Running link step : cd /tmp/ltsmin14292793079592722737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14292793079592722737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](<>((X((LTLAPp0==true)) U (LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: X(X([](<>((X((LTLAPp0==true)) U (LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.002: "X(X([](<>((X((LTLAPp0==true)) U (LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.076: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.076: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.076: State length is 24, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.076: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.076: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.076: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.076: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.204: ~111 levels ~960 states ~6088 transitions
pins2lts-mc-linux64( 6/ 8), 0.367: ~222 levels ~1920 states ~14392 transitions
pins2lts-mc-linux64( 6/ 8), 0.650: ~450 levels ~3840 states ~34288 transitions
pins2lts-mc-linux64( 5/ 8), 1.048: ~877 levels ~7680 states ~73736 transitions
pins2lts-mc-linux64( 2/ 8), 1.545: ~1761 levels ~15360 states ~157960 transitions
pins2lts-mc-linux64( 2/ 8), 2.203: ~3540 levels ~30720 states ~340056 transitions
pins2lts-mc-linux64( 0/ 8), 2.824: ~7076 levels ~61440 states ~708632 transitions
pins2lts-mc-linux64( 0/ 8), 3.428: ~14221 levels ~122880 states ~1462344 transitions
pins2lts-mc-linux64( 7/ 8), 4.059: ~28342 levels ~245760 states ~2870512 transitions
pins2lts-mc-linux64( 3/ 8), 4.315: ~32722 levels ~491520 states ~3151176 transitions
pins2lts-mc-linux64( 3/ 8), 4.829: ~32722 levels ~983040 states ~3874256 transitions
pins2lts-mc-linux64( 3/ 8), 6.015: ~32722 levels ~1966080 states ~5348352 transitions
pins2lts-mc-linux64( 4/ 8), 8.224: ~34432 levels ~3932160 states ~8473944 transitions
pins2lts-mc-linux64( 0/ 8), 13.736: ~34171 levels ~7864320 states ~15976648 transitions
pins2lts-mc-linux64( 0/ 8), 26.038: ~34466 levels ~15728640 states ~29989224 transitions
pins2lts-mc-linux64( 7/ 8), 31.434: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 31.525:
pins2lts-mc-linux64( 0/ 8), 31.525: mean standard work distribution: 4.9% (states) 3.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 31.525:
pins2lts-mc-linux64( 0/ 8), 31.525: Explored 16131535 states 31482100 transitions, fanout: 1.952
pins2lts-mc-linux64( 0/ 8), 31.525: Total exploration time 31.440 sec (31.340 sec minimum, 31.404 sec on average)
pins2lts-mc-linux64( 0/ 8), 31.526: States per second: 513090, Transitions per second: 1001339
pins2lts-mc-linux64( 0/ 8), 31.526:
pins2lts-mc-linux64( 0/ 8), 31.526: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 31.526: Redundant explorations: -13.0427
pins2lts-mc-linux64( 0/ 8), 31.526:
pins2lts-mc-linux64( 0/ 8), 31.526: Queue width: 8B, total height: 273355, memory: 2.09MB
pins2lts-mc-linux64( 0/ 8), 31.526: Tree memory: 397.5MB, 22.5 B/state, compr.: 22.9%
pins2lts-mc-linux64( 0/ 8), 31.526: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 31.526: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 31.526: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 31.526: Est. total memory use: 399.6MB (~1026.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14292793079592722737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](<>((X((LTLAPp0==true)) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14292793079592722737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](<>((X((LTLAPp0==true)) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-10 02:44:15] [INFO ] Flatten gal took : 4 ms
[2023-03-10 02:44:15] [INFO ] Time to serialize gal into /tmp/LTLFireability5778408606015525824.gal : 1 ms
[2023-03-10 02:44:15] [INFO ] Time to serialize properties into /tmp/LTLFireability3516282856562116474.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5778408606015525824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3516282856562116474.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(X(G(F((X("((SG>=1)&&(SwG>=1))"))U("(MpA>=1)")))))))
Formula 0 simplified : FG(!"(MpA>=1)" & (!"(MpA>=1)" W !"((SG>=1)&&(SwG>=1))"))
Detected timeout of ITS tools.
[2023-03-10 03:05:04] [INFO ] Flatten gal took : 3 ms
[2023-03-10 03:05:04] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-10 03:05:04] [INFO ] Transformed 23 places.
[2023-03-10 03:05:04] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-10 03:05:04] [INFO ] Time to serialize gal into /tmp/LTLFireability3136202954946391022.gal : 1 ms
[2023-03-10 03:05:04] [INFO ] Time to serialize properties into /tmp/LTLFireability4122113905963101639.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3136202954946391022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4122113905963101639.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(F((X("((SG>=1)&&(SwG>=1))"))U("(MpA>=1)")))))))
Formula 0 simplified : FG(!"(MpA>=1)" & (!"(MpA>=1)" W !"((SG>=1)&&(SwG>=1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12084512 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037268 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N1000P0"
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-5348"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N1000P0, 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 r069-smll-167814396300340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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