Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 6.0K Apr 29 12:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 12:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 12:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 12:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.1K May 10 09:33 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-N0010P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652693912680

Running Version 202205111006
[2022-05-16 09:38:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:38:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:38:33] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2022-05-16 09:38:33] [INFO ] Transformed 25 places.
[2022-05-16 09:38:33] [INFO ] Transformed 18 transitions.
[2022-05-16 09:38:33] [INFO ] Parsed PT model containing 25 places and 18 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Support contains 22 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 8 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-16 09:38:34] [INFO ] Computed 8 place invariants in 7 ms
[2022-05-16 09:38:34] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2022-05-16 09:38:34] [INFO ] Computed 8 place invariants in 4 ms
[2022-05-16 09:38:34] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2022-05-16 09:38:34] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 09:38:34] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
Support contains 22 out of 25 places after structural reductions.
[2022-05-16 09:38:34] [INFO ] Flatten gal took : 16 ms
[2022-05-16 09:38:34] [INFO ] Flatten gal took : 5 ms
[2022-05-16 09:38:34] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 537 steps, including 0 resets, run visited all 19 properties in 37 ms. (steps per millisecond=14 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(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.
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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
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 19 place count 14 transition count 10
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 23 place count 12 transition count 8
Applied a total of 23 rules in 10 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 09:38:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:38:35] [INFO ] Implicit Places using invariants in 28 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/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 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
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 4 place count 8 transition count 6
Applied a total of 4 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 09:38:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:38:35] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 09:38:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:38:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 6/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s2 1), p1:(AND (GEQ s1 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8938 reset in 200 ms.
Product exploration explored 100000 steps with 8865 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 : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 247 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Finished random walk after 127 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 6 factoid took 327 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 09:38:36] [INFO ] Computed 3 place invariants in 0 ms
Proved EG (NOT p0)
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 09:38:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:38:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:36] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 09:38:36] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:38:36] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-00 finished in 2048 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((G(F(X((X(p0)&&F(p1)&&p2))))&&p3)))))'
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 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
[2022-05-16 09:38:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:37] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:38:37] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-16 09:38:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:38:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p3 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(GEQ s6 1), p1:(GEQ s19 1), p2:(GEQ s10 1), p0:(AND (GEQ s2 1) (GEQ s14 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 979 reset in 162 ms.
Product exploration explored 100000 steps with 1043 reset in 164 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 p3) (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 p2))), (X (NOT (AND (NOT p1) p3))), (X (NOT p1)), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 719 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (OR (NOT p2) (NOT p0)), (NOT p0)]
Finished random walk after 1369 steps, including 0 resets, run visited all 8 properties in 13 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 p2))), (X (NOT (AND (NOT p1) p3))), (X (NOT p1)), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F (AND p3 p2)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F p3), (F (AND p3 (NOT p2))), (F (AND p3 (NOT p1))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 17 factoid took 794 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (OR (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (OR (NOT p2) (NOT p0)), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:38:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
Proved EG (NOT p3)
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:38:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 09:38:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:38:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:39] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-16 09:38:39] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 09:38:39] [INFO ] Added : 9 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:38:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:38:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:38:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 09:38:39] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 09:38:39] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:38:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 09:38:39] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 09:38:39] [INFO ] Added : 10 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p3 p2))), (X (NOT (AND (NOT p1) p3))), (X (NOT p1)), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F (AND p3 p2)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F p3), (F (AND p3 (NOT p2))), (F (AND p3 (NOT p1))), (F (AND p2 (NOT p0))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 17 factoid took 408 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-01 finished in 3287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U (p1||(p2 U !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 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:38:40] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:40] [INFO ] Implicit Places using invariants in 31 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 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 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), false]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s10 1), p0:(GEQ s15 1), p2:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15584 steps with 0 reset in 24 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-02 finished in 266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(F(G(X(G(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 1 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 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 26 place count 10 transition count 7
Applied a total of 26 rules in 8 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 09:38:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:40] [INFO ] Implicit Places using invariants in 22 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/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 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 09:38:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 09:38:40] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 09:38:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 09:38:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/25 places, 5/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 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 14 reset in 99 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-03 finished in 217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (G(X(p1))||X((p2 U p3)))))'
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 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
[2022-05-16 09:38:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:40] [INFO ] Implicit Places using invariants in 21 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 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 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p1), p0, (AND (NOT p1) p0), (AND p0 p1 (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p3) p2 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 3}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s6 1), p3:(GEQ s12 1), p2:(LT s18 1), p1:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25162 reset in 99 ms.
Product exploration explored 100000 steps with 25095 reset in 106 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) p2 (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND p0 (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p3) p2 p1))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p3) p2 (NOT p1))), (X (NOT (AND p0 (NOT p3) p2 p1))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) p2 (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 37 factoid took 1733 ms. Reduced automaton from 9 states, 30 edges and 4 AP to 9 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p1), p0, (AND (NOT p1) p0), (AND p0 p1 (NOT p3))]
Incomplete random walk after 10017 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 22) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 09:38:43] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 09:38:43] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) p2 (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND p0 (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p3) p2 p1))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p3) p2 (NOT p1))), (X (NOT (AND p0 (NOT p3) p2 p1))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) p2 (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (G (NOT (AND (NOT p3) (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1))), (G (NOT (AND p2 (NOT p3) (NOT p0) p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p2 (NOT p3) p0 (NOT p1))), (F (AND (NOT p2) (NOT p3) p0 (NOT p1))), (F (AND (NOT p2) (NOT p3) p0 p1)), (F p1), (F (AND p2 (NOT p3) p0 p1)), (F (NOT (AND p2 (NOT p3)))), (F (AND (NOT p2) (NOT p3) p1)), (F (AND (NOT p2) (NOT p3))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p3) (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p3) p1)), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p2 (NOT p3) (NOT p1)))), (F p0), (F (AND (NOT p2) (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 41 factoid took 2156 ms. Reduced automaton from 9 states, 30 edges and 4 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 174 ms :[p0, (OR (NOT p3) p0), (NOT p3), true, (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 171 ms :[p0, (OR (NOT p3) p0), (NOT p3), true, (NOT p3), (NOT p3)]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 09:38:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:38:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 09:38:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:38:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 09:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:46] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:38:46] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:38:46] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 3 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 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 09:38:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:38:46] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 09:38:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:38:46] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 09:38:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:38:46] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [(AND (NOT p0) (NOT p3) p2), (X (AND (NOT p3) (NOT p0) p2)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p3) p0 p2))), (X (X (AND (NOT p3) (NOT p0) p2))), true, (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 652 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 182 ms :[p0, (OR (NOT p3) p0), (NOT p3), true, (NOT p3), (NOT p3)]
Finished random walk after 1485 steps, including 2 resets, run visited all 9 properties in 11 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2), (X (AND (NOT p3) (NOT p0) p2)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p3) p0 p2))), (X (X (AND (NOT p3) (NOT p0) p2))), true, (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) p2))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p3) (NOT p2) p0)), (F (AND (NOT p3) (NOT p2) (NOT p0))), (F p0), (F (NOT (AND (NOT p3) (NOT p0)))), (F (AND p3 (NOT p0))), (F (NOT (AND (NOT p3) p2 (NOT p0)))), (F (AND (NOT p3) p2 p0))]
Knowledge based reduction with 15 factoid took 668 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 211 ms :[p0, (OR (NOT p3) p0), (NOT p3), true, (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 179 ms :[p0, (OR (NOT p3) p0), (NOT p3), true, (NOT p3), (NOT p3)]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 09:38:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:38:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:38:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:38:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 09:38:48] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:38:48] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 183 ms :[p0, (OR (NOT p3) p0), (NOT p3), true, (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 7471 reset in 100 ms.
Product exploration explored 100000 steps with 7495 reset in 104 ms.
Applying partial POR strategy [true, true, false, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[p0, (OR (NOT p3) p0), (NOT p3), true, (NOT p3), (NOT p3)]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 20 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 20 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 18 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 18 transition count 16
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 18 transition count 16
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 15 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 15 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 21 rules in 11 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2022-05-16 09:38:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2022-05-16 09:38:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 09:38:49] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 13/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 19088 reset in 147 ms.
Product exploration explored 100000 steps with 19020 reset in 147 ms.
Built C files in :
/tmp/ltsmin9036279622869353745
[2022-05-16 09:38:49] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9036279622869353745
Running compilation step : cd /tmp/ltsmin9036279622869353745;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 173 ms.
Running link step : cd /tmp/ltsmin9036279622869353745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9036279622869353745;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11582275306550405759.hoa' '--buchi-type=spotba'
LTSmin run took 1776 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-04 finished in 10801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))&&F(p2)))'
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 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 09:38:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:38:51] [INFO ] Implicit Places using invariants in 25 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s11 1) (GEQ s16 1)), p0:(GEQ s10 1), p1:(AND (GEQ s8 1) (GEQ s14 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 14140 reset in 141 ms.
Product exploration explored 100000 steps with 13964 reset in 101 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p1), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Finished random walk after 166 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=166 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X p1), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p2)]
Knowledge based reduction with 6 factoid took 289 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:38:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 09:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 09:38:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:38:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 09:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-16 09:38:52] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:38:52] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 21 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 : 21/21 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 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 19 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 18 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 18 transition count 11
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 14 place count 14 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 3 with 2 rules applied. Total rules applied 16 place count 13 transition count 10
Applied a total of 16 rules in 3 ms. Remains 13 /21 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 09:38:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:52] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 09:38:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 09:38:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 09:38:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/21 places, 10/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/21 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 p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p2)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 09:38:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 09:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:38:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:38:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 09:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 09:38:53] [INFO ] Computed and/alt/rep : 9/10/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:38:53] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Product exploration explored 100000 steps with 10225 reset in 60 ms.
Product exploration explored 100000 steps with 10199 reset in 58 ms.
Built C files in :
/tmp/ltsmin18228796346907467470
[2022-05-16 09:38:53] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2022-05-16 09:38:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:38:53] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2022-05-16 09:38:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:38:53] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2022-05-16 09:38:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:38:53] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18228796346907467470
Running compilation step : cd /tmp/ltsmin18228796346907467470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin18228796346907467470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18228796346907467470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11554797524476608956.hoa' '--buchi-type=spotba'
LTSmin run took 159 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-05 finished in 2160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(X((X(p0)||G(p1))))))))'
Support contains 2 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
[2022-05-16 09:38:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:53] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 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 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(GEQ s16 1), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-06 finished in 356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 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
[2022-05-16 09:38:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:54] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 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 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Product exploration explored 100000 steps with 50000 reset in 74 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 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 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-07 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||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 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 09:38:54] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:38:54] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s4 1) (LT s18 1)), p1:(AND (GEQ s7 1) (GEQ s20 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 106 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-08 finished in 187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(p0) U X(p1)) U (F(p2) U p3)))'
Support contains 6 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 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 09:38:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:38:54] [INFO ] Implicit Places using invariants in 24 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 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 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p3), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (NOT p2), (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(NOT p3), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(GEQ s16 1), p2:(AND (GEQ s5 1) (GEQ s14 1)), p0:(GEQ s18 1), p1:(OR (AND (GEQ s7 1) (GEQ s19 1)) (GEQ s16 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 39919 reset in 73 ms.
Product exploration explored 100000 steps with 39952 reset in 73 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 p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) p1))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 596 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p3), (AND p1 (NOT p2)), (NOT p2), (NOT p3)]
Finished random walk after 397 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=198 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) p1))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 (NOT p3))), (F p2), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p1 (NOT p3) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F p3), (F (NOT (AND (NOT p3) (NOT p2))))]
Knowledge based reduction with 14 factoid took 800 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 289 ms :[(NOT p3), (AND p1 (NOT p2)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p3), (AND p1 (NOT p2)), (NOT p2), (NOT p3)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:38:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:57] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 09:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 09:38:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:38:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 09:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:57] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 09:38:57] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 09:38:57] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 6 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 14 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 14 transition count 9
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 18 place count 12 transition count 9
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 20 place count 11 transition count 8
Applied a total of 20 rules in 3 ms. Remains 11 /21 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 09:38:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:38:57] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 09:38:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 09:38:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 09:38:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:57] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/21 places, 8/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/21 places, 8/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 p3) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p1 (NOT p3)))), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 694 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 151 ms :[(NOT p3), (AND p1 (NOT p2)), (NOT p2), (NOT p3)]
Finished random walk after 166 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p1 (NOT p3)))), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 (NOT p3))), (F p2), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p1 (NOT p3) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F p3), (F (NOT (AND (NOT p3) (NOT p2))))]
Knowledge based reduction with 19 factoid took 1108 ms. Reduced automaton from 4 states, 9 edges and 4 AP to 4 states, 9 edges and 4 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p3), (AND p1 (NOT p2)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p3), (AND p1 (NOT p2)), (NOT p2), (NOT p3)]
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 09:38:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:38:59] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-16 09:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:38:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 09:38:59] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 09:38:59] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 149 ms :[(NOT p3), (AND p1 (NOT p2)), (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 29407 reset in 90 ms.
Product exploration explored 100000 steps with 29385 reset in 104 ms.
Built C files in :
/tmp/ltsmin1102931674749753759
[2022-05-16 09:38:59] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-16 09:38:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:38:59] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-16 09:38:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:38:59] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-16 09:38:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:38:59] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1102931674749753759
Running compilation step : cd /tmp/ltsmin1102931674749753759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin1102931674749753759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1102931674749753759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11192598312029206536.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-09 finished in 5453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(X(X(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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 3 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 3 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 3 with 6 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 5 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-16 09:39:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:39:00] [INFO ] Implicit Places using invariants in 24 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 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
Applied a total of 4 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 09:39:00] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:39:00] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 09:39:00] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:39:00] [INFO ] Implicit Places using invariants and state equation in 32 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 : 10/25 places, 7/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-10 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 s5 1) (AND (GEQ s2 1) (GEQ s8 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 6911 reset in 69 ms.
Product exploration explored 100000 steps with 6986 reset in 72 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 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 09:39:00] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:39:00] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 09:39:00] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:39:00] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 09:39:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 09:39:00] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:39:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6696 reset in 68 ms.
Product exploration explored 100000 steps with 6900 reset in 74 ms.
Built C files in :
/tmp/ltsmin18162890669519845293
[2022-05-16 09:39:01] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-16 09:39:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:39:01] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-16 09:39:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:39:01] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-16 09:39:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:39:01] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18162890669519845293
Running compilation step : cd /tmp/ltsmin18162890669519845293;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin18162890669519845293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18162890669519845293;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7197239664538441955.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 09:39:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:39:16] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 09:39:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:39:16] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-16 09:39:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 09:39:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:39:16] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin14750109649315575521
[2022-05-16 09:39:16] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-16 09:39:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:39:16] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-16 09:39:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:39:16] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-16 09:39:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:39:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14750109649315575521
Running compilation step : cd /tmp/ltsmin14750109649315575521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 75 ms.
Running link step : cd /tmp/ltsmin14750109649315575521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14750109649315575521;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18393620818383056926.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 09:39:31] [INFO ] Flatten gal took : 4 ms
[2022-05-16 09:39:31] [INFO ] Flatten gal took : 11 ms
[2022-05-16 09:39:31] [INFO ] Time to serialize gal into /tmp/LTL11255231231011994859.gal : 1 ms
[2022-05-16 09:39:31] [INFO ] Time to serialize properties into /tmp/LTL14576926820734537738.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11255231231011994859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14576926820734537738.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1125523...268
Read 1 LTL properties
Checking formula 0 : !((G(F(F(X(X("((MpG<1)||((CG>=1)&&(CwG>=1)))")))))))
Formula 0 simplified : !GFXX"((MpG<1)||((CG>=1)&&(CwG>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2022-05-16 09:39:46] [INFO ] Flatten gal took : 1 ms
[2022-05-16 09:39:46] [INFO ] Applying decomposition
[2022-05-16 09:39:46] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2132385209254011125.txt' '-o' '/tmp/graph2132385209254011125.bin' '-w' '/tmp/graph2132385209254011125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2132385209254011125.bin' '-l' '-1' '-v' '-w' '/tmp/graph2132385209254011125.weights' '-q' '0' '-e' '0.001'
[2022-05-16 09:39:47] [INFO ] Decomposing Gal with order
[2022-05-16 09:39:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 09:39:47] [INFO ] Flatten gal took : 35 ms
[2022-05-16 09:39:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 09:39:47] [INFO ] Time to serialize gal into /tmp/LTL1781493326186276983.gal : 1 ms
[2022-05-16 09:39:47] [INFO ] Time to serialize properties into /tmp/LTL13965877941282954268.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1781493326186276983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13965877941282954268.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1781493...246
Read 1 LTL properties
Checking formula 0 : !((G(F(F(X(X("((u1.MpG<1)||((u0.CG>=1)&&(u0.CwG>=1)))")))))))
Formula 0 simplified : !GFXX"((u1.MpG<1)||((u0.CG>=1)&&(u0.CwG>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13652276391295644200
[2022-05-16 09:40:02] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13652276391295644200
Running compilation step : cd /tmp/ltsmin13652276391295644200;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 67 ms.
Running link step : cd /tmp/ltsmin13652276391295644200;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13652276391295644200;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(<>(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-10 finished in 77125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!X(X(F(X((X(p0)||p1)))))))))'
Support contains 2 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
[2022-05-16 09:40:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:17] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 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 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR p1 p0), (OR p1 p0), true, (OR p1 p0), (OR p0 p1), (OR p0 p1), (OR p0 p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 2}]], initial=1, aps=[p0:(GEQ s18 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-11 finished in 291 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 4 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 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 9 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 11 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 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 3 with 6 rules applied. Total rules applied 17 place count 15 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 21 place count 13 transition count 9
Applied a total of 21 rules in 6 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-16 09:40:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:40:17] [INFO ] Implicit Places using invariants in 22 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s8 1)), p1:(AND (GEQ s1 1) (GEQ s11 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 3666 reset in 106 ms.
Product exploration explored 100000 steps with 3668 reset in 103 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)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 22 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 22 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 09:40:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:18] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 09:40:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:18] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-16 09:40:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 09:40:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:18] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 9/9 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 p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 22 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3651 reset in 102 ms.
Product exploration explored 100000 steps with 3706 reset in 101 ms.
Built C files in :
/tmp/ltsmin8313824087812101653
[2022-05-16 09:40:18] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2022-05-16 09:40:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:40:18] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2022-05-16 09:40:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:40:18] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2022-05-16 09:40:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:40:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8313824087812101653
Running compilation step : cd /tmp/ltsmin8313824087812101653;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 68 ms.
Running link step : cd /tmp/ltsmin8313824087812101653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8313824087812101653;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5661085935835805371.hoa' '--buchi-type=spotba'
LTSmin run took 7398 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-12 finished in 9018 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!(!F(p0) U F(p1))) U X((G(p0) U p0))))'
Support contains 2 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
[2022-05-16 09:40:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:26] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 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 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), true, p1]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s6 1), p0:(GEQ s9 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-13 finished in 217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(G(p0))))&&F((X(p1)&&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 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:40:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:26] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:40:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:40:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:26] [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 1 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p1:(GEQ s6 1), p0:(OR (LT s2 1) (LT s14 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 8 reset in 133 ms.
Stack based approach found an accepted trace after 11143 steps with 7 reset with depth 2988 and stack size 2988 in 17 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-14 finished in 360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p0)))'
Support contains 2 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
[2022-05-16 09:40:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 09:40:27] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:40:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:27] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 09:40:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 09:40:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLFireability-15 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 (GEQ s2 1) (GEQ s14 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 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLFireability-15 finished in 189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(X(X(p0))))))'
[2022-05-16 09:40:27] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9109922975869663377
[2022-05-16 09:40:27] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-16 09:40:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:40:27] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-16 09:40:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:40:27] [INFO ] Applying decomposition
[2022-05-16 09:40:27] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-16 09:40:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:40:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9109922975869663377
[2022-05-16 09:40:27] [INFO ] Flatten gal took : 2 ms
Running compilation step : cd /tmp/ltsmin9109922975869663377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6515571473283563420.txt' '-o' '/tmp/graph6515571473283563420.bin' '-w' '/tmp/graph6515571473283563420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6515571473283563420.bin' '-l' '-1' '-v' '-w' '/tmp/graph6515571473283563420.weights' '-q' '0' '-e' '0.001'
[2022-05-16 09:40:27] [INFO ] Decomposing Gal with order
[2022-05-16 09:40:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 09:40:27] [INFO ] Removed a total of 2 redundant transitions.
[2022-05-16 09:40:27] [INFO ] Flatten gal took : 4 ms
[2022-05-16 09:40:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 09:40:27] [INFO ] Time to serialize gal into /tmp/LTLFireability6390995524429440106.gal : 1 ms
[2022-05-16 09:40:27] [INFO ] Time to serialize properties into /tmp/LTLFireability3694510709340259092.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6390995524429440106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3694510709340259092.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((G(F(F(X(X("((i1.u4.MpG<1)||((i0.u6.CG>=1)&&(i3.u9.CwG>=1)))")))))))
Formula 0 simplified : !GFXX"((i1.u4.MpG<1)||((i0.u6.CG>=1)&&(i3.u9.CwG>=1)))"
Compilation finished in 99 ms.
Running link step : cd /tmp/ltsmin9109922975869663377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin9109922975869663377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(<>(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: [](<>(<>(X(X((LTLAPp0==true))))))
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: "[](<>(<>(X(X((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 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( 0/ 8), 0.010: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.048: DFS-FIFO for weak LTL, using special progress label 20
pins2lts-mc-linux64( 0/ 8), 0.048: There are 21 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.048: State length is 26, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.048: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.048: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.048: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.048: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.080: ~74 levels ~960 states ~2968 transitions
pins2lts-mc-linux64( 1/ 8), 0.113: ~168 levels ~1920 states ~7144 transitions
pins2lts-mc-linux64( 1/ 8), 0.133: ~195 levels ~3840 states ~9432 transitions
pins2lts-mc-linux64( 1/ 8), 0.157: ~195 levels ~7680 states ~15656 transitions
pins2lts-mc-linux64( 1/ 8), 0.207: ~195 levels ~15360 states ~32000 transitions
pins2lts-mc-linux64( 0/ 8), 0.303: ~189 levels ~30720 states ~71064 transitions
pins2lts-mc-linux64( 1/ 8), 0.452: ~195 levels ~61440 states ~126832 transitions
pins2lts-mc-linux64( 1/ 8), 0.770: ~195 levels ~122880 states ~272536 transitions
pins2lts-mc-linux64( 5/ 8), 1.114: ~182 levels ~245760 states ~583600 transitions
pins2lts-mc-linux64( 5/ 8), 1.859: ~182 levels ~491520 states ~1197520 transitions
pins2lts-mc-linux64( 7/ 8), 2.744: ~184 levels ~983040 states ~2426504 transitions
pins2lts-mc-linux64( 7/ 8), 3.683: ~184 levels ~1966080 states ~4856824 transitions
pins2lts-mc-linux64( 7/ 8), 5.435: ~184 levels ~3932160 states ~10161016 transitions
pins2lts-mc-linux64( 5/ 8), 9.705: ~182 levels ~7864320 states ~24167872 transitions
pins2lts-mc-linux64( 1/ 8), 16.264: ~195 levels ~15728640 states ~42897304 transitions
pins2lts-mc-linux64( 1/ 8), 30.458: ~195 levels ~31457280 states ~89618200 transitions
pins2lts-mc-linux64( 1/ 8), 63.966: ~195 levels ~62914560 states ~203132200 transitions
pins2lts-mc-linux64( 4/ 8), 107.460: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 107.494:
pins2lts-mc-linux64( 0/ 8), 107.494: mean standard work distribution: 67.5% (states) 66.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 107.494:
pins2lts-mc-linux64( 0/ 8), 107.494: Explored 55860482 states 195300417 transitions, fanout: 3.496
pins2lts-mc-linux64( 0/ 8), 107.494: Total exploration time 107.430 sec (107.370 sec minimum, 107.399 sec on average)
pins2lts-mc-linux64( 0/ 8), 107.494: States per second: 519971, Transitions per second: 1817932
pins2lts-mc-linux64( 0/ 8), 107.494:
pins2lts-mc-linux64( 0/ 8), 107.494: Progress states detected: 3045
pins2lts-mc-linux64( 0/ 8), 107.494: Redundant explorations: 0.4711
pins2lts-mc-linux64( 0/ 8), 107.494:
pins2lts-mc-linux64( 0/ 8), 107.494: Queue width: 8B, total height: 2916, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 107.495: Tree memory: 680.2MB, 12.8 B/state, compr.: 12.1%
pins2lts-mc-linux64( 0/ 8), 107.495: Tree fill ratio (roots/leafs): 41.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 107.495: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 107.495: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 107.495: Est. total memory use: 680.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9109922975869663377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(<>(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9109922975869663377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(<>(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 10:01:04] [INFO ] Flatten gal took : 4 ms
[2022-05-16 10:01:04] [INFO ] Time to serialize gal into /tmp/LTLFireability703648169947578727.gal : 1 ms
[2022-05-16 10:01:04] [INFO ] Time to serialize properties into /tmp/LTLFireability11100561505734968071.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability703648169947578727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11100561505734968071.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((G(F(F(X(X("((MpG<1)||((CG>=1)&&(CwG>=1)))")))))))
Formula 0 simplified : !GFXX"((MpG<1)||((CG>=1)&&(CwG>=1)))"
Detected timeout of ITS tools.
[2022-05-16 10:21:41] [INFO ] Flatten gal took : 5 ms
[2022-05-16 10:21:41] [INFO ] Input system was already deterministic with 18 transitions.
[2022-05-16 10:21:41] [INFO ] Transformed 25 places.
[2022-05-16 10:21:41] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-16 10:21:41] [INFO ] Time to serialize gal into /tmp/LTLFireability4813012965272181650.gal : 1 ms
[2022-05-16 10:21:41] [INFO ] Time to serialize properties into /tmp/LTLFireability15214195463554966302.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4813012965272181650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15214195463554966302.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(F(X(X("((MpG<1)||((CG>=1)&&(CwG>=1)))")))))))
Formula 0 simplified : !GFXX"((MpG<1)||((CG>=1)&&(CwG>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0010P0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0010P0, 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 r024-tall-165251919000812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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