Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 8.0K Apr 29 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 12:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 12:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.2K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652690659807

Running Version 202205111006
[2022-05-16 08:44:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 08:44:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 08:44:21] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2022-05-16 08:44:21] [INFO ] Transformed 25 places.
[2022-05-16 08:44:21] [INFO ] Transformed 18 transitions.
[2022-05-16 08:44:21] [INFO ] Parsed PT model containing 25 places and 18 transitions in 143 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 4 formulas.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-16 08:44:21] [INFO ] Computed 8 place invariants in 7 ms
[2022-05-16 08:44:21] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2022-05-16 08:44:21] [INFO ] Computed 8 place invariants in 12 ms
[2022-05-16 08:44:21] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2022-05-16 08:44:21] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 08:44:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
Support contains 23 out of 25 places after structural reductions.
[2022-05-16 08:44:21] [INFO ] Flatten gal took : 16 ms
[2022-05-16 08:44:21] [INFO ] Flatten gal took : 4 ms
[2022-05-16 08:44:21] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 164 steps, including 0 resets, run visited all 18 properties in 40 ms. (steps per millisecond=4 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((G(X(p0)) U p1) U p2)&&F(X(p3))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 08:44:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 08:44:22] [INFO ] Implicit Places using invariants in 31 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p3) p2), true, p2, (NOT p3), (AND p0 p1 p2), p0, (AND p0 p1), (AND p0 p2)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 4}, { cond=(AND p2 p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s5 1), p1:(AND (GEQ s3 1) (GEQ s18 1)), p3:(GEQ s9 1), p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3375 reset in 197 ms.
Product exploration explored 100000 steps with 3298 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 886 ms. Reduced automaton from 8 states, 19 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p3), (NOT p3)]
Finished random walk after 92 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 22 factoid took 752 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p3)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 08:44:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 08:44:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 08:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:44:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 08:44:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:44:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 08:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:44:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 08:44:24] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 08:44:24] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 13 transition count 10
Applied a total of 16 rules in 8 ms. Remains 13 /21 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 08:44:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 08:44:24] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 08:44:24] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-16 08:44:24] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-16 08:44:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 08:44:24] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 08:44:24] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/21 places, 10/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/21 places, 10/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p3)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p3)]
// Phase 1: matrix 10 rows 13 cols
[2022-05-16 08:44:25] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 08:44:25] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 08:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:44:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 08:44:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:44:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 08:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:44:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 08:44:25] [INFO ] Computed and/alt/rep : 9/10/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 08:44:25] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 27 ms :[(NOT p3)]
Product exploration explored 100000 steps with 5933 reset in 152 ms.
Product exploration explored 100000 steps with 6012 reset in 86 ms.
Built C files in :
/tmp/ltsmin8592286860631419139
[2022-05-16 08:44:25] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2022-05-16 08:44:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:44:25] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2022-05-16 08:44:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:44:25] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2022-05-16 08:44:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:44:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8592286860631419139
Running compilation step : cd /tmp/ltsmin8592286860631419139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 204 ms.
Running link step : cd /tmp/ltsmin8592286860631419139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8592286860631419139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5842965020048884867.hoa' '--buchi-type=spotba'
LTSmin run took 655 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-00 finished in 4455 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X((p0 U p1))) U ((p1 U p0)&&F(p0))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 08:44:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 08:44:26] [INFO ] Implicit Places using invariants in 33 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}]], initial=0, aps=[p0:(GEQ s8 1), p1:(GEQ s17 1)], nbAcceptance=1, 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 1305 reset in 114 ms.
Product exploration explored 100000 steps with 1301 reset in 123 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 (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 1138 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 81 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p0)]
Knowledge based reduction with 9 factoid took 478 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 415 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 08:44:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 08:44:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 08:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:44:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 08:44:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:44:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 08:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:44:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 08:44:29] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 08:44:29] [INFO ] Added : 12 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
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.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 08:44:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 08:44:29] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 08:44:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 08:44:29] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 08:44:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 08:44:29] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 18/18 transitions.
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 (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 361 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 337 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 86 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p0)]
Knowledge based reduction with 9 factoid took 430 ms. Reduced automaton from 6 states, 15 edges and 2 AP to 6 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 08:44:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 08:44:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 08:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:44:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 08:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:44:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 08:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:44:31] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-16 08:44:31] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 08:44:31] [INFO ] Added : 12 causal constraints over 3 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1314 reset in 102 ms.
Product exploration explored 100000 steps with 1325 reset in 110 ms.
Built C files in :
/tmp/ltsmin17338920856866204173
[2022-05-16 08:44:31] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17338920856866204173
Running compilation step : cd /tmp/ltsmin17338920856866204173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 75 ms.
Running link step : cd /tmp/ltsmin17338920856866204173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17338920856866204173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12945455873835127249.hoa' '--buchi-type=spotba'
LTSmin run took 696 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-01 finished in 6206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0)&&F(p1)) U (!X(p0) U 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 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 08:44:32] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 08:44:32] [INFO ] Implicit Places using invariants in 23 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) p0), false, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s19 1)), p0:(GEQ s20 1), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 92 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-02 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((X(F(X(F(p1))))&&p0)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 08:44:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 08:44:32] [INFO ] Implicit Places using invariants in 29 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(LT s9 1), p0:(AND (LT s9 1) (GEQ s8 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1531 reset in 85 ms.
Stack based approach found an accepted trace after 91494 steps with 1384 reset with depth 99 and stack size 99 in 92 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-03 finished in 375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||p1)))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 19 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 19 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 15 transition count 11
Applied a total of 17 rules in 4 ms. Remains 15 /25 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 08:44:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 08:44:33] [INFO ] Implicit Places using invariants in 23 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/25 places, 11/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 14/25 places, 11/18 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s8 1)) (AND (GEQ s4 1) (GEQ s9 1))), p1:(AND (GEQ s6 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 85 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 (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-04 finished in 326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p1)&&p0) U !p2)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 19 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 9 place count 19 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 14 transition count 10
Applied a total of 19 rules in 5 ms. Remains 14 /25 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2022-05-16 08:44:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 08:44:33] [INFO ] Implicit Places using invariants in 22 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/25 places, 10/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 13/25 places, 10/18 transitions.
Stuttering acceptance computed with spot in 107 ms :[p2, true, (NOT p1), p2]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s11 1)), p0:(AND (GEQ s4 1) (GEQ s10 1)), p1:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-05 finished in 146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 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 19 place count 14 transition count 10
Applied a total of 19 rules in 3 ms. Remains 14 /25 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2022-05-16 08:44:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 08:44:33] [INFO ] Implicit Places using invariants in 20 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/25 places, 10/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 13 transition count 9
Reduce places removed 2 places and 0 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 1 with 4 rules applied. Total rules applied 5 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 9 transition count 7
Applied a total of 7 rules in 2 ms. Remains 9 /13 variables (removed 4) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 08:44:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 08:44:33] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-16 08:44:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 08:44:33] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 7/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s7 1)), p1:(GEQ s6 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-06 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 08:44:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 08:44:34] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 08:44:34] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-16 08:44:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 08:44:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 08:44:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-09 finished in 177 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 8 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 08:44:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 08:44:34] [INFO ] Implicit Places using invariants in 25 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 8/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 7
Applied a total of 2 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 08:44:34] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 08:44:34] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2022-05-16 08:44:34] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 08:44:34] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 7/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-10 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 s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 80 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 103 in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-10 finished in 215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)||p1))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 13 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 11 transition count 7
Applied a total of 25 rules in 1 ms. Remains 11 /25 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2022-05-16 08:44:34] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 08:44:34] [INFO ] Implicit Places using invariants in 20 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 10/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s8 1)), p1:(GEQ s7 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-11 finished in 192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U (G(p1) U p1)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 08:44:34] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-16 08:44:34] [INFO ] Implicit Places using invariants in 25 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, p1, (AND p1 p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s4 1) (GEQ s14 1)), p0:(OR (NOT (AND (GEQ s4 1) (GEQ s14 1))) (GEQ s9 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][false, false, false]]
Product exploration explored 100000 steps with 2697 reset in 91 ms.
Product exploration explored 100000 steps with 2704 reset in 101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 160 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[true, (AND p0 p1), (AND p0 p1)]
Finished random walk after 356 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 63 ms :[true, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 08:44:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 08:44:35] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 08:44:35] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 08:44:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 08:44:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 08:44:35] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[true, (AND p0 p1), (AND p0 p1)]
Finished random walk after 117 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 90 ms :[true, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 62 ms :[true, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 2691 reset in 103 ms.
Product exploration explored 100000 steps with 2672 reset in 106 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 75 ms :[true, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Performed 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 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 19 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 19 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 19 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 12 rules in 13 ms. Remains 19 /20 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2022-05-16 08:44:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2022-05-16 08:44:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 08:44:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/20 places, 17/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/20 places, 17/18 transitions.
Product exploration explored 100000 steps with 9163 reset in 145 ms.
Product exploration explored 100000 steps with 9176 reset in 128 ms.
Built C files in :
/tmp/ltsmin6836707706967842942
[2022-05-16 08:44:36] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6836707706967842942
Running compilation step : cd /tmp/ltsmin6836707706967842942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1107 ms.
Running link step : cd /tmp/ltsmin6836707706967842942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6836707706967842942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased530881106790487579.hoa' '--buchi-type=spotba'
LTSmin run took 3908 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-14 finished in 7428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 08:44:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 08:44:42] [INFO ] Implicit Places using invariants in 24 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 986 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3472 reset in 77 ms.
Product exploration explored 100000 steps with 3481 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2022-05-16 08:44:43] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 08:44:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 08:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:44:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 08:44:43] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 08:44:43] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 20 transition count 10
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 13 rules applied. Total rules applied 21 place count 11 transition count 6
Reduce places removed 5 places and 0 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 2 with 7 rules applied. Total rules applied 28 place count 6 transition count 4
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 31 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 32 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 34 place count 2 transition count 2
Applied a total of 34 rules in 3 ms. Remains 2 /20 variables (removed 18) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 08:44:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 08:44:43] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 08:44:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 08:44:43] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-16 08:44:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 08:44:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 08:44:43] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/20 places, 2/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/20 places, 2/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-15 finished in 1699 ms.
All properties solved by simple procedures.
Total runtime 22788 ms.

BK_STOP 1652690683860

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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