Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521900293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r087-tall-171620521900293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 23:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 22:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K May 18 16:42 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 1716256805002

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=gold2023
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 202304061127
[2024-05-21 02:00:06] [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]
[2024-05-21 02:00:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:00:06] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2024-05-21 02:00:06] [INFO ] Transformed 25 places.
[2024-05-21 02:00:06] [INFO ] Transformed 18 transitions.
[2024-05-21 02:00:06] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-21 02:00:06] [INFO ] Computed 8 invariants in 14 ms
[2024-05-21 02:00:07] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-21 02:00:07] [INFO ] Invariant cache hit.
[2024-05-21 02:00:07] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-21 02:00:07] [INFO ] Invariant cache hit.
[2024-05-21 02:00:07] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 20 out of 25 places after structural reductions.
[2024-05-21 02:00:07] [INFO ] Flatten gal took : 15 ms
[2024-05-21 02:00:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:00:07] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 1476 steps, including 0 resets, run visited all 14 properties in 21 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
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.202304061127/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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 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 10 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-21 02:00:07] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 02:00:07] [INFO ] Implicit Places using invariants in 26 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 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 1 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-21 02:00:07] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 02:00:07] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 02:00:07] [INFO ] Invariant cache hit.
[2024-05-21 02:00:07] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 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 75 ms. Remains : 5/25 places, 4/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 176 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 13712 reset in 181 ms.
Product exploration explored 100000 steps with 13413 reset in 138 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 138 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 77 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 )
Parikh walk visited 0 properties in 0 ms.
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 267 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-21 02:00:08] [INFO ] Invariant cache hit.
[2024-05-21 02:00:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 02:00:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 02:00:08] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 02:00:08] [INFO ] Added : 2 causal constraints over 1 iterations in 5 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 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-21 02:00:08] [INFO ] Invariant cache hit.
[2024-05-21 02:00:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 02:00:09] [INFO ] Invariant cache hit.
[2024-05-21 02:00:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 02:00:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:00:09] [INFO ] Invariant cache hit.
[2024-05-21 02:00:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 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 102 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 91 ms :[(NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
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 117 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-05-21 02:00:09] [INFO ] Invariant cache hit.
[2024-05-21 02:00:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 02:00:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:09] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-21 02:00:09] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:00:09] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12845 reset in 99 ms.
Product exploration explored 100000 steps with 13276 reset in 106 ms.
Built C files in :
/tmp/ltsmin394083087971142598
[2024-05-21 02:00:09] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-21 02:00:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:09] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-21 02:00:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:09] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-21 02:00:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:09] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin394083087971142598
Running compilation step : cd /tmp/ltsmin394083087971142598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin394083087971142598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin394083087971142598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4711152895205790513.hoa' '--buchi-type=spotba'
LTSmin run took 104 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 2643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 5 ms. Remains 21 /25 variables (removed 4) and now considering 15/18 (removed 3) transitions.
// Phase 1: matrix 15 rows 21 cols
[2024-05-21 02:00:10] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 02:00:10] [INFO ] Implicit Places using invariants in 33 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 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 4 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-21 02:00:10] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 02:00:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 02:00:10] [INFO ] Invariant cache hit.
[2024-05-21 02:00:10] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 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 107 ms. Remains : 17/25 places, 12/18 transitions.
Stuttering acceptance computed with spot in 344 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 179 ms.
Product exploration explored 100000 steps with 10202 reset in 132 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 (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X (AND (NOT p1) (NOT p4) 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 (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X (AND (NOT p1) (NOT p4) 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 (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 173 ms. Reduced automaton from 7 states, 31 edges and 5 AP (stutter insensitive) to 14 states, 53 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 649 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)), false, false, false, false, false, false, false, false]
Finished random walk after 3077 steps, including 0 resets, run visited all 16 properties in 22 ms. (steps per millisecond=139 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p4) (NOT p3) p2), (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X (AND (NOT p1) (NOT p4) 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 (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X (AND (NOT p1) (NOT p4) 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 (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2))))]
False Knowledge obtained : [(F (AND p1 p4 (NOT p3) p2)), (F (AND p1 p4 (NOT p3) (NOT p2))), (F (AND p1 p4 p3 (NOT p2))), (F (AND (NOT p1) (NOT p4) p3 p2)), (F (AND p1 (NOT p4) (NOT p3) p2)), (F (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))), (F (AND p1 (NOT p4) (NOT p3) (NOT p2))), (F (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))), (F (AND p1 (NOT p4) p3 p2)), (F (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))), (F (AND p1 (NOT p4) p3 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p4) (NOT p3) p2))), (F (AND (NOT p1) (NOT p4) p3 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p4) p2))), (F (NOT (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (F (AND p1 p4 p3 p2))]
Knowledge based reduction with 19 factoid took 756 ms. Reduced automaton from 14 states, 53 edges and 4 AP (stutter insensitive) to 14 states, 53 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 635 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)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 722 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)), false, false, false, false, false, false, false, false]
[2024-05-21 02:00:14] [INFO ] Invariant cache hit.
[2024-05-21 02:00:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 02:00:14] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 02:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 02:00:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:14] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 02:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:14] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-21 02:00:14] [INFO ] Computed and/alt/rep : 11/14/11 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 02:00:14] [INFO ] Added : 2 causal constraints over 1 iterations in 13 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 SI_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.
[2024-05-21 02:00:14] [INFO ] Invariant cache hit.
[2024-05-21 02:00:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 02:00:14] [INFO ] Invariant cache hit.
[2024-05-21 02:00:14] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 02:00:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:00:14] [INFO ] Invariant cache hit.
[2024-05-21 02:00:14] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 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) (NOT p4) (NOT p3) p2), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (AND (NOT p1) (NOT p4) p2)), (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (NOT (AND p1 (NOT p4) p3 p2))), (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X (NOT (AND p1 (NOT p4) p3 (NOT p2)))), (X (NOT (AND p1 p4 p3 (NOT p2)))), (X (NOT (AND p1 (NOT p4) (NOT p3) p2))), (X (NOT (AND p1 p4 (NOT p3) p2))), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT (AND p1 p4 (NOT p3) (NOT p2)))), (X (NOT (AND p1 p4 p3 p2))), (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p4) p2))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2)))), (X (X (NOT (AND p1 (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 p4 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 p4 (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p4 p3 p2)))), (X (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 203 ms. Reduced automaton from 14 states, 53 edges and 4 AP (stutter insensitive) to 14 states, 53 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 669 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)), false, false, false, false, false, false, false, false]
Finished random walk after 7142 steps, including 2 resets, run visited all 16 properties in 28 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p4) (NOT p3) p2), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (AND (NOT p1) (NOT p4) p2)), (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (NOT (AND p1 (NOT p4) p3 p2))), (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X (NOT (AND p1 (NOT p4) p3 (NOT p2)))), (X (NOT (AND p1 p4 p3 (NOT p2)))), (X (NOT (AND p1 (NOT p4) (NOT p3) p2))), (X (NOT (AND p1 p4 (NOT p3) p2))), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT (AND p1 p4 (NOT p3) (NOT p2)))), (X (NOT (AND p1 p4 p3 p2))), (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p4) p2))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2)))), (X (X (NOT (AND p1 (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND p1 p4 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) p2)))), (X (X (NOT (AND p1 p4 (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p4 p3 p2)))), (X (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))))]
False Knowledge obtained : [(F (AND p1 p4 (NOT p3) p2)), (F (AND p1 p4 (NOT p3) (NOT p2))), (F (AND p1 p4 p3 (NOT p2))), (F (AND (NOT p1) (NOT p4) p3 p2)), (F (AND p1 (NOT p4) (NOT p3) p2)), (F (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))), (F (AND p1 (NOT p4) (NOT p3) (NOT p2))), (F (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))), (F (AND p1 (NOT p4) p3 p2)), (F (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))), (F (AND p1 (NOT p4) p3 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p4) (NOT p3) p2))), (F (AND (NOT p1) (NOT p4) p3 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p4) p2))), (F (NOT (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (F (AND p1 p4 p3 p2))]
Knowledge based reduction with 33 factoid took 903 ms. Reduced automaton from 14 states, 53 edges and 4 AP (stutter insensitive) to 14 states, 53 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 648 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)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 644 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)), false, false, false, false, false, false, false, false]
[2024-05-21 02:00:17] [INFO ] Invariant cache hit.
[2024-05-21 02:00:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:17] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 02:00:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 02:00:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-21 02:00:17] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 02:00:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 02:00:17] [INFO ] Computed and/alt/rep : 11/14/11 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:00:17] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p4))
Stuttering acceptance computed with spot in 641 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)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 10336 reset in 134 ms.
Product exploration explored 100000 steps with 10268 reset in 148 ms.
Built C files in :
/tmp/ltsmin14165663547374859064
[2024-05-21 02:00:18] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 02:00:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:18] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 02:00:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:18] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 02:00:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:18] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14165663547374859064
Running compilation step : cd /tmp/ltsmin14165663547374859064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin14165663547374859064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14165663547374859064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3645583153205245973.hoa' '--buchi-type=spotba'
LTSmin run took 5339 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-02 finished in 13640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(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 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:00:23] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 02:00:23] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 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 32 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 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 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(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.
[2024-05-21 02:00:24] [INFO ] Invariant cache hit.
[2024-05-21 02:00:24] [INFO ] Implicit Places using invariants in 61 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 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 63 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-05 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 s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2237 reset in 87 ms.
Product exploration explored 100000 steps with 2231 reset in 112 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Finished random walk after 899 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=449 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 02:00:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:00:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-05 finished in 869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:00:24] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:00:25] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) 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=p0, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT 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=p0, acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT 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:(GEQ 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 1190 reset in 100 ms.
Product exploration explored 100000 steps with 1206 reset in 96 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) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 111 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), false, false, false, false]
Finished random walk after 6981 steps, including 2 resets, run visited all 12 properties in 11 ms. (steps per millisecond=634 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F p1), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND p0 p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 452 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), false, false, false, false]
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), false, false, false, false]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 02:00:26] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:00:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 02:00:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 02:00:26] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:00:26] [INFO ] Added : 14 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (NOT p1)
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.
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 20 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 16 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 14 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 14 transition count 8
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 20 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 9 transition count 7
Applied a total of 22 rules in 9 ms. Remains 9 /20 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-21 02:00:26] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 02:00:26] [INFO ] Implicit Places using invariants in 25 ms returned [8]
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 : 8/20 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37 ms. Remains : 8/20 places, 7/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 224 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), false, false, false, false]
Finished random walk after 982 steps, including 0 resets, run visited all 12 properties in 5 ms. (steps per millisecond=196 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F p1), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND p0 p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 23 factoid took 968 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), false, false, false, false]
Stuttering acceptance computed with spot in 389 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), false, false, false, false]
// Phase 1: matrix 7 rows 8 cols
[2024-05-21 02:00:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 02:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 02:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 02:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 02:00:29] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 02:00:29] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), false, false, false, false]
Product exploration explored 100000 steps with 5646 reset in 79 ms.
Stack based approach found an accepted trace after 26076 steps with 1486 reset with depth 84 and stack size 84 in 18 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-06 finished in 4624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
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.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 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 2 with 4 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 3 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 02:00:29] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:00:29] [INFO ] Implicit Places using invariants in 21 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-21 02:00:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 02:00:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 02:00:29] [INFO ] Invariant cache hit.
[2024-05-21 02:00:29] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s6 1), p0:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Product exploration explored 100000 steps with 50000 reset in 53 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 (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-07 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0) U p1)&&(G(!p1)||G(!p2))) U !p0))'
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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 17 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 8 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2024-05-21 02:00:29] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:00:29] [INFO ] Implicit Places using invariants in 20 ms returned [12]
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 : 12/25 places, 10/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 12/25 places, 10/18 transitions.
Stuttering acceptance computed with spot in 220 ms :[p0, true, (NOT p1), p1, p2, (AND p1 p2), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=0 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LT s11 1), p1:(GEQ s6 1), p2:(AND (GEQ s2 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 21 steps with 2 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-09 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(p0 U X(G(p1)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:00:30] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:00:30] [INFO ] Implicit Places using invariants in 25 ms returned [14]
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 : 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 37 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s16 1), p1:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4557 reset in 79 ms.
Product exploration explored 100000 steps with 4485 reset in 78 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 105 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 367 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=367 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 123 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 02:00:30] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:00:30] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 02:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 02:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 02:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 02:00:30] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:00:30] [INFO ] Added : 9 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 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 : 20/20 places, 18/18 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 11
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 13 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 13 transition count 7
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 22 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 8 transition count 6
Applied a total of 24 rules in 2 ms. Remains 8 /20 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-21 02:00:30] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 02:00:31] [INFO ] Implicit Places using invariants in 21 ms returned [7]
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 : 7/20 places, 6/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24 ms. Remains : 7/20 places, 6/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 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 97 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 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
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 127 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 6 rows 7 cols
[2024-05-21 02:00:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 02:00:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 02:00:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 02:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:31] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-21 02:00:31] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 02:00:31] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12707 reset in 57 ms.
Product exploration explored 100000 steps with 12776 reset in 82 ms.
Built C files in :
/tmp/ltsmin2308690858839176273
[2024-05-21 02:00:31] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-21 02:00:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:31] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-21 02:00:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:31] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-21 02:00:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:31] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2308690858839176273
Running compilation step : cd /tmp/ltsmin2308690858839176273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin2308690858839176273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin2308690858839176273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1295583154516800904.hoa' '--buchi-type=spotba'
LTSmin run took 165 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-11 finished in 1866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 2 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-21 02:00:32] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 02:00:32] [INFO ] Implicit Places using invariants in 22 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 8/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 11 transition count 6
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 6
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 5
Deduced a syphon composed of 1 places in 1 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 5
Applied a total of 6 rules in 2 ms. Remains 8 /11 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-05-21 02:00:32] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:00:32] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 02:00:32] [INFO ] Invariant cache hit.
[2024-05-21 02:00:32] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 8/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-12 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:(AND (GEQ s2 1) (GEQ s6 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 13871 reset in 55 ms.
Product exploration explored 100000 steps with 13978 reset in 57 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 76 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 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 203 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 77 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-05-21 02:00:32] [INFO ] Invariant cache hit.
[2024-05-21 02:00:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 02:00:32] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:00:32] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-21 02:00:32] [INFO ] Invariant cache hit.
[2024-05-21 02:00:32] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 02:00:32] [INFO ] Invariant cache hit.
[2024-05-21 02:00:32] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-21 02:00:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:00:32] [INFO ] Invariant cache hit.
[2024-05-21 02:00:32] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 8/8 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 203 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 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 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-05-21 02:00:33] [INFO ] Invariant cache hit.
[2024-05-21 02:00:33] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-21 02:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:33] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 02:00:33] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 02:00:33] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13780 reset in 54 ms.
Product exploration explored 100000 steps with 13774 reset in 62 ms.
Built C files in :
/tmp/ltsmin9111224147627786600
[2024-05-21 02:00:33] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-21 02:00:33] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:33] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-21 02:00:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:33] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-21 02:00:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9111224147627786600
Running compilation step : cd /tmp/ltsmin9111224147627786600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin9111224147627786600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9111224147627786600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14366164321141592476.hoa' '--buchi-type=spotba'
LTSmin run took 390 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-12 finished in 1844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F((!p1||G(p2)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 0 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:00:34] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:00:34] [INFO ] Implicit Places using invariants in 33 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 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 34 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
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={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LT s10 1), p2:(GEQ s15 1), p1:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 264 reset in 114 ms.
Product exploration explored 100000 steps with 311 reset in 137 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 p2) p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 170 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 860 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=430 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (F (AND p1 p2)), (F (NOT p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
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.
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 6 rules applied. Total rules applied 6 place count 20 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 13 transition count 10
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 12 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 20 place count 10 transition count 8
Applied a total of 20 rules in 11 ms. Remains 10 /20 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-05-21 02:00:35] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 02:00:35] [INFO ] Implicit Places using invariants in 23 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/20 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36 ms. Remains : 9/20 places, 8/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge based reduction with 8 factoid took 199 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 1696 steps, including 2 resets, run visited all 4 properties in 6 ms. (steps per millisecond=282 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (AND p1 p2)), (F (NOT p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 8 factoid took 321 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 88 reset in 67 ms.
Product exploration explored 100000 steps with 85 reset in 74 ms.
Built C files in :
/tmp/ltsmin16389497424327194814
[2024-05-21 02:00:36] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-21 02:00:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:36] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-21 02:00:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:36] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-21 02:00:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:36] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16389497424327194814
Running compilation step : cd /tmp/ltsmin16389497424327194814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin16389497424327194814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16389497424327194814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3085775699251094564.hoa' '--buchi-type=spotba'
LTSmin run took 450 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-13 finished in 3217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&F(p1)) U (p0||X(G(p1)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 20 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 8 place count 20 transition count 11
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 16 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 15 transition count 10
Applied a total of 18 rules in 7 ms. Remains 15 /25 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 15 cols
[2024-05-21 02:00:37] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 02:00:37] [INFO ] Implicit Places using invariants in 21 ms returned [9]
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 : 14/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 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 9
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 13 transition count 8
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 12 transition count 8
Applied a total of 4 rules in 2 ms. Remains 12 /14 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-21 02:00:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 02:00:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 02:00:37] [INFO ] Invariant cache hit.
[2024-05-21 02:00:37] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/25 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 12/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s9 1)), p0:(AND (GEQ s3 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13928 reset in 61 ms.
Product exploration explored 100000 steps with 13966 reset in 60 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 83 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
[2024-05-21 02:00:37] [INFO ] Invariant cache hit.
[2024-05-21 02:00:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:37] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 02:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 02:00:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 02:00:37] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-21 02:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:37] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 02:00:37] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:00:37] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-21 02:00:37] [INFO ] Invariant cache hit.
[2024-05-21 02:00:37] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 02:00:37] [INFO ] Invariant cache hit.
[2024-05-21 02:00:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-21 02:00:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:00:37] [INFO ] Invariant cache hit.
[2024-05-21 02:00:37] [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 90 ms. Remains : 12/12 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 71 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 83 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
[2024-05-21 02:00:38] [INFO ] Invariant cache hit.
[2024-05-21 02:00:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:38] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 02:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 02:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:00:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:00:38] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 02:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:00:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 02:00:38] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:00:38] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14008 reset in 51 ms.
Product exploration explored 100000 steps with 13924 reset in 66 ms.
Built C files in :
/tmp/ltsmin3565435577943390506
[2024-05-21 02:00:38] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-21 02:00:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:38] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-21 02:00:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:38] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-21 02:00:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:00:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3565435577943390506
Running compilation step : cd /tmp/ltsmin3565435577943390506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin3565435577943390506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3565435577943390506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17025563435423912576.hoa' '--buchi-type=spotba'
LTSmin run took 287 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-15 finished in 2049 ms.
All properties solved by simple procedures.
Total runtime 32677 ms.

BK_STOP 1716256840103

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r087-tall-171620521900293"
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 ;