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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 7.3K Apr 29 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 12:27 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.5K May 9 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:15 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-N0020P1-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652700645796

Running Version 202205111006
[2022-05-16 11:30:46] [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 11:30:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:30:47] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2022-05-16 11:30:47] [INFO ] Transformed 25 places.
[2022-05-16 11:30:47] [INFO ] Transformed 18 transitions.
[2022-05-16 11:30:47] [INFO ] Parsed PT model containing 25 places and 18 transitions in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-16 11:30:47] [INFO ] Computed 8 place invariants in 7 ms
[2022-05-16 11:30:47] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2022-05-16 11:30:47] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 11:30:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2022-05-16 11:30:47] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 11:30:47] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
Support contains 21 out of 25 places after structural reductions.
[2022-05-16 11:30:47] [INFO ] Flatten gal took : 15 ms
[2022-05-16 11:30:47] [INFO ] Flatten gal took : 4 ms
[2022-05-16 11:30:47] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 1106 steps, including 0 resets, run visited all 18 properties in 32 ms. (steps per millisecond=34 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(G(p0))) U (G(!X(p1)) U p2))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 11:30:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 11:30:48] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (GEQ s17 1) (AND (GEQ s11 1) (GEQ s16 1))), p1:(GEQ s17 1), p0:(AND (GEQ s11 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 44417 steps with 1089 reset in 166 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-00 finished in 583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(p1)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 11:30:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 11:30:48] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 77 ms :[p1, p1, true]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s18 1), p1:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-03 finished in 478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 15 transition count 11
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 18 place count 14 transition count 11
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 26 place count 10 transition count 7
Applied a total of 26 rules in 6 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 11:30:49] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 11:30:49] [INFO ] Implicit Places using invariants in 20 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 11:30:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 11:30:49] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 11:30:49] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 11:30:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/25 places, 5/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15036 reset in 84 ms.
Product exploration explored 100000 steps with 15144 reset in 113 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 11:30:49] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 11:30:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 11:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 11:30:49] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 11:30:49] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 11:30:49] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 11:30:49] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 11:30:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 11:30:49] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-16 11:30:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 11:30:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 11:30:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 11:30:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 11:30:50] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 11:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:50] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 11:30:50] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 11:30:50] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15079 reset in 162 ms.
Product exploration explored 100000 steps with 15047 reset in 60 ms.
Built C files in :
/tmp/ltsmin2557034766062538363
[2022-05-16 11:30:50] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-16 11:30:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:30:50] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-16 11:30:50] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:30:50] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-16 11:30:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:30:50] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2557034766062538363
Running compilation step : cd /tmp/ltsmin2557034766062538363;'/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 155 ms.
Running link step : cd /tmp/ltsmin2557034766062538363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2557034766062538363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4194291648361616308.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-05 finished in 1810 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 11:30:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 11:30:50] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-06 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 s11 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 51 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 49 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-06 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(X(p0))))||X(p1)||p2))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 11:30:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 11:30:51] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LT s16 1), p1:(LT s12 1), p0:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3569 reset in 70 ms.
Product exploration explored 100000 steps with 3584 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 p2 p1 p0), (X p1), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :5
Finished Best-First random walk after 647 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=323 )
Knowledge obtained : [(AND p2 p1 p0), (X p1), true, (X (X p2))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 3 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 11:30:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 11:30:52] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 11:30:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 11:30:52] [INFO ] Implicit Places using invariants and state equation in 29 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 11:30:52] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 11:30:52] [INFO ] Dead Transitions using invariants and state equation in 22 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 p2 p1 p0), (X p1), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10007 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :3
Finished Best-First random walk after 412 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=103 )
Knowledge obtained : [(AND p2 p1 p0), (X p1), true]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3571 reset in 69 ms.
Product exploration explored 100000 steps with 3568 reset in 73 ms.
Built C files in :
/tmp/ltsmin13904423149164626806
[2022-05-16 11:30:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13904423149164626806
Running compilation step : cd /tmp/ltsmin13904423149164626806;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin13904423149164626806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13904423149164626806;'/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/stateBased1351259124635888598.hoa' '--buchi-type=spotba'
LTSmin run took 145 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-07 finished in 3163 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X((X((X(G(p0))&&X(p1)))&&p2)))||p1) U p2))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 11:30:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 11:30:54] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s18 1), p1:(GEQ s17 1), p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-08 finished in 386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0))||p0))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 9 transition count 6
Applied a total of 28 rules in 3 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-16 11:30:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 11:30:54] [INFO ] Implicit Places using invariants in 24 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 6/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 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 11:30:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 11:30:54] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 11:30:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 11:30:54] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/25 places, 4/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13727 reset in 49 ms.
Product exploration explored 100000 steps with 13885 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 389 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=194 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 5 cols
[2022-05-16 11:30:55] [INFO ] Computed 2 place invariants in 0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-09 finished in 850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F((X(X(p0))&&p1))||G(X(p2)))) U (p2 U p0)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 11:30:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 11:30:55] [INFO ] Implicit Places using invariants in 25 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 481 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 10}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 11}, { cond=(AND p2 p1), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}, { cond=p1, acceptance={0} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 9}, { cond=p1, acceptance={0} source=8 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=10 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=11 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(GEQ s9 1), p2:(GEQ s6 1), p1:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 960 reset in 122 ms.
Product exploration explored 100000 steps with 988 reset in 111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1061 ms. Reduced automaton from 13 states, 37 edges and 3 AP to 13 states, 37 edges and 3 AP.
Stuttering acceptance computed with spot in 497 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 3439 steps, including 1 resets, run visited all 14 properties in 18 ms. (steps per millisecond=191 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND (NOT p0) p1 p2)), (F (AND p1 p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F p0), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 21 factoid took 1252 ms. Reduced automaton from 13 states, 37 edges and 3 AP to 13 states, 37 edges and 3 AP.
Stuttering acceptance computed with spot in 565 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 480 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 11:31:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 11:31:00] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 11:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:31:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 11:31:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:31:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 11:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:31:00] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 11:31:00] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 11:31:00] [INFO ] Added : 12 causal constraints over 3 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 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 11:31:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 11:31:00] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 11:31:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 11:31:00] [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 11:31:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 11:31:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 963 ms. Reduced automaton from 13 states, 37 edges and 3 AP to 13 states, 37 edges and 3 AP.
Stuttering acceptance computed with spot in 458 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1158 steps, including 0 resets, run visited all 14 properties in 10 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND p1 (NOT p0) p2)), (F (AND p1 p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p1), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 21 factoid took 1270 ms. Reduced automaton from 13 states, 37 edges and 3 AP to 13 states, 37 edges and 3 AP.
Stuttering acceptance computed with spot in 500 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 501 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 11:31:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 11:31:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 11:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:31:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 11:31:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:31:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 11:31:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:31:04] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 11:31:04] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 11:31:04] [INFO ] Added : 12 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 560 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 956 reset in 98 ms.
Product exploration explored 100000 steps with 957 reset in 105 ms.
Built C files in :
/tmp/ltsmin1102560670038774735
[2022-05-16 11:31:05] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1102560670038774735
Running compilation step : cd /tmp/ltsmin1102560670038774735;'/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/ltsmin1102560670038774735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1102560670038774735;'/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/stateBased17912078817599348014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 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 11:31:20] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-16 11:31:20] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 11:31:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 11:31:20] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 11:31:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 11:31:20] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5379882885277010416
[2022-05-16 11:31:20] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5379882885277010416
Running compilation step : cd /tmp/ltsmin5379882885277010416;'/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 71 ms.
Running link step : cd /tmp/ltsmin5379882885277010416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5379882885277010416;'/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/stateBased6452484117790391752.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 11:31:35] [INFO ] Flatten gal took : 3 ms
[2022-05-16 11:31:35] [INFO ] Flatten gal took : 2 ms
[2022-05-16 11:31:35] [INFO ] Time to serialize gal into /tmp/LTL13371603463283470025.gal : 1 ms
[2022-05-16 11:31:35] [INFO ] Time to serialize properties into /tmp/LTL13269409184367115172.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/LTL13371603463283470025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13269409184367115172.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/LTL1337160...268
Read 1 LTL properties
Checking formula 0 : !(((X((F((X(X("(MpA>=1)")))&&("(Cb>=1)")))||(G(X("(StF>=1)")))))U(("(StF>=1)")U("(MpA>=1)"))))
Formula 0 simplified : !(X(F("(Cb>=1)" & XX"(MpA>=1)") | GX"(StF>=1)") U ("(StF>=1)" U "(MpA>=1)"))
Detected timeout of ITS tools.
[2022-05-16 11:31:50] [INFO ] Flatten gal took : 5 ms
[2022-05-16 11:31:50] [INFO ] Applying decomposition
[2022-05-16 11:31:50] [INFO ] Flatten gal took : 5 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/graph5880517217752637291.txt' '-o' '/tmp/graph5880517217752637291.bin' '-w' '/tmp/graph5880517217752637291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5880517217752637291.bin' '-l' '-1' '-v' '-w' '/tmp/graph5880517217752637291.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:31:50] [INFO ] Decomposing Gal with order
[2022-05-16 11:31:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:31:50] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 11:31:50] [INFO ] Flatten gal took : 26 ms
[2022-05-16 11:31:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 11:31:50] [INFO ] Time to serialize gal into /tmp/LTL5518209497811456464.gal : 0 ms
[2022-05-16 11:31:50] [INFO ] Time to serialize properties into /tmp/LTL17045006883806100460.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/LTL5518209497811456464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17045006883806100460.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/LTL5518209...246
Read 1 LTL properties
Checking formula 0 : !(((X((F((X(X("(u0.MpA>=1)")))&&("(u2.Cb>=1)")))||(G(X("(u1.StF>=1)")))))U(("(u1.StF>=1)")U("(u0.MpA>=1)"))))
Formula 0 simplified : !(X(F("(u2.Cb>=1)" & XX"(u0.MpA>=1)") | GX"(u1.StF>=1)") U ("(u1.StF>=1)" U "(u0.MpA>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15826748394454764573
[2022-05-16 11:32:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15826748394454764573
Running compilation step : cd /tmp/ltsmin15826748394454764573;'/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 92 ms.
Running link step : cd /tmp/ltsmin15826748394454764573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15826748394454764573;'/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)))||[](X((LTLAPp2==true))))) U ((LTLAPp2==true) U (LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 155 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-10 finished in 70308 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U !(X(p1) U p2)))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 3 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 11:32:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 11:32:05] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 11:32:05] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 11:32:05] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 11:32:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 11:32:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 166 ms :[p2, true, p0, (AND p2 p1), (AND p1 p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s14 1)), p0:(AND (GEQ s8 1) (GEQ s15 1)), p1:(AND (GEQ s11 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (X (NOT (AND p2 p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p0) (NOT p1))
Knowledge based reduction with 21 factoid took 811 ms. Reduced automaton from 5 states, 15 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-11 finished in 1293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||X(p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 11:32:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 11:32:07] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s9 1), p1:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-12 finished in 143 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G((G(p1)&&p0))&&F(p2)))||X(G(p3)))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 20 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 20 transition count 14
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 10 place count 19 transition count 14
Applied a total of 10 rules in 1 ms. Remains 19 /25 variables (removed 6) and now considering 14/18 (removed 4) transitions.
// Phase 1: matrix 14 rows 19 cols
[2022-05-16 11:32:07] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 11:32:07] [INFO ] Implicit Places using invariants in 27 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/25 places, 14/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 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 15 transition count 11
Applied a total of 6 rules in 3 ms. Remains 15 /18 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 11:32:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 11:32:07] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 11:32:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 11:32:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/25 places, 11/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/25 places, 11/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p3) (AND p3 (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p3 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p3) (AND p3 (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p3 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p3) p1), acceptance={1} source=1 dest: 1}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s13 1)), p3:(LT s10 1), p1:(GEQ s6 1), p2:(AND (GEQ s2 1) (GEQ s11 1))], nbAcceptance=2, 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 1045 reset in 165 ms.
Stack based approach found an accepted trace after 1246 steps with 15 reset with depth 31 and stack size 31 in 2 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-13 finished in 364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(X(F(p0))))||F(p1)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 17 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 16 transition count 11
Applied a total of 16 rules in 5 ms. Remains 16 /25 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 16 cols
[2022-05-16 11:32:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 11:32:07] [INFO ] Implicit Places using invariants in 23 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/25 places, 11/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 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 14 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 12 transition count 8
Applied a total of 6 rules in 4 ms. Remains 12 /15 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 11:32:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 11:32:07] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 11:32:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 11:32:07] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/25 places, 8/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s10 1)), p0:(AND (GEQ s1 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6490 reset in 80 ms.
Product exploration explored 100000 steps with 6479 reset in 86 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 203 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 11:32:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 11:32:08] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 11:32:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 11:32:08] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-16 11:32:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 11:32:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 11:32:08] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 203 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=203 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6419 reset in 89 ms.
Product exploration explored 100000 steps with 6387 reset in 89 ms.
Built C files in :
/tmp/ltsmin749880986934023952
[2022-05-16 11:32:09] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-16 11:32:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:32:09] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-16 11:32:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:32:09] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-16 11:32:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:32:09] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin749880986934023952
Running compilation step : cd /tmp/ltsmin749880986934023952;'/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/ltsmin749880986934023952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin749880986934023952;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16364117031151866881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 11:32:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 11:32:24] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 11:32:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 11:32:24] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-16 11:32:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 11:32:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 11:32:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin8182889705477950314
[2022-05-16 11:32:24] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-16 11:32:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:32:24] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-16 11:32:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:32:24] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-16 11:32:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:32:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8182889705477950314
Running compilation step : cd /tmp/ltsmin8182889705477950314;'/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/ltsmin8182889705477950314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8182889705477950314;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13606619852555739227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 11:32:39] [INFO ] Flatten gal took : 1 ms
[2022-05-16 11:32:39] [INFO ] Flatten gal took : 1 ms
[2022-05-16 11:32:39] [INFO ] Time to serialize gal into /tmp/LTL17143614341828787553.gal : 0 ms
[2022-05-16 11:32:39] [INFO ] Time to serialize properties into /tmp/LTL10453905476977360507.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/LTL17143614341828787553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10453905476977360507.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/LTL1714361...268
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G(X(F("((SA>=1)&&(SwA>=1))")))))||(F("((CG<1)||(CwG<1))"))))))
Formula 0 simplified : !GF(FGXF"((SA>=1)&&(SwA>=1))" | F"((CG<1)||(CwG<1))")
Detected timeout of ITS tools.
[2022-05-16 11:32:54] [INFO ] Flatten gal took : 5 ms
[2022-05-16 11:32:54] [INFO ] Applying decomposition
[2022-05-16 11:32:54] [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/graph6071207524747610469.txt' '-o' '/tmp/graph6071207524747610469.bin' '-w' '/tmp/graph6071207524747610469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6071207524747610469.bin' '-l' '-1' '-v' '-w' '/tmp/graph6071207524747610469.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:32:54] [INFO ] Decomposing Gal with order
[2022-05-16 11:32:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:32:54] [INFO ] Flatten gal took : 3 ms
[2022-05-16 11:32:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 11:32:54] [INFO ] Time to serialize gal into /tmp/LTL15265966176542697790.gal : 0 ms
[2022-05-16 11:32:54] [INFO ] Time to serialize properties into /tmp/LTL5189427212751718659.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/LTL15265966176542697790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5189427212751718659.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/LTL1526596...246
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G(X(F("((u3.SA>=1)&&(i3.u0.SwA>=1))")))))||(F("((u1.CG<1)||(u1.CwG<1))"))))))
Formula 0 simplified : !GF(FGXF"((u3.SA>=1)&&(i3.u0.SwA>=1))" | F"((u1.CG<1)||(u1.CwG<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11630629930701219906
[2022-05-16 11:33:09] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11630629930701219906
Running compilation step : cd /tmp/ltsmin11630629930701219906;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin11630629930701219906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11630629930701219906;'/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)))))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-14 finished in 76967 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))||G(F(X(p2)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 11:33:24] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 11:33:24] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 11:33:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 11:33:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 11:33:24] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 11:33:24] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s14 1)) (AND (GEQ s3 1) (GEQ s14 1))), p1:(OR (AND (GEQ s2 1) (GEQ s14 1)) (NOT (AND (GEQ s5 1) (GEQ s15 1)))), p2:(AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1945 reset in 93 ms.
Product exploration explored 100000 steps with 1942 reset in 102 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) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 391 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p2), (NOT p2)]
Finished random walk after 1044 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=522 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 9 factoid took 245 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 11:33:25] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 11:33:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 11:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:33:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 11:33:25] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 11:33:25] [INFO ] Added : 10 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 17
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 20 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 15 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 2 with 2 rules applied. Total rules applied 14 place count 14 transition count 11
Applied a total of 14 rules in 2 ms. Remains 14 /21 variables (removed 7) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-16 11:33:25] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 11:33:25] [INFO ] Implicit Places using invariants in 17 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/21 places, 11/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 13/21 places, 11/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Finished random walk after 643 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=643 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 11 rows 13 cols
[2022-05-16 11:33:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 11:33:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 11:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:33:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 11:33:26] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 11:33:26] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 3690 reset in 70 ms.
Product exploration explored 100000 steps with 3668 reset in 73 ms.
Built C files in :
/tmp/ltsmin8604777417120681405
[2022-05-16 11:33:26] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2022-05-16 11:33:26] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:33:26] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2022-05-16 11:33:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:33:26] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2022-05-16 11:33:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:33:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8604777417120681405
Running compilation step : cd /tmp/ltsmin8604777417120681405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin8604777417120681405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin8604777417120681405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4516024452876236030.hoa' '--buchi-type=spotba'
LTSmin run took 430 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-15 finished in 2554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(X(F(p0))))||F(p1)))))'
[2022-05-16 11:33:27] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9686376394538712628
[2022-05-16 11:33:27] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-16 11:33:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:33:27] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-16 11:33:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:33:27] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-16 11:33:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:33:27] [INFO ] Applying decomposition
[2022-05-16 11:33:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9686376394538712628
Running compilation step : cd /tmp/ltsmin9686376394538712628;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 11:33:27] [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/graph18331752421863200314.txt' '-o' '/tmp/graph18331752421863200314.bin' '-w' '/tmp/graph18331752421863200314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18331752421863200314.bin' '-l' '-1' '-v' '-w' '/tmp/graph18331752421863200314.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:33:27] [INFO ] Decomposing Gal with order
[2022-05-16 11:33:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:33:27] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 11:33:27] [INFO ] Flatten gal took : 3 ms
[2022-05-16 11:33:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 11:33:27] [INFO ] Time to serialize gal into /tmp/LTLFireability12160045528169778713.gal : 1 ms
[2022-05-16 11:33:27] [INFO ] Time to serialize properties into /tmp/LTLFireability6978559983740286372.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/LTLFireability12160045528169778713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6978559983740286372.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 1 LTL properties
Checking formula 0 : !((G(F((F(G(X(F("((i1.u5.SA>=1)&&(i1.u2.SwA>=1))")))))||(F("((i3.u7.CG<1)||(i0.u8.CwG<1))"))))))
Formula 0 simplified : !GF(FGXF"((i1.u5.SA>=1)&&(i1.u2.SwA>=1))" | F"((i3.u7.CG<1)||(i0.u8.CwG<1))")
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin9686376394538712628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9686376394538712628;'/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)))))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: [](<>((<>([](X(<>((LTLAPp0==true)))))||<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: "[](<>((<>([](X(<>((LTLAPp0==true)))))||<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: buchi has 2 states
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.056: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.056: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.056: State length is 26, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.056: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.056: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.056: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.056: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.084: ~44 levels ~960 states ~3744 transitions
pins2lts-mc-linux64( 3/ 8), 0.122: ~61 levels ~1920 states ~8168 transitions
pins2lts-mc-linux64( 3/ 8), 0.250: ~268 levels ~3840 states ~26592 transitions
pins2lts-mc-linux64( 7/ 8), 0.449: ~784 levels ~7680 states ~56656 transitions
pins2lts-mc-linux64( 7/ 8), 0.494: ~825 levels ~15360 states ~67608 transitions
pins2lts-mc-linux64( 7/ 8), 0.580: ~861 levels ~30720 states ~91176 transitions
pins2lts-mc-linux64( 7/ 8), 0.707: ~1450 levels ~61440 states ~150040 transitions
pins2lts-mc-linux64( 7/ 8), 0.889: ~1450 levels ~122880 states ~282024 transitions
pins2lts-mc-linux64( 7/ 8), 1.238: ~1450 levels ~245760 states ~559600 transitions
pins2lts-mc-linux64( 7/ 8), 1.787: ~1450 levels ~491520 states ~1120648 transitions
pins2lts-mc-linux64( 7/ 8), 2.655: ~1450 levels ~983040 states ~2260392 transitions
pins2lts-mc-linux64( 7/ 8), 3.855: ~1450 levels ~1966080 states ~4648448 transitions
pins2lts-mc-linux64( 1/ 8), 5.481: ~1437 levels ~3932160 states ~8938672 transitions
pins2lts-mc-linux64( 1/ 8), 8.652: ~1437 levels ~7864320 states ~18200584 transitions
pins2lts-mc-linux64( 1/ 8), 15.186: ~1437 levels ~15728640 states ~38175248 transitions
pins2lts-mc-linux64( 1/ 8), 28.186: ~1437 levels ~31457280 states ~77346352 transitions
pins2lts-mc-linux64( 1/ 8), 54.423: ~1437 levels ~62914560 states ~159098512 transitions
pins2lts-mc-linux64( 1/ 8), 109.431: ~1437 levels ~125829120 states ~317228968 transitions
pins2lts-mc-linux64( 3/ 8), 198.763: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 198.778:
pins2lts-mc-linux64( 0/ 8), 198.778: mean standard work distribution: 100.0% (states) 100.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 198.778:
pins2lts-mc-linux64( 0/ 8), 198.778: Explored 99259374 states 267360494 transitions, fanout: 2.694
pins2lts-mc-linux64( 0/ 8), 198.778: Total exploration time 198.720 sec (198.680 sec minimum, 198.704 sec on average)
pins2lts-mc-linux64( 0/ 8), 198.778: States per second: 499494, Transitions per second: 1345413
pins2lts-mc-linux64( 0/ 8), 198.778:
pins2lts-mc-linux64( 0/ 8), 198.778: Progress states detected: 439
pins2lts-mc-linux64( 0/ 8), 198.778: Redundant explorations: 16.2739
pins2lts-mc-linux64( 0/ 8), 198.778:
pins2lts-mc-linux64( 0/ 8), 198.778: Queue width: 8B, total height: 6095, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 198.778: Tree memory: 907.3MB, 11.1 B/state, compr.: 10.5%
pins2lts-mc-linux64( 0/ 8), 198.778: Tree fill ratio (roots/leafs): 63.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 198.778: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 198.778: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 198.778: Est. total memory use: 907.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9686376394538712628;'/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)))))||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9686376394538712628;'/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)))))||<>((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)
Detected timeout of ITS tools.
[2022-05-16 11:54:20] [INFO ] Flatten gal took : 6 ms
[2022-05-16 11:54:20] [INFO ] Time to serialize gal into /tmp/LTLFireability15254779402412965144.gal : 1 ms
[2022-05-16 11:54:20] [INFO ] Time to serialize properties into /tmp/LTLFireability15168445153925182903.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/LTLFireability15254779402412965144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15168445153925182903.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...290
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G(X(F("((SA>=1)&&(SwA>=1))")))))||(F("((CG<1)||(CwG<1))"))))))
Formula 0 simplified : !GF(FGXF"((SA>=1)&&(SwA>=1))" | F"((CG<1)||(CwG<1))")
Detected timeout of ITS tools.
[2022-05-16 12:15:13] [INFO ] Flatten gal took : 5 ms
[2022-05-16 12:15:13] [INFO ] Input system was already deterministic with 18 transitions.
[2022-05-16 12:15:13] [INFO ] Transformed 25 places.
[2022-05-16 12:15:13] [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 12:15:13] [INFO ] Time to serialize gal into /tmp/LTLFireability1482818847667558602.gal : 0 ms
[2022-05-16 12:15:13] [INFO ] Time to serialize properties into /tmp/LTLFireability2568766542366293201.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/LTLFireability1482818847667558602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2568766542366293201.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((F(G(X(F("((SA>=1)&&(SwA>=1))")))))||(F("((CG<1)||(CwG<1))"))))))
Formula 0 simplified : !GF(FGXF"((SA>=1)&&(SwA>=1))" | F"((CG<1)||(CwG<1))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0020P1"
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-N0020P1, 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-165251919100844"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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