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-167814396100228.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-N0005P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396100228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:26 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.8K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 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-N0005P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0005P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678321697757

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-N0005P0
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 00:28:21] [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-09 00:28:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 00:28:21] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-09 00:28:21] [INFO ] Transformed 25 places.
[2023-03-09 00:28:21] [INFO ] Transformed 18 transitions.
[2023-03-09 00:28:21] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 19 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 00:28:21] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 00:28:22] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-09 00:28:22] [INFO ] Invariant cache hit.
[2023-03-09 00:28:22] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-09 00:28:22] [INFO ] Invariant cache hit.
[2023-03-09 00:28:22] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 20 out of 25 places after structural reductions.
[2023-03-09 00:28:22] [INFO ] Flatten gal took : 34 ms
[2023-03-09 00:28:22] [INFO ] Flatten gal took : 10 ms
[2023-03-09 00:28:22] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 306 steps, including 0 resets, run visited all 15 properties in 54 ms. (steps per millisecond=5 )
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(p1)||p0)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 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 22 transition count 18
Applied a total of 3 rules in 3 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 00:28:23] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 00:28:23] [INFO ] Implicit Places using invariants in 42 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 358 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s13 1)), p0:(OR (AND (LT s16 1) (GEQ s16 1)) (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, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-00 finished in 501 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(p0))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 16 transition count 11
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 17 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 18 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-09 00:28:23] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 00:28:23] [INFO ] Implicit Places using invariants in 58 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 8/18 transitions.
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 2 rules applied. Total rules applied 2 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 8 transition count 5
Applied a total of 6 rules in 3 ms. Remains 8 /11 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-09 00:28:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 00:28:23] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 00:28:23] [INFO ] Invariant cache hit.
[2023-03-09 00:28:23] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 8/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15103 reset in 495 ms.
Product exploration explored 100000 steps with 15096 reset in 283 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 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 44 ms :[(NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 197 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 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-09 00:28:25] [INFO ] Invariant cache hit.
[2023-03-09 00:28:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 00:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:28:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 00:28:25] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 00:28:25] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-09 00:28:25] [INFO ] Invariant cache hit.
[2023-03-09 00:28:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 00:28:25] [INFO ] Invariant cache hit.
[2023-03-09 00:28:25] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-09 00:28:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:28:25] [INFO ] Invariant cache hit.
[2023-03-09 00:28:25] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 8/8 places, 5/5 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 :[(NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 134 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-09 00:28:25] [INFO ] Invariant cache hit.
[2023-03-09 00:28:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 00:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:28:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-09 00:28:25] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 00:28:25] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15154 reset in 281 ms.
Product exploration explored 100000 steps with 15043 reset in 225 ms.
Built C files in :
/tmp/ltsmin13485830002878737684
[2023-03-09 00:28:26] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2023-03-09 00:28:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 00:28:26] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2023-03-09 00:28:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 00:28:26] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2023-03-09 00:28:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 00:28:26] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13485830002878737684
Running compilation step : cd /tmp/ltsmin13485830002878737684;'/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 303 ms.
Running link step : cd /tmp/ltsmin13485830002878737684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin13485830002878737684;'/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/stateBased8275825010404001445.hoa' '--buchi-type=spotba'
LTSmin run took 136 ms.
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-01 finished in 3300 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(F(p0))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 00:28:26] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 00:28:26] [INFO ] Implicit Places using invariants in 42 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 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.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Product exploration explored 100000 steps with 33333 reset in 111 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-02 finished in 513 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(!(p0 U p1))&&(p0 U X(G(F(p0))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 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 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 15 transition count 11
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 2 with 2 rules applied. Total rules applied 19 place count 14 transition count 10
Applied a total of 19 rules in 11 ms. Remains 14 /25 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-09 00:28:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 00:28:27] [INFO ] Implicit Places using invariants in 49 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/25 places, 10/18 transitions.
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 2 rules applied. Total rules applied 2 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 11 transition count 7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 10 transition count 7
Applied a total of 6 rules in 5 ms. Remains 10 /13 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-09 00:28:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 00:28:27] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 00:28:27] [INFO ] Invariant cache hit.
[2023-03-09 00:28:27] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 10/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) p1), p1, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s2 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 13939 reset in 134 ms.
Stuttering criterion allowed to conclude after 79981 steps with 11450 reset in 247 ms.
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-04 finished in 790 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(p0)||X(F(p1))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 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 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 00:28:28] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 00:28:28] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 00:28:28] [INFO ] Invariant cache hit.
[2023-03-09 00:28:28] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-09 00:28:28] [INFO ] Invariant cache hit.
[2023-03-09 00:28:28] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s7 1) (GEQ s20 1)), p0:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3719 reset in 214 ms.
Product exploration explored 100000 steps with 3716 reset in 318 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 (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 362 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Finished random walk after 108 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 387 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 45 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
[2023-03-09 00:28:29] [INFO ] Invariant cache hit.
[2023-03-09 00:28:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 00:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:28:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-09 00:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:28:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 00:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:28:30] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-09 00:28:30] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 00:28:30] [INFO ] Added : 9 causal constraints over 2 iterations in 29 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 22 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 : 22/22 places, 18/18 transitions.
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 2 rules applied. Total rules applied 2 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 18 transition count 12
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 12 place count 16 transition count 12
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 16 place count 14 transition count 10
Applied a total of 16 rules in 11 ms. Remains 14 /22 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-09 00:28:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 00:28:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 00:28:30] [INFO ] Invariant cache hit.
[2023-03-09 00:28:30] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-09 00:28:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 00:28:30] [INFO ] Invariant cache hit.
[2023-03-09 00:28:30] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 10/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 14/22 places, 10/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), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 43 ms :[(NOT p1)]
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 180 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 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
[2023-03-09 00:28:30] [INFO ] Invariant cache hit.
[2023-03-09 00:28:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 00:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:28:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-09 00:28:30] [INFO ] Computed and/alt/rep : 9/10/9 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 00:28:30] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7484 reset in 135 ms.
Product exploration explored 100000 steps with 7467 reset in 161 ms.
Built C files in :
/tmp/ltsmin9601998965921338436
[2023-03-09 00:28:31] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2023-03-09 00:28:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 00:28:31] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2023-03-09 00:28:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 00:28:31] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2023-03-09 00:28:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 00:28:31] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9601998965921338436
Running compilation step : cd /tmp/ltsmin9601998965921338436;'/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 150 ms.
Running link step : cd /tmp/ltsmin9601998965921338436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9601998965921338436;'/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/stateBased14200964464945499655.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-06 finished in 3457 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 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 9 transition count 6
Applied a total of 28 rules in 8 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-09 00:28:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 00:28:31] [INFO ] Implicit Places using invariants in 47 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 6/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 4 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-09 00:28:31] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 00:28:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 00:28:31] [INFO ] Invariant cache hit.
[2023-03-09 00:28:31] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-08 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:(GEQ s1 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 13814 reset in 123 ms.
Product exploration explored 100000 steps with 13825 reset in 132 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 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 94 ms :[(NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 185 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2023-03-09 00:28:32] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-08 finished in 1287 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((X(X(p0)) U (p1&&X((p2&&F(p0)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 00:28:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 00:28:32] [INFO ] Implicit Places using invariants in 39 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=true, acceptance={0} 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=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s19 1), p2:(GEQ s10 1), p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-10 finished in 383 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((p0||G(p1))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 10 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-09 00:28:33] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 00:28:33] [INFO ] Implicit Places using invariants in 38 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 9/18 transitions.
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 2 rules applied. Total rules applied 2 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 6
Applied a total of 6 rules in 5 ms. Remains 9 /12 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-09 00:28:33] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 00:28:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 00:28:33] [INFO ] Invariant cache hit.
[2023-03-09 00:28:33] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s6 1), p0:(AND (GEQ s2 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15096 reset in 123 ms.
Product exploration explored 100000 steps with 15126 reset in 158 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 (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 314 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-09 00:28:34] [INFO ] Invariant cache hit.
[2023-03-09 00:28:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 00:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:28:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 00:28:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:28:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 00:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:28:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-09 00:28:34] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 00:28:34] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-09 00:28:34] [INFO ] Invariant cache hit.
[2023-03-09 00:28:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 00:28:34] [INFO ] Invariant cache hit.
[2023-03-09 00:28:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-09 00:28:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:28:34] [INFO ] Invariant cache hit.
[2023-03-09 00:28:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 9/9 places, 6/6 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 p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 117 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 278 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-09 00:28:35] [INFO ] Invariant cache hit.
[2023-03-09 00:28:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:28:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 00:28:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:28:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:28:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 00:28:35] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 00:28:35] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15167 reset in 84 ms.
Product exploration explored 100000 steps with 15202 reset in 89 ms.
Built C files in :
/tmp/ltsmin12736253287070418275
[2023-03-09 00:28:35] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2023-03-09 00:28:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 00:28:35] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2023-03-09 00:28:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 00:28:35] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2023-03-09 00:28:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 00:28:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12736253287070418275
Running compilation step : cd /tmp/ltsmin12736253287070418275;'/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 133 ms.
Running link step : cd /tmp/ltsmin12736253287070418275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12736253287070418275;'/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/stateBased9859697304308295156.hoa' '--buchi-type=spotba'
LTSmin run took 99 ms.
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-11 finished in 2622 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)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 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 22 transition count 18
Applied a total of 3 rules in 0 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 00:28:35] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-09 00:28:35] [INFO ] Implicit Places using invariants in 41 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-12 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 s19 1) (OR (LT s11 1) (LT s16 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 26 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-12 finished in 173 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(F(!p0))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 00:28:36] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 00:28:36] [INFO ] Implicit Places using invariants in 59 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 55 ms.
Product exploration explored 100000 steps with 33333 reset in 66 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 (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-13 finished in 501 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((p0&&F(G(p1))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-09 00:28:36] [INFO ] Invariant cache hit.
[2023-03-09 00:28:36] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 00:28:36] [INFO ] Invariant cache hit.
[2023-03-09 00:28:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-09 00:28:36] [INFO ] Invariant cache hit.
[2023-03-09 00:28:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s16 1) (AND (GEQ s2 1) (GEQ s14 1))), p1:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P0-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P0-LTLFireability-15 finished in 356 ms.
All properties solved by simple procedures.
Total runtime 15597 ms.

BK_STOP 1678321717922

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

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