Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 8.2K Apr 29 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 12:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.1K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652715454691

Running Version 202205111006
[2022-05-16 15:37:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 15:37:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 15:37:36] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-05-16 15:37:36] [INFO ] Transformed 25 places.
[2022-05-16 15:37:36] [INFO ] Transformed 18 transitions.
[2022-05-16 15:37:36] [INFO ] Parsed PT model containing 25 places and 18 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 8 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 15:37:36] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-16 15:37:36] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 15:37:36] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 15:37:36] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 15:37:36] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 15:37:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2022-05-16 15:37:36] [INFO ] Flatten gal took : 16 ms
[2022-05-16 15:37:36] [INFO ] Flatten gal took : 6 ms
[2022-05-16 15:37:36] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16004 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=640 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 24 cols
[2022-05-16 15:37:36] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 15:37:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 15:37:36] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-16 15:37:36] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 15:37:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 15:37:36] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-16 15:37:36] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 15:37:36] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 15:37:36] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 15:37:37] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 15:37:37] [INFO ] Implicit Places using invariants in 40 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s4 1) (LT s18 1)), p0:(AND (GEQ s5 1) (GEQ s14 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 1 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-00 finished in 378 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((p1 U F(!p1)))||p0))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 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 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 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 13 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 17 place count 14 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 2 with 6 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 16 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 15:37:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:37:37] [INFO ] Implicit Places using invariants in 34 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 8/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 7 transition count 6
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 15:37:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 15:37:37] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 15:37:37] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-16 15:37:37] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 6/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s2 1) (GEQ s6 1)), p1:(LT s2 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 12455 reset in 221 ms.
Product exploration explored 100000 steps with 4371 reset in 188 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 372 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 2) seen :0
Finished Best-First random walk after 115 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 15:37:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 15:37:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 15:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:37:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 15:37:38] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 15:37:39] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 15:37:39] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 15:37:39] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 15:37:39] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 15:37:39] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-16 15:37:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 15:37:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 15:37:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 2) seen :0
Finished Best-First random walk after 641 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=213 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
// Phase 1: matrix 6 rows 7 cols
[2022-05-16 15:37:39] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 15:37:39] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 15:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:37:39] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 15:37:39] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 15:37:39] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 11696 reset in 93 ms.
Product exploration explored 100000 steps with 11869 reset in 144 ms.
Built C files in :
/tmp/ltsmin5823891094685829095
[2022-05-16 15:37:40] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-16 15:37:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:37:40] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-16 15:37:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:37:40] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-16 15:37:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:37:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5823891094685829095
Running compilation step : cd /tmp/ltsmin5823891094685829095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin5823891094685829095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5823891094685829095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1298264533618758624.hoa' '--buchi-type=spotba'
LTSmin run took 1532 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-01 finished in 4373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0) U p1)&&(X(p2)||F(p3))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 15:37:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 15:37:41] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 15:37:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 15:37:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 15:37:41] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-16 15:37:41] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR p1 (AND (NOT p2) (NOT p3))), true, (AND (NOT p3) (NOT p2)), (AND p0 p1), (NOT p3), p0]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s19 1)), p3:(GEQ s16 1), p0:(OR (AND (GEQ s2 1) (GEQ s14 1)) (GEQ s16 1)), p2:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24982 reset in 64 ms.
Product exploration explored 100000 steps with 25041 reset in 88 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 p3) (NOT p0) (NOT p2)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 379 ms. Reduced automaton from 6 states, 9 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p3), (NOT p3)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0))), (F p3)]
Knowledge based reduction with 6 factoid took 340 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p3)]
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 15:37:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 15:37:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 15:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:37:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 15:37:43] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 15:37:43] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 1 out of 22 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 : 22/22 places, 18/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 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 21 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 20 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 12 place count 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 15 transition count 11
Applied a total of 14 rules in 4 ms. Remains 15 /22 variables (removed 7) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 15:37:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 15:37:43] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 15:37:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 15:37:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-16 15:37:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2022-05-16 15:37:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 15:37:43] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 11/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/22 places, 11/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p3), (X p3)]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-02 finished in 1773 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(X(G((X(p0)&&p0))))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 15:37:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 15:37:43] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s17 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-03 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(!(!(F(p0)||p1) U p2))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 20 transition count 17
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 5 place count 20 transition count 12
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 14 transition count 11
Applied a total of 17 rules in 6 ms. Remains 14 /24 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-16 15:37:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:37:43] [INFO ] Implicit Places using invariants in 24 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 11/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 13/24 places, 11/18 transitions.
Stuttering acceptance computed with spot in 120 ms :[p2, p2, (AND (NOT p0) p2)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s10 1)), p1:(LT s12 1), p0:(AND (GEQ s4 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2168 reset in 90 ms.
Stack based approach found an accepted trace after 6422 steps with 137 reset with depth 59 and stack size 59 in 8 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-04 finished in 273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 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 6 rules applied. Total rules applied 6 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 13 place count 16 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 3 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 15:37:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:37:44] [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 : 10/24 places, 8/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 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 8 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 8 transition count 5
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 7 transition count 5
Applied a total of 6 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 15:37:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:37:44] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-16 15:37:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:37:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 5/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 56 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-05 finished in 339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(F(G(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 15:37:44] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 15:37:44] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s16 1)), p1:(AND (LT s19 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 227 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 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1600 ) properties (out of 1) seen :0
Finished Best-First random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
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 5 rules applied. Total rules applied 5 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 13 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 11 transition count 8
Applied a total of 20 rules in 6 ms. Remains 11 /21 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-16 15:37:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:37:45] [INFO ] Implicit Places using invariants in 24 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/21 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 10/21 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Stack based approach found an accepted trace after 331 steps with 0 reset with depth 332 and stack size 332 in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-06 finished in 1466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F((F(p0)&&X(X(G(p0)))))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 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 13 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 14 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 3 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2022-05-16 15:37:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 15:37:45] [INFO ] Implicit Places using invariants in 24 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 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 4 place count 8 transition count 6
Applied a total of 4 rules in 4 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 15:37:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:37:45] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-16 15:37:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:37:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 6/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-07 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X((X(p0)||p1))))||F(p2))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 4 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2022-05-16 15:37:46] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 15:37:46] [INFO ] Implicit Places using invariants in 29 ms returned [7, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 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 12 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 11 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 11 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 10 transition count 8
Applied a total of 4 rules in 4 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:37:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 15:37:46] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:37:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:37:46] [INFO ] Implicit Places using invariants and state equation in 29 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 : 10/24 places, 8/18 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s7 1)), p1:(GEQ s8 1), p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15055 reset in 56 ms.
Product exploration explored 100000 steps with 15065 reset in 64 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:37:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 15:37:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:37:46] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 15:37:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 15:37:46] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 15:37:46] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 15:37:46] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:37:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:37:47] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:37:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 15:37:47] [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.
[2022-05-16 15:37:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:37:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 15:37:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 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 p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:37:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:37:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:37:47] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 15:37:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:37:47] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 15:37:47] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 15:37:47] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15122 reset in 56 ms.
Product exploration explored 100000 steps with 15173 reset in 62 ms.
Built C files in :
/tmp/ltsmin17500053101504068685
[2022-05-16 15:37:48] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-16 15:37:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:37:48] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-16 15:37:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:37:48] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-16 15:37:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:37:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17500053101504068685
Running compilation step : cd /tmp/ltsmin17500053101504068685;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin17500053101504068685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17500053101504068685;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15007732222661679601.hoa' '--buchi-type=spotba'
LTSmin run took 13928 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-08 finished in 16351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(p1)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 15:38:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 15:38:02] [INFO ] Implicit Places using invariants in 35 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s13 1)), p0:(OR (GEQ s10 1) (AND (GEQ s1 1) (GEQ s17 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10326 reset in 70 ms.
Product exploration explored 100000 steps with 10166 reset in 63 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=5334 ) properties (out of 1) seen :0
Finished Best-First random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 340 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:03] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 15:38:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 15:38:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 15:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 15:38:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 15:38:03] [INFO ] Added : 12 causal constraints over 3 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 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 17 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 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 13 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 12 transition count 9
Applied a total of 18 rules in 5 ms. Remains 12 /21 variables (removed 9) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-16 15:38:03] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 15:38:03] [INFO ] Implicit Places using invariants in 49 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/21 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/21 places, 9/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 p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 2002 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2002 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
// Phase 1: matrix 9 rows 11 cols
[2022-05-16 15:38:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:38:04] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 15:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:04] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 15:38:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 15:38:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:04] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 15:38:04] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 15:38:04] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 25003 reset in 48 ms.
Product exploration explored 100000 steps with 24934 reset in 49 ms.
Built C files in :
/tmp/ltsmin7318204279753738803
[2022-05-16 15:38:04] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2022-05-16 15:38:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:38:04] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2022-05-16 15:38:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:38:04] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2022-05-16 15:38:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:38:04] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7318204279753738803
Running compilation step : cd /tmp/ltsmin7318204279753738803;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin7318204279753738803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7318204279753738803;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased322764566406256303.hoa' '--buchi-type=spotba'
LTSmin run took 447 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-09 finished in 2336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!((F(p0)&&!p0) U !p0)&&X(p0))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:38:04] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 58 ms.
Product exploration explored 100000 steps with 50000 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :p0
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-11 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(!p0) U G(p1))||p1)))'
Support contains 2 out of 24 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 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 21 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 21 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 16 transition count 12
Applied a total of 14 rules in 2 ms. Remains 16 /24 variables (removed 8) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 16 cols
[2022-05-16 15:38:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 15:38:05] [INFO ] Implicit Places using invariants in 31 ms returned [10, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/24 places, 12/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 14/24 places, 12/18 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15062 reset in 48 ms.
Product exploration explored 100000 steps with 14994 reset in 56 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5003 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
// Phase 1: matrix 12 rows 14 cols
[2022-05-16 15:38:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:38:05] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 15:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 15:38:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 15:38:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 15:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:05] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 15:38:05] [INFO ] Computed and/alt/rep : 11/12/11 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 15:38:05] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 14 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 : 14/14 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 14 cols
[2022-05-16 15:38:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:38:05] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2022-05-16 15:38:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:38:05] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-16 15:38:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2022-05-16 15:38:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:38:05] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Finished Best-First random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
// Phase 1: matrix 12 rows 14 cols
[2022-05-16 15:38:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:38:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 15:38:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 15:38:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:06] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 15:38:06] [INFO ] Computed and/alt/rep : 11/12/11 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 15:38:06] [INFO ] Added : 9 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 15136 reset in 50 ms.
Product exploration explored 100000 steps with 15060 reset in 56 ms.
Built C files in :
/tmp/ltsmin11365725163565811181
[2022-05-16 15:38:06] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2022-05-16 15:38:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:38:06] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2022-05-16 15:38:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:38:06] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2022-05-16 15:38:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:38:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11365725163565811181
Running compilation step : cd /tmp/ltsmin11365725163565811181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin11365725163565811181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11365725163565811181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5114552373339060628.hoa' '--buchi-type=spotba'
LTSmin run took 346 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-12 finished in 1801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(X(F(G(p0))))))&&X(p1)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 15:38:06] [INFO ] Implicit Places using invariants in 33 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/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s14 1)), p0:(OR (LT s17 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 180 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 p1), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[false, (NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2667 ) properties (out of 2) seen :1
Finished Best-First random walk after 901 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=450 )
Knowledge obtained : [(AND (NOT p1) p0), (X p1), true, (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 13 transition count 9
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 18 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 10 transition count 8
Applied a total of 20 rules in 3 ms. Remains 10 /20 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:38:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:38:07] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:38:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:38:07] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-16 15:38:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-16 15:38:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 15:38:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/20 places, 8/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 1) seen :0
Finished Best-First random walk after 144 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=144 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Stack based approach found an accepted trace after 1087 steps with 0 reset with depth 1088 and stack size 1086 in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-13 finished in 1554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X((F(p1)&&p0)))) U p1))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:38:08] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s13 1)), p0:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N1000P0-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-14 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(F(p0)) U (X(p2)&&p1)))||F(X(p3))))'
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-16 15:38:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 15:38:08] [INFO ] Implicit Places using invariants in 22 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N1000P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s14 1)), p3:(AND (GEQ s1 1) (GEQ s17 1)), p0:(AND (GEQ s0 1) (GEQ s13 1)), p2:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9455 reset in 69 ms.
Product exploration explored 100000 steps with 9447 reset in 74 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 783 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 5 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=4001 ) properties (out of 9) seen :0
Finished Best-First random walk after 966 steps, including 0 resets, run visited all 9 properties in 5 ms. (steps per millisecond=193 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F p3), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 13 factoid took 910 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 5 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:38:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:38:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 15:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 15:38:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 15:38:11] [INFO ] Added : 13 causal constraints over 3 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 15:38:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:38:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 15:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 15:38:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 15:38:11] [INFO ] Added : 13 causal constraints over 3 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 7 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 15:38:11] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:38:11] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 15:38:11] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
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 p3) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 611 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 5 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 16004 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 9) seen :0
Finished Best-First random walk after 656 steps, including 0 resets, run visited all 9 properties in 7 ms. (steps per millisecond=93 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F p3), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 13 factoid took 781 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 5 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:13] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 15:38:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:38:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 15:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 15:38:13] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 15:38:13] [INFO ] Added : 13 causal constraints over 3 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:13] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 15:38:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 15:38:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 15:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:38:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 15:38:13] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 15:38:13] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 9500 reset in 65 ms.
Product exploration explored 100000 steps with 9534 reset in 73 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 20 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 20 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 20 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 9 rules in 9 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2022-05-16 15:38:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2022-05-16 15:38:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 15:38:14] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/21 places, 17/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/21 places, 17/18 transitions.
Product exploration explored 100000 steps with 12545 reset in 145 ms.
Product exploration explored 100000 steps with 12689 reset in 122 ms.
Built C files in :
/tmp/ltsmin6194037638620419786
[2022-05-16 15:38:15] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6194037638620419786
Running compilation step : cd /tmp/ltsmin6194037638620419786;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin6194037638620419786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin6194037638620419786;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13286740980768473778.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:30] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 15:38:30] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:38:30] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-16 15:38:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 15:38:30] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin8014818605224864926
[2022-05-16 15:38:30] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8014818605224864926
Running compilation step : cd /tmp/ltsmin8014818605224864926;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin8014818605224864926;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8014818605224864926;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1931027237940564983.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 15:38:45] [INFO ] Flatten gal took : 8 ms
[2022-05-16 15:38:45] [INFO ] Flatten gal took : 2 ms
[2022-05-16 15:38:45] [INFO ] Time to serialize gal into /tmp/LTL9896469967697454716.gal : 1 ms
[2022-05-16 15:38:45] [INFO ] Time to serialize properties into /tmp/LTL7287751691412850261.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9896469967697454716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7287751691412850261.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9896469...266
Read 1 LTL properties
Checking formula 0 : !(((X((G(F("((Uf>=1)&&(MwU>=1))")))U(((X("(StF>=1)"))&&("(CF>=1)"))&&("(Si>=1)"))))||(F(X("((SA>=1)&&(SwA>=1))")))))
Formula 0 simplified : !(X(GF"((Uf>=1)&&(MwU>=1))" U ("(CF>=1)" & "(Si>=1)" & X"(StF>=1)")) | FX"((SA>=1)&&(SwA>=1))")
Detected timeout of ITS tools.
[2022-05-16 15:39:00] [INFO ] Flatten gal took : 9 ms
[2022-05-16 15:39:00] [INFO ] Applying decomposition
[2022-05-16 15:39:00] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph450923628504321656.txt' '-o' '/tmp/graph450923628504321656.bin' '-w' '/tmp/graph450923628504321656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph450923628504321656.bin' '-l' '-1' '-v' '-w' '/tmp/graph450923628504321656.weights' '-q' '0' '-e' '0.001'
[2022-05-16 15:39:00] [INFO ] Decomposing Gal with order
[2022-05-16 15:39:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 15:39:00] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 15:39:00] [INFO ] Flatten gal took : 39 ms
[2022-05-16 15:39:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 15:39:00] [INFO ] Time to serialize gal into /tmp/LTL2431057350917444600.gal : 1 ms
[2022-05-16 15:39:00] [INFO ] Time to serialize properties into /tmp/LTL17284335068497206046.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2431057350917444600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17284335068497206046.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2431057...246
Read 1 LTL properties
Checking formula 0 : !(((X((G(F("((i0.u4.Uf>=1)&&(u1.MwU>=1))")))U(((X("(i4.u6.StF>=1)"))&&("(u3.CF>=1)"))&&("(i4.u6.Si>=1)"))))||(F(X("((i0.u0.SA>=1)&&(i4...173
Formula 0 simplified : !(X(GF"((i0.u4.Uf>=1)&&(u1.MwU>=1))" U ("(i4.u6.Si>=1)" & "(u3.CF>=1)" & X"(i4.u6.StF>=1)")) | FX"((i0.u0.SA>=1)&&(i4.u7.SwA>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin610590503354944719
[2022-05-16 15:39:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin610590503354944719
Running compilation step : cd /tmp/ltsmin610590503354944719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin610590503354944719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin610590503354944719;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(([](<>((LTLAPp0==true))) U (X((LTLAPp2==true))&&(LTLAPp1==true))))||<>(X((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N1000P0-LTLFireability-15 finished in 82120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(F(p0)) U (X(p2)&&p1)))||F(X(p3))))'
[2022-05-16 15:39:30] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
[2022-05-16 15:39:30] [INFO ] Applying decomposition
[2022-05-16 15:39:30] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin10418126947878264717
[2022-05-16 15:39:30] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-16 15:39:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:39:30] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-16 15:39:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:39:30] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-16 15:39:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:39:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10418126947878264717
Running compilation step : cd /tmp/ltsmin10418126947878264717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15825599647959535413.txt' '-o' '/tmp/graph15825599647959535413.bin' '-w' '/tmp/graph15825599647959535413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15825599647959535413.bin' '-l' '-1' '-v' '-w' '/tmp/graph15825599647959535413.weights' '-q' '0' '-e' '0.001'
[2022-05-16 15:39:30] [INFO ] Decomposing Gal with order
[2022-05-16 15:39:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 15:39:30] [INFO ] Removed a total of 2 redundant transitions.
[2022-05-16 15:39:30] [INFO ] Flatten gal took : 3 ms
[2022-05-16 15:39:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 15:39:30] [INFO ] Time to serialize gal into /tmp/LTLFireability15269431271460859056.gal : 8 ms
[2022-05-16 15:39:30] [INFO ] Time to serialize properties into /tmp/LTLFireability11657722707124855535.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15269431271460859056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11657722707124855535.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((X((G(F("((i0.u4.Uf>=1)&&(i2.u1.MwU>=1))")))U(((X("(i1.u2.StF>=1)"))&&("(i1.u2.CF>=1)"))&&("(i1.u2.Si>=1)"))))||(F(X("((i0.u0.SA>=1...179
Formula 0 simplified : !(X(GF"((i0.u4.Uf>=1)&&(i2.u1.MwU>=1))" U ("(i1.u2.CF>=1)" & "(i1.u2.Si>=1)" & X"(i1.u2.StF>=1)")) | FX"((i0.u0.SA>=1)&&(i1.u7.SwA>=...160
Compilation finished in 111 ms.
Running link step : cd /tmp/ltsmin10418126947878264717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin10418126947878264717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(([](<>((LTLAPp0==true))) U (X((LTLAPp2==true))&&(LTLAPp1==true))))||<>(X((LTLAPp3==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: LTL layer: formula: (X(([](<>((LTLAPp0==true))) U (X((LTLAPp2==true))&&(LTLAPp1==true))))||<>(X((LTLAPp3==true))))
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: "(X(([](<>((LTLAPp0==true))) U (X((LTLAPp2==true))&&(LTLAPp1==true))))||<>(X((LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.021: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.080: DFS-FIFO for weak LTL, using special progress label 23
pins2lts-mc-linux64( 0/ 8), 0.080: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.080: State length is 25, there are 30 groups
pins2lts-mc-linux64( 0/ 8), 0.080: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.080: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.080: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.080: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.099: ~100 levels ~960 states ~3056 transitions
pins2lts-mc-linux64( 0/ 8), 0.121: ~197 levels ~1920 states ~6096 transitions
pins2lts-mc-linux64( 0/ 8), 0.280: ~400 levels ~3840 states ~12536 transitions
pins2lts-mc-linux64( 0/ 8), 0.549: ~787 levels ~7680 states ~24688 transitions
pins2lts-mc-linux64( 7/ 8), 0.949: ~1503 levels ~15360 states ~46392 transitions
pins2lts-mc-linux64( 7/ 8), 1.544: ~3042 levels ~30720 states ~95592 transitions
pins2lts-mc-linux64( 2/ 8), 2.442: ~6115 levels ~61440 states ~189736 transitions
pins2lts-mc-linux64( 3/ 8), 2.918: ~12002 levels ~122880 states ~295704 transitions
pins2lts-mc-linux64( 0/ 8), 3.506: ~11919 levels ~245760 states ~599440 transitions
pins2lts-mc-linux64( 3/ 8), 4.772: ~12002 levels ~491520 states ~1197936 transitions
pins2lts-mc-linux64( 3/ 8), 7.320: ~12002 levels ~983040 states ~2335632 transitions
pins2lts-mc-linux64( 3/ 8), 11.429: ~12002 levels ~1966080 states ~4419936 transitions
pins2lts-mc-linux64( 3/ 8), 16.936: ~12002 levels ~3932160 states ~8164952 transitions
pins2lts-mc-linux64( 3/ 8), 22.147: ~12002 levels ~7864320 states ~16484392 transitions
pins2lts-mc-linux64( 6/ 8), 33.242: ~12000 levels ~15728640 states ~39965376 transitions
pins2lts-mc-linux64( 3/ 8), 54.494: ~12002 levels ~31457280 states ~68193080 transitions
pins2lts-mc-linux64( 3/ 8), 89.913: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 89.941:
pins2lts-mc-linux64( 0/ 8), 89.941: mean standard work distribution: 6.0% (states) 7.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 89.941:
pins2lts-mc-linux64( 0/ 8), 89.942: Explored 45718815 states 114998135 transitions, fanout: 2.515
pins2lts-mc-linux64( 0/ 8), 89.942: Total exploration time 89.840 sec (89.780 sec minimum, 89.807 sec on average)
pins2lts-mc-linux64( 0/ 8), 89.942: States per second: 508892, Transitions per second: 1280033
pins2lts-mc-linux64( 0/ 8), 89.942:
pins2lts-mc-linux64( 0/ 8), 89.942: Progress states detected: 12
pins2lts-mc-linux64( 0/ 8), 89.942: Redundant explorations: 39.9554
pins2lts-mc-linux64( 0/ 8), 89.942:
pins2lts-mc-linux64( 0/ 8), 89.942: Queue width: 8B, total height: 96018, memory: 0.73MB
pins2lts-mc-linux64( 0/ 8), 89.942: Tree memory: 505.2MB, 16.2 B/state, compr.: 15.9%
pins2lts-mc-linux64( 0/ 8), 89.942: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 89.942: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 89.942: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 89.942: Est. total memory use: 506.0MB (~1024.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10418126947878264717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(([](<>((LTLAPp0==true))) U (X((LTLAPp2==true))&&(LTLAPp1==true))))||<>(X((LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10418126947878264717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(([](<>((LTLAPp0==true))) U (X((LTLAPp2==true))&&(LTLAPp1==true))))||<>(X((LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 16:00:09] [INFO ] Flatten gal took : 3 ms
[2022-05-16 16:00:09] [INFO ] Time to serialize gal into /tmp/LTLFireability11254277895443003102.gal : 0 ms
[2022-05-16 16:00:09] [INFO ] Time to serialize properties into /tmp/LTLFireability9559779295033542275.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11254277895443003102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9559779295033542275.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !(((X((G(F("((Uf>=1)&&(MwU>=1))")))U(((X("(StF>=1)"))&&("(CF>=1)"))&&("(Si>=1)"))))||(F(X("((SA>=1)&&(SwA>=1))")))))
Formula 0 simplified : !(X(GF"((Uf>=1)&&(MwU>=1))" U ("(CF>=1)" & "(Si>=1)" & X"(StF>=1)")) | FX"((SA>=1)&&(SwA>=1))")
Detected timeout of ITS tools.
[2022-05-16 16:20:47] [INFO ] Flatten gal took : 3 ms
[2022-05-16 16:20:47] [INFO ] Input system was already deterministic with 18 transitions.
[2022-05-16 16:20:47] [INFO ] Transformed 24 places.
[2022-05-16 16:20:47] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 16:20:47] [INFO ] Time to serialize gal into /tmp/LTLFireability10073504890123605743.gal : 1 ms
[2022-05-16 16:20:47] [INFO ] Time to serialize properties into /tmp/LTLFireability11744433014061586280.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10073504890123605743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11744433014061586280.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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