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-165251919200924.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-N5000P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251919200924
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.4K Apr 29 12:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 29 12:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 12:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 12:29 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:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:16 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.2K 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-N5000P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652719359916

Running Version 202205111006
[2022-05-16 16:42:41] [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 16:42:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:42:41] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-05-16 16:42:41] [INFO ] Transformed 25 places.
[2022-05-16 16:42:41] [INFO ] Transformed 18 transitions.
[2022-05-16 16:42:41] [INFO ] Parsed PT model containing 25 places and 18 transitions in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 12 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 16:42:41] [INFO ] Computed 7 place invariants in 9 ms
[2022-05-16 16:42:41] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 16:42:41] [INFO ] Computed 7 place invariants in 18 ms
[2022-05-16 16:42:41] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 16:42:41] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-16 16:42:41] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
Support contains 22 out of 24 places after structural reductions.
[2022-05-16 16:42:41] [INFO ] Flatten gal took : 17 ms
[2022-05-16 16:42:41] [INFO ] Flatten gal took : 5 ms
[2022-05-16 16:42:41] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 40001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=833 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 16:42:41] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 16:42:41] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:42:41] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 16:42:42] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:42:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:42:42] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:42] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 16:42:42] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 16:42:42] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 170000 steps, including 0 resets, run visited all 1 properties in 370 ms. (steps per millisecond=459 )
Parikh walk visited 1 properties in 371 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:42:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 16:42:42] [INFO ] Implicit Places using invariants in 32 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s13 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 205 ms.
Product exploration explored 100000 steps with 50000 reset in 131 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-00 finished in 792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&F(p1)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:42:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:42:43] [INFO ] Implicit Places using invariants in 26 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s6 1), p0:(GEQ s9 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1807 reset in 229 ms.
Product exploration explored 100000 steps with 1806 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=3077 ) properties (out of 2) seen :0
Finished Best-First random walk after 344 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:42:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 16:42:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 16:42:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 16:42:44] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:42:44] [INFO ] Added : 12 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:42:44] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-16 16:42:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-01 finished in 1542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!G(p0)) U G(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 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 15 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 10 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 16:42:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:42:45] [INFO ] Implicit Places using invariants in 26 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/24 places, 6/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 1 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 16:42:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 16:42:45] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 16:42:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 16:42:45] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/24 places, 4/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-02 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}]], initial=1, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-02 finished in 142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (F(p1) U X(p0))))||X(G(F(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:42:45] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 16:42:45] [INFO ] Implicit Places using invariants in 43 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p0:(GEQ s10 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 1110 reset in 137 ms.
Product exploration explored 100000 steps with 1109 reset in 135 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 412 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=2666 ) properties (out of 3) seen :0
Finished Best-First random walk after 448 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=149 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:42:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:42:47] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2022-05-16 16:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:47] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:42:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 16:42:47] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 16:42:47] [INFO ] Added : 15 causal constraints over 3 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:42:47] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:42:47] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:42:47] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:42:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:42:47] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:42:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=4000 ) properties (out of 3) seen :0
Finished Best-First random walk after 661 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=220 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:42:48] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 16:42:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:42:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 16:42:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 16:42:48] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 16:42:48] [INFO ] Added : 15 causal constraints over 3 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1077 reset in 107 ms.
Product exploration explored 100000 steps with 1080 reset in 224 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 11 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2022-05-16 16:42:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2022-05-16 16:42:49] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:42:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 14/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/21 places, 14/18 transitions.
Product exploration explored 100000 steps with 3626 reset in 119 ms.
Product exploration explored 100000 steps with 3658 reset in 129 ms.
Built C files in :
/tmp/ltsmin11291111390046826161
[2022-05-16 16:42:49] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11291111390046826161
Running compilation step : cd /tmp/ltsmin11291111390046826161;'/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 178 ms.
Running link step : cd /tmp/ltsmin11291111390046826161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11291111390046826161;'/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/stateBased12308522148067106396.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:43:04] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:04] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:43:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:43:04] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin93097894270110221
[2022-05-16 16:43:04] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin93097894270110221
Running compilation step : cd /tmp/ltsmin93097894270110221;'/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 103 ms.
Running link step : cd /tmp/ltsmin93097894270110221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin93097894270110221;'/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/stateBased6328536100702895331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:43:19] [INFO ] Flatten gal took : 11 ms
[2022-05-16 16:43:19] [INFO ] Flatten gal took : 3 ms
[2022-05-16 16:43:19] [INFO ] Time to serialize gal into /tmp/LTL4951553219318345923.gal : 1 ms
[2022-05-16 16:43:19] [INFO ] Time to serialize properties into /tmp/LTL6730142373710526825.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/LTL4951553219318345923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6730142373710526825.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/LTL4951553...266
Read 1 LTL properties
Checking formula 0 : !(((X(("(MtF>=1)")U((F("((CA>=1)&&(CwA>=1))"))U(X("(MtF>=1)")))))||(X(G(F("((CA>=1)&&(CwA>=1))"))))))
Formula 0 simplified : !(X("(MtF>=1)" U (F"((CA>=1)&&(CwA>=1))" U X"(MtF>=1)")) | XGF"((CA>=1)&&(CwA>=1))")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 16:43:19] [INFO ] Flatten gal took : 5 ms
[2022-05-16 16:43:19] [INFO ] Applying decomposition
[2022-05-16 16:43:19] [INFO ] Flatten gal took : 1 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/graph12444801921416706097.txt' '-o' '/tmp/graph12444801921416706097.bin' '-w' '/tmp/graph12444801921416706097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12444801921416706097.bin' '-l' '-1' '-v' '-w' '/tmp/graph12444801921416706097.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:43:19] [INFO ] Decomposing Gal with order
[2022-05-16 16:43:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:43:19] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 16:43:19] [INFO ] Flatten gal took : 27 ms
[2022-05-16 16:43:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 16:43:19] [INFO ] Time to serialize gal into /tmp/LTL5498653910389834558.gal : 1 ms
[2022-05-16 16:43:19] [INFO ] Time to serialize properties into /tmp/LTL12167134264104196122.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/LTL5498653910389834558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12167134264104196122.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/LTL5498653...246
Read 1 LTL properties
Checking formula 0 : !(((X(("(u0.MtF>=1)")U((F("((u3.CA>=1)&&(u2.CwA>=1))"))U(X("(u0.MtF>=1)")))))||(X(G(F("((u3.CA>=1)&&(u2.CwA>=1))"))))))
Formula 0 simplified : !(X("(u0.MtF>=1)" U (F"((u3.CA>=1)&&(u2.CwA>=1))" U X"(u0.MtF>=1)")) | XGF"((u3.CA>=1)&&(u2.CwA>=1))")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin9141711816656583568
[2022-05-16 16:43:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9141711816656583568
Running compilation step : cd /tmp/ltsmin9141711816656583568;'/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 195 ms.
Running link step : cd /tmp/ltsmin9141711816656583568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin9141711816656583568;'/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(((LTLAPp0==true) U (<>((LTLAPp1==true)) U X((LTLAPp0==true)))))||X([](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-03 finished in 49712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||!((F(p1)&&X(p1)) U (G(p2) U p2)))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:43:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 16:43:34] [INFO ] Implicit Places using invariants in 30 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 : 22/24 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/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s20 1)), p2:(AND (GEQ s1 1) (GEQ s17 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 97 ms.
Product exploration explored 100000 steps with 33333 reset in 80 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 p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p2 p1))))
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-06 finished in 514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:43:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:43:35] [INFO ] Implicit Places using invariants in 25 ms returned [20]
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/24 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/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15146 reset in 60 ms.
Product exploration explored 100000 steps with 15171 reset in 61 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=2353 ) properties (out of 1) seen :0
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:43:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:43:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 16:43:36] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 16:43:36] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:43:36] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:36] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-16 16:43:36] [INFO ] Implicit Places using invariants and state equation in 33 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 16:43:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:43:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:43:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 16:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:43:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 16:43:36] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 16:43:36] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15090 reset in 58 ms.
Product exploration explored 100000 steps with 15154 reset in 60 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
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 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 6 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2022-05-16 16:43:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2022-05-16 16:43:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:43:37] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 16/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 17227 reset in 88 ms.
Product exploration explored 100000 steps with 17234 reset in 96 ms.
Built C files in :
/tmp/ltsmin7858025823450989451
[2022-05-16 16:43:37] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7858025823450989451
Running compilation step : cd /tmp/ltsmin7858025823450989451;'/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 79 ms.
Running link step : cd /tmp/ltsmin7858025823450989451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin7858025823450989451;'/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/stateBased5478686668627729734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:43:52] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:43:52] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:43:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:43:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin14180495656274572122
[2022-05-16 16:43:52] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14180495656274572122
Running compilation step : cd /tmp/ltsmin14180495656274572122;'/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 76 ms.
Running link step : cd /tmp/ltsmin14180495656274572122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14180495656274572122;'/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/stateBased16961558257588322352.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:44:07] [INFO ] Flatten gal took : 3 ms
[2022-05-16 16:44:07] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:44:07] [INFO ] Time to serialize gal into /tmp/LTL4609461509634899585.gal : 1 ms
[2022-05-16 16:44:07] [INFO ] Time to serialize properties into /tmp/LTL14758653718127023930.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/LTL4609461509634899585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14758653718127023930.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/LTL4609461...267
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((SR>=1)&&(Mi>=1))")))))
Formula 0 simplified : !XXF"((SR>=1)&&(Mi>=1))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 16:44:07] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:44:07] [INFO ] Applying decomposition
[2022-05-16 16:44:07] [INFO ] Flatten gal took : 3 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/graph16350868036015003594.txt' '-o' '/tmp/graph16350868036015003594.bin' '-w' '/tmp/graph16350868036015003594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16350868036015003594.bin' '-l' '-1' '-v' '-w' '/tmp/graph16350868036015003594.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:44:07] [INFO ] Decomposing Gal with order
[2022-05-16 16:44:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:44:07] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 16:44:07] [INFO ] Flatten gal took : 3 ms
[2022-05-16 16:44:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 16:44:07] [INFO ] Time to serialize gal into /tmp/LTL2651866512811449927.gal : 0 ms
[2022-05-16 16:44:07] [INFO ] Time to serialize properties into /tmp/LTL7565917443760442854.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/LTL2651866512811449927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7565917443760442854.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/LTL2651866...245
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((u2.SR>=1)&&(i2.u3.Mi>=1))")))))
Formula 0 simplified : !XXF"((u2.SR>=1)&&(i2.u3.Mi>=1))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin13231421835464036922
[2022-05-16 16:44:07] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13231421835464036922
Running compilation step : cd /tmp/ltsmin13231421835464036922;'/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 74 ms.
Running link step : cd /tmp/ltsmin13231421835464036922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13231421835464036922;'/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-N5000P0-LTLFireability-08 finished in 47578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((G((!(G(X(p0))||p1)||p2)) U X(p3))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 16:44:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 16:44:23] [INFO ] Implicit Places using invariants in 29 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(OR p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND p2 (NOT p3) p0) (AND p1 (NOT p3) p0)), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 7}, { cond=(OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(OR p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(GEQ s12 1), p1:(AND (GEQ s5 1) (GEQ s14 1)), p3:(GEQ s19 1), p0:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22214 reset in 107 ms.
Product exploration explored 100000 steps with 22224 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 : [(AND (NOT p2) (NOT p1) p3 (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 314 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=4000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:44:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:44:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:44:24] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 16:44:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:44:24] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 16:44:24] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-16 16:44:24] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 60041 steps, including 0 resets, run visited all 1 properties in 62 ms. (steps per millisecond=968 )
Parikh walk visited 5 properties in 1950 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p3) p0 p1) (AND (NOT p3) p0 p2))), (F (NOT p3)), (F (AND (NOT p3) p1 (NOT p2))), (F (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p3) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 451 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 328 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 315 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:44:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:44:27] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:44:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:44:27] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:44:27] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:44:27] [INFO ] Dead Transitions using invariants and state equation in 26 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 p1) (NOT p2) p3 (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 314 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=8000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:44:28] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:44:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:44:28] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 16:44:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 16:44:28] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 16:44:28] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-16 16:44:28] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 60041 steps, including 0 resets, run visited all 1 properties in 42 ms. (steps per millisecond=1429 )
Parikh walk visited 5 properties in 1737 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (OR (AND (NOT p3) p0 p1) (AND (NOT p3) p0 p2))), (F (NOT p3)), (F (AND (NOT p3) p1 (NOT p2))), (F (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p3) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 436 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 325 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 329 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 310 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 22231 reset in 64 ms.
Product exploration explored 100000 steps with 22239 reset in 74 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 325 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 17 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 17 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 17 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 16 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 16 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 16 rules in 3 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2022-05-16 16:44:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2022-05-16 16:44:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:44:32] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/20 places, 14/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 14/18 transitions.
Product exploration explored 100000 steps with 22230 reset in 107 ms.
Product exploration explored 100000 steps with 22201 reset in 109 ms.
Built C files in :
/tmp/ltsmin10780875466079155101
[2022-05-16 16:44:32] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10780875466079155101
Running compilation step : cd /tmp/ltsmin10780875466079155101;'/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 84 ms.
Running link step : cd /tmp/ltsmin10780875466079155101;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin10780875466079155101;'/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/stateBased6400124786676970416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:44:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:44:48] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:44:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:44:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 16:44:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:44:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin9219188464246340793
[2022-05-16 16:44:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9219188464246340793
Running compilation step : cd /tmp/ltsmin9219188464246340793;'/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 79 ms.
Running link step : cd /tmp/ltsmin9219188464246340793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9219188464246340793;'/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/stateBased12026352183576785948.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:45:03] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:45:03] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:45:03] [INFO ] Time to serialize gal into /tmp/LTL1039105066343758305.gal : 1 ms
[2022-05-16 16:45:03] [INFO ] Time to serialize properties into /tmp/LTL10631677539316988229.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/LTL1039105066343758305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10631677539316988229.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/LTL1039105...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X((G((!((G(X("(Cb>=1)")))||("((CF>=1)&&(Si>=1))")))||("(MpG>=1)")))U(X("(Ci>=1)")))))))
Formula 0 simplified : !GXX(G("(MpG>=1)" | !("((CF>=1)&&(Si>=1))" | GX"(Cb>=1)")) U X"(Ci>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 16:45:03] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:45:03] [INFO ] Applying decomposition
[2022-05-16 16:45:03] [INFO ] Flatten gal took : 2 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/graph9470221303250869081.txt' '-o' '/tmp/graph9470221303250869081.bin' '-w' '/tmp/graph9470221303250869081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9470221303250869081.bin' '-l' '-1' '-v' '-w' '/tmp/graph9470221303250869081.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:45:03] [INFO ] Decomposing Gal with order
[2022-05-16 16:45:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:45:03] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 16:45:03] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:45:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 16:45:03] [INFO ] Time to serialize gal into /tmp/LTL1534016040959886836.gal : 1 ms
[2022-05-16 16:45:03] [INFO ] Time to serialize properties into /tmp/LTL10683653096253616194.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/LTL1534016040959886836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10683653096253616194.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/LTL1534016...246
Read 1 LTL properties
Checking formula 0 : !((G(X(X((G((!((G(X("(u2.Cb>=1)")))||("((u2.CF>=1)&&(u1.Si>=1))")))||("(u4.MpG>=1)")))U(X("(u5.Ci>=1)")))))))
Formula 0 simplified : !GXX(G("(u4.MpG>=1)" | !("((u2.CF>=1)&&(u1.Si>=1))" | GX"(u2.Cb>=1)")) U X"(u5.Ci>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin3457483411243716883
[2022-05-16 16:45:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3457483411243716883
Running compilation step : cd /tmp/ltsmin3457483411243716883;'/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 78 ms.
Running link step : cd /tmp/ltsmin3457483411243716883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3457483411243716883;'/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(([]((!([](X((LTLAPp0==true)))||(LTLAPp1==true))||(LTLAPp2==true))) U X((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-09 finished in 55463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(G(F(X(!G(p0))))||p1)) U G(X(p2))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2022-05-16 16:45:18] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 16:45:18] [INFO ] Implicit Places using invariants in 26 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s16 1), p1:(GEQ s10 1), p0:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 0 reset in 201 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 p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 532 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), true, (NOT p0), (NOT p2)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=10000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:45:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:45:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:45:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 16:45:19] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 16:45:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:45:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 16:45:19] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 16:45:19] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 16:45:19] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 2 properties in 97 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F p0), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 576 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), true, (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), true, (NOT p0), (NOT p2)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:45:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:45:20] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 16:45:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 16:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 16:45:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:45:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:45:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 16:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-16 16:45:20] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:45:20] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:45:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:45:20] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 16:45:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 16:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 16:45:20] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 16:45:20] [INFO ] Added : 13 causal constraints over 3 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:45:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:45:21] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:45:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:45:21] [INFO ] Implicit Places using invariants and state equation in 30 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 16:45:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:45:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 552 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), true, (NOT p0), (NOT p2)]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=5000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :3
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 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:45:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:45:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-16 16:45:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 16:45:21] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 16:45:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 16:45:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 16:45:21] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 16:45:21] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 16:45:21] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Parikh walk visited 2 properties in 79 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F p0), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 15 factoid took 694 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), true, (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), true, (NOT p0), (NOT p2)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:45:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:45:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:45:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 16:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 16:45:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:45:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 16:45:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 16:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:23] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 16:45:23] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 16:45:23] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 16:45:23] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 16:45:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:45:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 16:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:23] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 16:45:23] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 16:45:23] [INFO ] Added : 13 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), true, (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-10 finished in 4997 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(X(p0)))&&G((F(p1)&&F(p2))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 18 transition count 13
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 12 place count 17 transition count 13
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 18 place count 14 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 22216 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-16 16:45:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 16:45:45] [INFO ] Implicit Places using invariants in 29 ms returned [4, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s8 1)), p1:(AND (GEQ s0 1) (GEQ s7 1)), p2:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3775 reset in 90 ms.
Stack based approach found an accepted trace after 618 steps with 47 reset with depth 17 and stack size 17 in 1 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-11 finished in 22473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(p0)))||F(X(G(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 6 rules applied. Total rules applied 6 place count 23 transition count 13
Reduce places removed 5 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 5 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-16 16:45:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 16:45:45] [INFO ] Implicit Places using invariants in 24 ms returned [8]
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/24 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 2 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 16:45:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:45:46] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 16:45:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 16:45:46] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/24 places, 7/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s7 1)), p0:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3786 reset in 82 ms.
Stack based approach found an accepted trace after 106 steps with 3 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-12 finished in 244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||F(((F(p1)||p2)&&X(G(p3))))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 20 transition count 16
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 20 transition count 12
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 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Applied a total of 16 rules in 9 ms. Remains 15 /24 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 16:45:46] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 16:45:46] [INFO ] Implicit Places using invariants in 19 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/24 places, 11/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 14/24 places, 11/18 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p3), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s12 1)), p1:(AND (GEQ s2 1) (GEQ s11 1)), p0:(GEQ s8 1), p3:(GEQ s7 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 14 reset in 144 ms.
Stack based approach found an accepted trace after 11012 steps with 34 reset with depth 7397 and stack size 7396 in 23 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-13 finished in 373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (F(p1) U X(p0))))||X(G(F(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a CL insensitive property : ClientsAndServers-PT-N5000P0-LTLFireability-08
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 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 11 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 12 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 11 transition count 7
Applied a total of 24 rules in 22069 ms. Remains 11 /24 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2022-05-16 16:46:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 16:46:08] [INFO ] Implicit Places using invariants in 22 ms returned [4, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 9/24 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 7/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24854 reset in 43 ms.
Product exploration explored 100000 steps with 25008 reset in 55 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=5000 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 16:46:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:09] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 16:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:46:09] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 16:46:09] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 16:46:09] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 16:46:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:46:09] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 16:46:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:46:09] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 16:46:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:09] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 16:46:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:46:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:46:10] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 16:46:10] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 16:46:10] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25039 reset in 49 ms.
Product exploration explored 100000 steps with 25046 reset in 48 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2022-05-16 16:46:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 16:46:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:46:10] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 25067 reset in 67 ms.
Product exploration explored 100000 steps with 25024 reset in 70 ms.
Built C files in :
/tmp/ltsmin8407642035663325480
[2022-05-16 16:46:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8407642035663325480
Running compilation step : cd /tmp/ltsmin8407642035663325480;'/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/ltsmin8407642035663325480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8407642035663325480;'/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/stateBased11027950685821767674.hoa' '--buchi-type=spotba'
LTSmin run took 1883 ms.
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-08 finished in 26068 ms.
FORMULA ClientsAndServers-PT-N5000P0-LTLFireability-08 TRUE TECHNIQUES CL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((G((!(G(X(p0))||p1)||p2)) U X(p3))))))'
Found a SL insensitive property : ClientsAndServers-PT-N5000P0-LTLFireability-09
Stuttering acceptance computed with spot in 342 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 17 transition count 13
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 14 place count 16 transition count 12
Applied a total of 14 rules in 5 ms. Remains 16 /24 variables (removed 8) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-16 16:46:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 16:46:13] [INFO ] Implicit Places using invariants in 32 ms returned [11, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 14/24 places, 12/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 10
Applied a total of 4 rules in 2 ms. Remains 12 /14 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:13] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:13] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 12/24 places, 10/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/24 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N5000P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(OR p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND p2 (NOT p3) p0) (AND p1 (NOT p3) p0)), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 7}, { cond=(OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(OR p2 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(GEQ s7 1), p1:(AND (GEQ s3 1) (GEQ s9 1)), p3:(GEQ s11 1), p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], 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 22073 reset in 65 ms.
Product exploration explored 100000 steps with 22049 reset in 67 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 309 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=4000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:14] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 16:46:14] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 16:46:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:46:14] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 16:46:14] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 16:46:14] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 110012 steps, including 0 resets, run visited all 2 properties in 795 ms. (steps per millisecond=138 )
Parikh walk visited 5 properties in 2514 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p3) p0 p1) (AND (NOT p3) p0 p2))), (F (NOT p3)), (F (AND (NOT p3) p1 (NOT p2))), (F (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p3) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 441 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 348 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 353 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:18] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:18] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:18] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:18] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:18] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 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 p2) p3 (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 368 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Incomplete random walk after 40001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=4444 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:46:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:46:19] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 16:46:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 16:46:19] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-16 16:46:19] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 16:46:19] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 110012 steps, including 0 resets, run visited all 2 properties in 809 ms. (steps per millisecond=135 )
Parikh walk visited 5 properties in 2196 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (OR (AND (NOT p3) p0 p1) (AND (NOT p3) p0 p2))), (F (NOT p3)), (F (AND (NOT p3) p1 (NOT p2))), (F (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p3) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 436 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 338 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 309 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 357 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 22057 reset in 57 ms.
Product exploration explored 100000 steps with 22017 reset in 64 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 368 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p3), true, p0, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2022-05-16 16:46:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:23] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Product exploration explored 100000 steps with 22066 reset in 97 ms.
Product exploration explored 100000 steps with 21986 reset in 109 ms.
Built C files in :
/tmp/ltsmin18005057365240008203
[2022-05-16 16:46:23] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18005057365240008203
Running compilation step : cd /tmp/ltsmin18005057365240008203;'/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 79 ms.
Running link step : cd /tmp/ltsmin18005057365240008203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18005057365240008203;'/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/stateBased2231496565591887357.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 16:46:38] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:38] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-16 16:46:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 16:46:38] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin10272379418087283205
[2022-05-16 16:46:38] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10272379418087283205
Running compilation step : cd /tmp/ltsmin10272379418087283205;'/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 77 ms.
Running link step : cd /tmp/ltsmin10272379418087283205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10272379418087283205;'/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/stateBased6472798568645936602.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:46:53] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:46:53] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:46:53] [INFO ] Time to serialize gal into /tmp/LTL14484701042868091502.gal : 1 ms
[2022-05-16 16:46:53] [INFO ] Time to serialize properties into /tmp/LTL862129156602417994.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/LTL14484701042868091502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL862129156602417994.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/LTL1448470...266
Read 1 LTL properties
Checking formula 0 : !((G(X(X((G((!((G(X("(Cb>=1)")))||("((CF>=1)&&(Si>=1))")))||("(MpG>=1)")))U(X("(Ci>=1)")))))))
Formula 0 simplified : !GXX(G("(MpG>=1)" | !("((CF>=1)&&(Si>=1))" | GX"(Cb>=1)")) U X"(Ci>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 16:46:53] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:46:53] [INFO ] Applying decomposition
[2022-05-16 16:46:53] [INFO ] Flatten gal took : 1 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/graph16204916500967680034.txt' '-o' '/tmp/graph16204916500967680034.bin' '-w' '/tmp/graph16204916500967680034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16204916500967680034.bin' '-l' '-1' '-v' '-w' '/tmp/graph16204916500967680034.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:46:53] [INFO ] Decomposing Gal with order
[2022-05-16 16:46:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:46:53] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:46:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 16:46:53] [INFO ] Time to serialize gal into /tmp/LTL4818343248581945779.gal : 1 ms
[2022-05-16 16:46:53] [INFO ] Time to serialize properties into /tmp/LTL5322571187434988835.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/LTL4818343248581945779.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5322571187434988835.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/LTL4818343...245
Read 1 LTL properties
Checking formula 0 : !((G(X(X((G((!((G(X("(u2.Cb>=1)")))||("((u2.CF>=1)&&(u0.Si>=1))")))||("(u1.MpG>=1)")))U(X("(u3.Ci>=1)")))))))
Formula 0 simplified : !GXX(G("(u1.MpG>=1)" | !("((u2.CF>=1)&&(u0.Si>=1))" | GX"(u2.Cb>=1)")) U X"(u3.Ci>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin8095845049040963086
[2022-05-16 16:46:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8095845049040963086
Running compilation step : cd /tmp/ltsmin8095845049040963086;'/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 84 ms.
Running link step : cd /tmp/ltsmin8095845049040963086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8095845049040963086;'/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(([]((!([](X((LTLAPp0==true)))||(LTLAPp1==true))||(LTLAPp2==true))) U X((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N5000P0-LTLFireability-09 finished in 56342 ms.
[2022-05-16 16:47:09] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1811684667300873486
[2022-05-16 16:47:09] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-16 16:47:09] [INFO ] Applying decomposition
[2022-05-16 16:47:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:47:09] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-16 16:47:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:47:09] [INFO ] Flatten gal took : 1 ms
[2022-05-16 16:47:09] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-16 16:47:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph10534766250056467442.txt' '-o' '/tmp/graph10534766250056467442.bin' '-w' '/tmp/graph10534766250056467442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10534766250056467442.bin' '-l' '-1' '-v' '-w' '/tmp/graph10534766250056467442.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:47:09] [INFO ] Decomposing Gal with order
[2022-05-16 16:47:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:47:09] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 16:47:09] [INFO ] Flatten gal took : 3 ms
[2022-05-16 16:47:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 16:47:09] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1811684667300873486
Running compilation step : cd /tmp/ltsmin1811684667300873486;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2022-05-16 16:47:09] [INFO ] Time to serialize gal into /tmp/LTLFireability17364806881614240524.gal : 0 ms
[2022-05-16 16:47:09] [INFO ] Time to serialize properties into /tmp/LTLFireability5848371562411080891.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/LTLFireability17364806881614240524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5848371562411080891.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...268
Read 2 LTL properties
Checking formula 0 : !(((X(("(i3.u4.MtF>=1)")U((F("((u1.CA>=1)&&(i5.u6.CwA>=1))"))U(X("(i3.u4.MtF>=1)")))))||(X(G(F("((u1.CA>=1)&&(i5.u6.CwA>=1))"))))))
Formula 0 simplified : !(X("(i3.u4.MtF>=1)" U (F"((u1.CA>=1)&&(i5.u6.CwA>=1))" U X"(i3.u4.MtF>=1)")) | XGF"((u1.CA>=1)&&(i5.u6.CwA>=1))")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 16:47:09] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:47:09] [INFO ] Time to serialize gal into /tmp/LTLFireability13149469243880405137.gal : 1 ms
[2022-05-16 16:47:09] [INFO ] Time to serialize properties into /tmp/LTLFireability3836996637959146716.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/LTLFireability13149469243880405137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3836996637959146716.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...289
Read 2 LTL properties
Checking formula 0 : !(((X(("(MtF>=1)")U((F("((CA>=1)&&(CwA>=1))"))U(X("(MtF>=1)")))))||(X(G(F("((CA>=1)&&(CwA>=1))"))))))
Formula 0 simplified : !(X("(MtF>=1)" U (F"((CA>=1)&&(CwA>=1))" U X"(MtF>=1)")) | XGF"((CA>=1)&&(CwA>=1))")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-16 16:47:09] [INFO ] Flatten gal took : 2 ms
[2022-05-16 16:47:09] [INFO ] Input system was already deterministic with 18 transitions.
[2022-05-16 16:47:09] [INFO ] Transformed 24 places.
[2022-05-16 16:47:09] [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 16:47:09] [INFO ] Time to serialize gal into /tmp/LTLFireability14531217670780413460.gal : 0 ms
[2022-05-16 16:47:09] [INFO ] Time to serialize properties into /tmp/LTLFireability15456825117453504652.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/LTLFireability14531217670780413460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15456825117453504652.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
Compilation finished in 109 ms.
Running link step : cd /tmp/ltsmin1811684667300873486;'gcc' '-shared' '-o' 'gal.so' 'model.o'

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...335
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(("(MtF>=1)")U((F("((CA>=1)&&(CwA>=1))"))U(X("(MtF>=1)")))))||(X(G(F("((CA>=1)&&(CwA>=1))"))))))
Formula 0 simplified : !(X("(MtF>=1)" U (F"((CA>=1)&&(CwA>=1))" U X"(MtF>=1)")) | XGF"((CA>=1)&&(CwA>=1))")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1811684667300873486;'/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(((LTLAPp0==true) U (<>((LTLAPp1==true)) U X((LTLAPp0==true)))))||X([](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: LTL layer: formula: (X(((LTLAPp0==true) U (<>((LTLAPp1==true)) U X((LTLAPp0==true)))))||X([](<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 0/ 8), 0.014: "(X(((LTLAPp0==true) U (<>((LTLAPp1==true)) U X((LTLAPp0==true)))))||X([](<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.014: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.031: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.089: DFS-FIFO for weak LTL, using special progress label 26
pins2lts-mc-linux64( 0/ 8), 0.089: There are 27 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.089: State length is 25, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.089: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.089: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.089: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.089: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.156: ~118 levels ~960 states ~6896 transitions
pins2lts-mc-linux64( 1/ 8), 0.250: ~230 levels ~1920 states ~16928 transitions
pins2lts-mc-linux64( 1/ 8), 0.431: ~452 levels ~3840 states ~39512 transitions
pins2lts-mc-linux64( 1/ 8), 0.768: ~896 levels ~7680 states ~87960 transitions
pins2lts-mc-linux64( 1/ 8), 1.327: ~1796 levels ~15360 states ~185304 transitions
pins2lts-mc-linux64( 1/ 8), 2.115: ~3592 levels ~30720 states ~397960 transitions
pins2lts-mc-linux64( 1/ 8), 3.158: ~7177 levels ~61440 states ~828032 transitions
pins2lts-mc-linux64( 1/ 8), 4.700: ~14405 levels ~122880 states ~1734624 transitions
pins2lts-mc-linux64( 1/ 8), 6.774: ~28823 levels ~245760 states ~3596352 transitions
pins2lts-mc-linux64( 1/ 8), 9.002: ~57754 levels ~491520 states ~7410512 transitions
pins2lts-mc-linux64( 1/ 8), 11.717: ~115711 levels ~983040 states ~15117064 transitions
pins2lts-mc-linux64( 1/ 8), 14.214: ~193375 levels ~1966080 states ~22085224 transitions
pins2lts-mc-linux64( 1/ 8), 15.685: ~193375 levels ~3932160 states ~25084256 transitions
pins2lts-mc-linux64( 1/ 8), 18.591: ~193375 levels ~7864320 states ~30971128 transitions
pins2lts-mc-linux64( 1/ 8), 25.997: ~193375 levels ~15728640 states ~45638760 transitions
pins2lts-mc-linux64( 1/ 8), 41.385: ~193375 levels ~31457280 states ~76539216 transitions
pins2lts-mc-linux64( 1/ 8), 74.745: ~193375 levels ~62914560 states ~137581104 transitions
pins2lts-mc-linux64( 1/ 8), 127.803: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 127.822:
pins2lts-mc-linux64( 0/ 8), 127.822: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 127.822:
pins2lts-mc-linux64( 0/ 8), 127.822: Explored 11979279 states 25280344 transitions, fanout: 2.110
pins2lts-mc-linux64( 0/ 8), 127.822: Total exploration time 127.730 sec (127.690 sec minimum, 127.705 sec on average)
pins2lts-mc-linux64( 0/ 8), 127.822: States per second: 93786, Transitions per second: 197920
pins2lts-mc-linux64( 0/ 8), 127.822:
pins2lts-mc-linux64( 0/ 8), 127.822: Progress states detected: 5
pins2lts-mc-linux64( 0/ 8), 127.822: Redundant explorations: -17.3195
pins2lts-mc-linux64( 0/ 8), 127.822:
pins2lts-mc-linux64( 0/ 8), 127.822: Queue width: 8B, total height: 193391, memory: 1.48MB
pins2lts-mc-linux64( 0/ 8), 127.822: Tree memory: 366.5MB, 26.5 B/state, compr.: 26.0%
pins2lts-mc-linux64( 0/ 8), 127.822: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 127.822: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 127.822: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 127.822: Est. total memory use: 368.0MB (~1025.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1811684667300873486;'/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(((LTLAPp0==true) U (<>((LTLAPp1==true)) U X((LTLAPp0==true)))))||X([](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1811684667300873486;'/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(((LTLAPp0==true) U (<>((LTLAPp1==true)) U X((LTLAPp0==true)))))||X([](<>((LTLAPp1==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)
Total runtime 396129 ms.

BK_STOP 1652719757340

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-N5000P0"
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-N5000P0, 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-165251919200924"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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