Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678374205288

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P3
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 15:03:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 15:03:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:03:28] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-09 15:03:28] [INFO ] Transformed 25 places.
[2023-03-09 15:03:28] [INFO ] Transformed 18 transitions.
[2023-03-09 15:03:28] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 142 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 2 formulas.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 15 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 15:03:28] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 15:03:29] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-09 15:03:29] [INFO ] Invariant cache hit.
[2023-03-09 15:03:29] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-09 15:03:29] [INFO ] Invariant cache hit.
[2023-03-09 15:03:29] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-09 15:03:29] [INFO ] Flatten gal took : 29 ms
[2023-03-09 15:03:29] [INFO ] Flatten gal took : 10 ms
[2023-03-09 15:03:29] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 4944 steps, including 1 resets, run visited all 22 properties in 65 ms. (steps per millisecond=76 )
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 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 20 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-09 15:03:30] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 15:03:30] [INFO ] Implicit Places using invariants in 58 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 6/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 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 3 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-09 15:03:30] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 15:03:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 15:03:30] [INFO ] Invariant cache hit.
[2023-03-09 15:03:30] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 146 ms. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-00 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 s2 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 12338 reset in 415 ms.
Product exploration explored 100000 steps with 11027 reset in 466 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2023-03-09 15:03:32] [INFO ] Invariant cache hit.
[2023-03-09 15:03:32] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 15:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 15:03:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:03:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-09 15:03:32] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 15:03:32] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-09 15:03:32] [INFO ] Invariant cache hit.
[2023-03-09 15:03:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 15:03:32] [INFO ] Invariant cache hit.
[2023-03-09 15:03:32] [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.
[2023-03-09 15:03:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 15:03:32] [INFO ] Invariant cache hit.
[2023-03-09 15:03:32] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 5/5 places, 4/4 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2023-03-09 15:03:33] [INFO ] Invariant cache hit.
[2023-03-09 15:03:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 15:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 15:03:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:03:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:03:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:33] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 15:03:33] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 15:03:33] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12138 reset in 173 ms.
Product exploration explored 100000 steps with 12681 reset in 195 ms.
Built C files in :
/tmp/ltsmin2423526722276405431
[2023-03-09 15:03:33] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-09 15:03:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 15:03:33] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-09 15:03:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 15:03:33] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-09 15:03:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 15:03:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2423526722276405431
Running compilation step : cd /tmp/ltsmin2423526722276405431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 329 ms.
Running link step : cd /tmp/ltsmin2423526722276405431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2423526722276405431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased954297408856359120.hoa' '--buchi-type=spotba'
LTSmin run took 161 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-00 finished in 4112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((p1||G((G(p2) U (p3 U p4)))))))'
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 4 rules applied. Total rules applied 4 place count 24 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 15
Applied a total of 7 rules in 4 ms. Remains 21 /25 variables (removed 4) and now considering 15/18 (removed 3) transitions.
// Phase 1: matrix 15 rows 21 cols
[2023-03-09 15:03:34] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 15:03:34] [INFO ] Implicit Places using invariants in 55 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/25 places, 15/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 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 17 transition count 12
Applied a total of 6 rules in 8 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-09 15:03:34] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 15:03:34] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 15:03:34] [INFO ] Invariant cache hit.
[2023-03-09 15:03:34] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/25 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 17/25 places, 12/18 transitions.
Stuttering acceptance computed with spot in 503 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p4))), (NOT p0), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={0, 1} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={0, 1} source=2 dest: 5}], [{ cond=(OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p4) p3 p2), acceptance={1} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p4) p3 p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p4) p3 p2), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s11 1)), p1:(AND (GEQ s5 1) (GEQ s15 1)), p4:(AND (GEQ s2 1) (GEQ s13 1)), p3:(GEQ s10 1), p2:(GEQ s16 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 10267 reset in 260 ms.
Product exploration explored 100000 steps with 10201 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p4) (NOT p3) p2), (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X p0), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (AND (NOT p1) (NOT p4) p2)), (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))))), (X (X (AND (NOT p1) (NOT p4) p2))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1156 ms. Reduced automaton from 7 states, 31 edges and 5 AP (stutter insensitive) to 6 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Finished random walk after 1186 steps, including 0 resets, run visited all 8 properties in 6 ms. (steps per millisecond=197 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p4) (NOT p3) p2), (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X p0), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (AND (NOT p1) (NOT p4) p2)), (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))))), (X (X (AND (NOT p1) (NOT p4) p2))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p3 (NOT p4))), (F (NOT (AND (NOT p1) p2 (NOT p4)))), (F (OR (AND (NOT p1) p2 p3) (AND (NOT p1) p2 p4))), (F (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3) (AND (NOT p1) p4)))), (F (NOT (AND (NOT p1) p2 (NOT p3) (NOT p4)))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (F (AND (NOT p1) p2 p3 (NOT p4)))]
Knowledge based reduction with 19 factoid took 1461 ms. Reduced automaton from 6 states, 26 edges and 4 AP (stutter sensitive) to 6 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 543 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Stuttering acceptance computed with spot in 453 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
[2023-03-09 15:03:39] [INFO ] Invariant cache hit.
[2023-03-09 15:03:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 15:03:39] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-09 15:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-09 15:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:03:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 15:03:39] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 15:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:39] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-09 15:03:39] [INFO ] Computed and/alt/rep : 11/14/11 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-09 15:03:39] [INFO ] Added : 2 causal constraints over 1 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p4))
Support contains 6 out of 17 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-09 15:03:39] [INFO ] Invariant cache hit.
[2023-03-09 15:03:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 15:03:39] [INFO ] Invariant cache hit.
[2023-03-09 15:03:39] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-09 15:03:39] [INFO ] Invariant cache hit.
[2023-03-09 15:03:39] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 17/17 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3) (NOT p4)), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p3) (AND (NOT p1) p4))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (AND (NOT p1) p2 (NOT p3) (NOT p4))), (X (AND (NOT p1) p2 (NOT p4))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p3) (AND (NOT p1) p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (AND (NOT p1) p2 (NOT p3) (NOT p4)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))))), (X (X (NOT (OR (AND (NOT p1) p2 p3) (AND (NOT p1) p2 p4))))), (X (X (AND (NOT p1) p2 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1111 ms. Reduced automaton from 6 states, 26 edges and 4 AP (stutter sensitive) to 6 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 427 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Finished random walk after 1388 steps, including 1 resets, run visited all 8 properties in 5 ms. (steps per millisecond=277 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3) (NOT p4)), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p3) (AND (NOT p1) p4))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (AND (NOT p1) p2 (NOT p3) (NOT p4))), (X (AND (NOT p1) p2 (NOT p4))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p3) (AND (NOT p1) p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (AND (NOT p1) p2 (NOT p3) (NOT p4)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))))), (X (X (NOT (OR (AND (NOT p1) p2 p3) (AND (NOT p1) p2 p4))))), (X (X (AND (NOT p1) p2 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p4)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p3 (NOT p4))), (F (NOT (AND (NOT p1) p2 (NOT p4)))), (F (OR (AND (NOT p1) p2 p3) (AND (NOT p1) p2 p4))), (F (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3) (AND (NOT p1) p4)))), (F (NOT (AND (NOT p1) p2 (NOT p3) (NOT p4)))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (F (AND (NOT p1) p2 p3 (NOT p4)))]
Knowledge based reduction with 14 factoid took 1137 ms. Reduced automaton from 6 states, 26 edges and 4 AP (stutter sensitive) to 6 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Stuttering acceptance computed with spot in 428 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
[2023-03-09 15:03:43] [INFO ] Invariant cache hit.
[2023-03-09 15:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 15:03:43] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-09 15:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-09 15:03:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:03:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 15:03:43] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 15:03:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:43] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 15:03:43] [INFO ] Computed and/alt/rep : 11/14/11 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 15:03:43] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p4))
Stuttering acceptance computed with spot in 491 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Product exploration explored 100000 steps with 10261 reset in 181 ms.
Product exploration explored 100000 steps with 10273 reset in 190 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 12/12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 17 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-09 15:03:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2023-03-09 15:03:45] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 15:03:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 12/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 17/17 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin12018496361220796673
[2023-03-09 15:03:45] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12018496361220796673
Running compilation step : cd /tmp/ltsmin12018496361220796673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 145 ms.
Running link step : cd /tmp/ltsmin12018496361220796673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12018496361220796673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14616672485224757733.hoa' '--buchi-type=spotba'
LTSmin run took 5318 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-02 finished in 16501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))&&F((G(F(p0))||(!p0&&F(p0))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 15:03:50] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 15:03:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 15:03:50] [INFO ] Invariant cache hit.
[2023-03-09 15:03:50] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-09 15:03:50] [INFO ] Invariant cache hit.
[2023-03-09 15:03:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s14 1)), p1:(AND (GEQ s0 1) (GEQ s13 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-03 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1)))||X(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 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
[2023-03-09 15:03:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 15:03:51] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 530 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 8}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 7}], [{ cond=p1, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 2}, { cond=p0, acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={} source=10 dest: 7}]], initial=0, aps=[p1:(GEQ s10 1), p0:(AND (GEQ s7 1) (GEQ s19 1)), p2:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-05 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p0&&F(p1)))||(p0&&F(p1)&&F(G(p2)))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 15:03:51] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 15:03:51] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 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 4 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(LT s6 1), p1:(GEQ s17 1), p2:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1201 reset in 110 ms.
Product exploration explored 100000 steps with 1223 reset in 220 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 527 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Finished random walk after 1105 steps, including 0 resets, run visited all 8 properties in 9 ms. (steps per millisecond=122 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 10 factoid took 943 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 15:03:54] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 15:03:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:03:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-09 15:03:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:03:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:03:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:54] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-09 15:03:54] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 15:03:54] [INFO ] Added : 14 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 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.
[2023-03-09 15:03:54] [INFO ] Invariant cache hit.
[2023-03-09 15:03:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 15:03:54] [INFO ] Invariant cache hit.
[2023-03-09 15:03:54] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-09 15:03:54] [INFO ] Invariant cache hit.
[2023-03-09 15:03:55] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p0)), (X (NOT (AND p0 p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 940 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Finished random walk after 2353 steps, including 1 resets, run visited all 8 properties in 21 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p0)), (X (NOT (AND p0 p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 15 factoid took 1112 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
[2023-03-09 15:03:57] [INFO ] Invariant cache hit.
[2023-03-09 15:03:57] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 15:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-09 15:03:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:03:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:03:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-09 15:03:57] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-09 15:03:57] [INFO ] Added : 14 causal constraints over 3 iterations in 43 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 1212 reset in 329 ms.
Product exploration explored 100000 steps with 1208 reset in 247 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 17 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 17 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 17 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 11 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-09 15:03:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2023-03-09 15:03:59] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 15:03:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/20 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 16/20 places, 14/18 transitions.
Built C files in :
/tmp/ltsmin4712347625200118449
[2023-03-09 15:03:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4712347625200118449
Running compilation step : cd /tmp/ltsmin4712347625200118449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 204 ms.
Running link step : cd /tmp/ltsmin4712347625200118449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4712347625200118449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1413811128388035227.hoa' '--buchi-type=spotba'
LTSmin run took 463 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-06 finished in 8172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&X(p1))))&&F(p2)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 15:03:59] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 15:03:59] [INFO ] Implicit Places using invariants in 39 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (AND p0 (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s19 1) (GEQ s9 1)), p0:(GEQ s20 1), p1:(OR (LT s11 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3882 steps with 79 reset in 10 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-07 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(((!p1 U (p2||G(!p1)))||(p3&&G(p4)))))))'
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 15:04:00] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 15:04:00] [INFO ] Implicit Places using invariants in 40 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), (NOT p0), (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))), true, (NOT p4), (AND p3 p4 (NOT p2) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p3 p4) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p4) (NOT p2) p1)), acceptance={} source=2 dest: 3}, { cond=(AND p3 p4 (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p1)) (AND (NOT p4) (NOT p2) (NOT p1))), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={} source=4 dest: 3}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(AND p3 p4 (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p3 p4 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s12 1), p3:(GEQ s15 1), p4:(OR (LT s1 1) (LT s17 1)), p2:(AND (LT s16 1) (NOT (AND (GEQ s5 1) (GEQ s14 1)))), p1:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 107 steps with 2 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-08 finished in 425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1&&(p0 U X(p2)))) U X(p2)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 15:04:00] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 15:04:00] [INFO ] Implicit Places using invariants in 39 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GEQ s18 1), p2:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-09 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U !p1) U (X(p3)&&p2)))'
Support contains 8 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
[2023-03-09 15:04:00] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 15:04:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 15:04:00] [INFO ] Invariant cache hit.
[2023-03-09 15:04:00] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-09 15:04:00] [INFO ] Invariant cache hit.
[2023-03-09 15:04:00] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p2) (NOT p3)), true, p1, (NOT p3), (NOT p3), (AND p1 p2 (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p1)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1 p0 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 (NOT p1) (NOT p3)) (AND p2 (NOT p0) (NOT p3))), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p1 p0 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s13 1) (GEQ s11 1) (GEQ s17 1)), p1:(OR (LT s11 1) (LT s17 1)), p0:(AND (GEQ s3 1) (GEQ s14 1)), p3:(AND (GEQ s5 1) (GEQ s15 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-10 finished in 523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(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
[2023-03-09 15:04:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 15:04:01] [INFO ] Implicit Places using invariants in 48 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(GEQ s10 1), p1:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1016 reset in 110 ms.
Product exploration explored 100000 steps with 1025 reset in 116 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 (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 613 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=153 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 328 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 15:04:03] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 15:04:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:04:03] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 15:04:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:04:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 15:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:04:03] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-09 15:04:03] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 15:04:03] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-09 15:04:03] [INFO ] Invariant cache hit.
[2023-03-09 15:04:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:04:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-09 15:04:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:04:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:04:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-09 15:04:03] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 15:04:03] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 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.
[2023-03-09 15:04:03] [INFO ] Invariant cache hit.
[2023-03-09 15:04:03] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 15:04:03] [INFO ] Invariant cache hit.
[2023-03-09 15:04:03] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-09 15:04:03] [INFO ] Invariant cache hit.
[2023-03-09 15:04:03] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 613 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=613 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 393 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
[2023-03-09 15:04:04] [INFO ] Invariant cache hit.
[2023-03-09 15:04:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:04:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-09 15:04:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:04:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:04:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:04:04] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-09 15:04:04] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 15:04:04] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-09 15:04:04] [INFO ] Invariant cache hit.
[2023-03-09 15:04:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:04:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 15:04:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:04:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 15:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:04:05] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-09 15:04:05] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 15:04:05] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1005 reset in 177 ms.
Product exploration explored 100000 steps with 1022 reset in 203 ms.
Built C files in :
/tmp/ltsmin10975337448339943646
[2023-03-09 15:04:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10975337448339943646
Running compilation step : cd /tmp/ltsmin10975337448339943646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 159 ms.
Running link step : cd /tmp/ltsmin10975337448339943646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10975337448339943646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18164438172220871795.hoa' '--buchi-type=spotba'
LTSmin run took 4160 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-12 finished in 8879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 3 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 3 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 3 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
[2023-03-09 15:04:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 15:04:10] [INFO ] Implicit Places using invariants in 24 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Applied a total of 2 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-09 15:04:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 15:04:10] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-09 15:04:10] [INFO ] Invariant cache hit.
[2023-03-09 15:04:10] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 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 SI_LTL mode , in 2 iterations and 83 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 66037 steps with 0 reset in 51 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-13 finished in 182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(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 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 6 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-09 15:04:10] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 15:04:10] [INFO ] Implicit Places using invariants in 31 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 8 transition count 7
Applied a total of 6 rules in 2 ms. Remains 8 /11 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-09 15:04:10] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 15:04:10] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 15:04:10] [INFO ] Invariant cache hit.
[2023-03-09 15:04:10] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 8/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s7 1) (GEQ s6 1)), p1:(OR (GEQ s7 1) (AND (GEQ s2 1) (GEQ s5 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]]
Stuttering criterion allowed to conclude after 36049 steps with 756 reset in 45 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-14 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0 U (X((p1&&G(p2)))||G(p0)))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 15:04:10] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 15:04:10] [INFO ] Implicit Places using invariants in 41 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}, { cond=p0, acceptance={1} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LT s9 1), p1:(GEQ s10 1), p2:(AND (GEQ s8 1) (GEQ s14 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 362 ms.
Product exploration explored 100000 steps with 1 reset in 452 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 314 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1541 steps, including 0 resets, run visited all 9 properties in 17 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 p2)), (F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 7 factoid took 682 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 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 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 15:04:13] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 15:04:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 15:04:13] [INFO ] Invariant cache hit.
[2023-03-09 15:04:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-09 15:04:13] [INFO ] Invariant cache hit.
[2023-03-09 15:04:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 471 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10020 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=501 ) properties (out of 9) seen :8
Finished Best-First random walk after 500 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=166 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 p2)), (F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 7 factoid took 632 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 188 ms.
Product exploration explored 100000 steps with 1 reset in 245 ms.
Built C files in :
/tmp/ltsmin17145088322472667833
[2023-03-09 15:04:16] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17145088322472667833
Running compilation step : cd /tmp/ltsmin17145088322472667833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 115 ms.
Running link step : cd /tmp/ltsmin17145088322472667833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17145088322472667833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3404935943428153797.hoa' '--buchi-type=spotba'
LTSmin run took 65 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-15 finished in 6510 ms.
All properties solved by simple procedures.
Total runtime 48833 ms.

BK_STOP 1678374258323

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0020P3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-smll-167814396200292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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