Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679102300393.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ServersAndClients-PT-100080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102300393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 13 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.9M May 18 16:43 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 ServersAndClients-PT-100080-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716893567032

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100080
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 10:52:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 10:52:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:52:49] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2024-05-28 10:52:49] [INFO ] Transformed 8481 places.
[2024-05-28 10:52:49] [INFO ] Transformed 16200 transitions.
[2024-05-28 10:52:49] [INFO ] Found NUPN structural information;
[2024-05-28 10:52:49] [INFO ] Parsed PT model containing 8481 places and 16200 transitions and 48800 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ServersAndClients-PT-100080-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100080-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2027 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2024-05-28 10:52:51] [INFO ] Computed 281 invariants in 256 ms
[2024-05-28 10:52:52] [INFO ] Implicit Places using invariants in 1527 ms returned []
Implicit Place search using SMT only with invariants took 1551 ms to find 0 implicit places.
[2024-05-28 10:52:52] [INFO ] Invariant cache hit.
[2024-05-28 10:52:54] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4774 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Support contains 37 out of 8481 places after structural reductions.
[2024-05-28 10:52:55] [INFO ] Flatten gal took : 756 ms
[2024-05-28 10:52:55] [INFO ] Flatten gal took : 512 ms
[2024-05-28 10:52:56] [INFO ] Input system was already deterministic with 16200 transitions.
Support contains 32 out of 8481 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 23) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2024-05-28 10:52:57] [INFO ] Invariant cache hit.
[2024-05-28 10:53:00] [INFO ] [Real]Absence check using 181 positive place invariants in 531 ms returned sat
[2024-05-28 10:53:00] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 168 ms returned sat
[2024-05-28 10:53:15] [INFO ] After 14486ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2
[2024-05-28 10:53:16] [INFO ] After 16024ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 881 ms.
[2024-05-28 10:53:17] [INFO ] After 19856ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Parikh walk visited 1 properties in 27 ms.
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8481 transition count 8201
Reduce places removed 8078 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 1 with 15878 rules applied. Total rules applied 23877 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 23976 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 24273 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 3 with 396 rules applied. Total rules applied 24669 place count 7 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 24670 place count 6 transition count 5
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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 24673 place count 4 transition count 4
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 5 with 2 rules applied. Total rules applied 24675 place count 3 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 24676 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 24677 place count 2 transition count 2
Applied a total of 24677 rules in 193 ms. Remains 2 /8481 variables (removed 8479) and now considering 2/16200 (removed 16198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 2/8481 places, 2/16200 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8481 transition count 8201
Reduce places removed 8078 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 1 with 15878 rules applied. Total rules applied 23877 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 23976 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 24273 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 24668 place count 7 transition count 6
Applied a total of 24668 rules in 164 ms. Remains 7 /8481 variables (removed 8474) and now considering 6/16200 (removed 16194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-28 10:53:18] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 10:53:18] [INFO ] Implicit Places using invariants in 23 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8481 places, 6/16200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 4 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 10:53:18] [INFO ] Computed 1 invariants in 2 ms
[2024-05-28 10:53:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 10:53:18] [INFO ] Invariant cache hit.
[2024-05-28 10:53:18] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/8481 places, 3/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 2/8481 places, 3/16200 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14245 reset in 183 ms.
Product exploration explored 100000 steps with 14232 reset in 93 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-05-28 10:53:19] [INFO ] Invariant cache hit.
[2024-05-28 10:53:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 10:53:19] [INFO ] Invariant cache hit.
[2024-05-28 10:53:19] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-28 10:53:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 10:53:19] [INFO ] Invariant cache hit.
[2024-05-28 10:53:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 2/2 places, 3/3 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14254 reset in 95 ms.
Product exploration explored 100000 steps with 14408 reset in 90 ms.
Built C files in :
/tmp/ltsmin10500911385475936775
[2024-05-28 10:53:20] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2024-05-28 10:53:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:53:20] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2024-05-28 10:53:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:53:20] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2024-05-28 10:53:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:53:20] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10500911385475936775
Running compilation step : cd /tmp/ltsmin10500911385475936775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin10500911385475936775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10500911385475936775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8495547030941229748.hoa' '--buchi-type=spotba'
LTSmin run took 299 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100080-LTLFireability-00 finished in 2957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (!p0 U p1))||X(F(p2))))'
Support contains 2 out of 8481 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2020 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2024-05-28 10:53:23] [INFO ] Computed 281 invariants in 114 ms
[2024-05-28 10:53:24] [INFO ] Implicit Places using invariants in 1169 ms returned []
Implicit Place search using SMT only with invariants took 1177 ms to find 0 implicit places.
[2024-05-28 10:53:24] [INFO ] Invariant cache hit.
[2024-05-28 10:53:25] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4393 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s5720 1), p2:(EQ s5367 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8 reset in 3017 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-01 finished in 7587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&p0))||G(!p1)||(!p1&&F(p2))))'
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1778 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
[2024-05-28 10:53:30] [INFO ] Invariant cache hit.
[2024-05-28 10:53:31] [INFO ] Implicit Places using invariants in 1207 ms returned []
Implicit Place search using SMT only with invariants took 1209 ms to find 0 implicit places.
[2024-05-28 10:53:31] [INFO ] Invariant cache hit.
[2024-05-28 10:53:33] [INFO ] Dead Transitions using invariants and state equation in 1284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4275 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 361 ms :[true, (NOT p2), (AND (NOT p0) p1), (OR (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p2:(AND (EQ s291 1) (EQ s5350 1)), p1:(EQ s5396 1), p0:(AND (EQ s291 1) (EQ s5350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 254 reset in 2809 ms.
Product exploration explored 100000 steps with 230 reset in 2917 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p2) p0))), true, (X (X (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 10:53:40] [INFO ] Invariant cache hit.
[2024-05-28 10:53:42] [INFO ] [Real]Absence check using 181 positive place invariants in 481 ms returned sat
[2024-05-28 10:53:42] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 159 ms returned sat
[2024-05-28 10:53:42] [INFO ] After 2178ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-28 10:53:44] [INFO ] [Nat]Absence check using 181 positive place invariants in 734 ms returned sat
[2024-05-28 10:53:44] [INFO ] [Nat]Absence check using 181 positive and 100 generalized place invariants in 163 ms returned sat
[2024-05-28 10:53:57] [INFO ] After 12901ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-28 10:53:58] [INFO ] After 13614ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 448 ms.
[2024-05-28 10:53:59] [INFO ] After 16537ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p2) p0))), true, (X (X (NOT p2))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F p2), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 566 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), false, (AND (NOT p2) p1), false, false]
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), false, (AND (NOT p2) p1), false, false]
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7821 transitions
Trivial Post-agglo rules discarded 7821 transitions
Performed 7821 trivial Post agglomeration. Transition count delta: 7821
Iterating post reduction 0 with 7821 rules applied. Total rules applied 7821 place count 8481 transition count 8379
Reduce places removed 7821 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 7900 rules applied. Total rules applied 15721 place count 660 transition count 8300
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 2 with 7958 rules applied. Total rules applied 23679 place count 502 transition count 500
Applied a total of 23679 rules in 144 ms. Remains 502 /8481 variables (removed 7979) and now considering 500/16200 (removed 15700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2024-05-28 10:54:00] [INFO ] Computed 202 invariants in 11 ms
[2024-05-28 10:54:00] [INFO ] Implicit Places using invariants in 367 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 369 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/8481 places, 500/16200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 6 transition count 106
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 5 transition count 7
Applied a total of 297 rules in 6 ms. Remains 5 /302 variables (removed 297) and now considering 7/500 (removed 493) transitions.
// Phase 1: matrix 7 rows 5 cols
[2024-05-28 10:54:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 10:54:00] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 10:54:00] [INFO ] Invariant cache hit.
[2024-05-28 10:54:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/8481 places, 7/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 564 ms. Remains : 5/8481 places, 7/16200 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) (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 482 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 316 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 10:54:01] [INFO ] Invariant cache hit.
[2024-05-28 10:54:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 10:54:01] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F p2), (F (AND (NOT p2) p1))]
Knowledge based reduction with 6 factoid took 660 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), false, false, false]
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), false, false, false]
Stuttering acceptance computed with spot in 254 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), false, false, false]
Product exploration explored 100000 steps with 20211 reset in 110 ms.
Product exploration explored 100000 steps with 20058 reset in 101 ms.
Built C files in :
/tmp/ltsmin5141894959761948585
[2024-05-28 10:54:03] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-28 10:54:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:54:03] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-28 10:54:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:54:03] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-28 10:54:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:54:03] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5141894959761948585
Running compilation step : cd /tmp/ltsmin5141894959761948585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 112 ms.
Running link step : cd /tmp/ltsmin5141894959761948585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin5141894959761948585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1663498851787976935.hoa' '--buchi-type=spotba'
LTSmin run took 98 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100080-LTLFireability-02 finished in 34893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7821 transitions
Trivial Post-agglo rules discarded 7821 transitions
Performed 7821 trivial Post agglomeration. Transition count delta: 7821
Iterating post reduction 0 with 7821 rules applied. Total rules applied 7821 place count 8481 transition count 8379
Reduce places removed 7821 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 7900 rules applied. Total rules applied 15721 place count 660 transition count 8300
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 2 with 7958 rules applied. Total rules applied 23679 place count 502 transition count 500
Applied a total of 23679 rules in 116 ms. Remains 502 /8481 variables (removed 7979) and now considering 500/16200 (removed 15700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2024-05-28 10:54:03] [INFO ] Computed 202 invariants in 2 ms
[2024-05-28 10:54:04] [INFO ] Implicit Places using invariants in 619 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 626 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/8481 places, 500/16200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 6 transition count 106
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 4 transition count 6
Applied a total of 299 rules in 4 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-05-28 10:54:04] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 10:54:04] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 10:54:04] [INFO ] Invariant cache hit.
[2024-05-28 10:54:04] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/8481 places, 6/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 789 ms. Remains : 4/8481 places, 6/16200 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-03 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 (NEQ s0 1) (NEQ s2 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 60 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 3 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-03 finished in 976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1 U X(p2))))))'
Support contains 6 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1613 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2024-05-28 10:54:06] [INFO ] Computed 281 invariants in 92 ms
[2024-05-28 10:54:07] [INFO ] Implicit Places using invariants in 1291 ms returned []
Implicit Place search using SMT only with invariants took 1295 ms to find 0 implicit places.
[2024-05-28 10:54:07] [INFO ] Invariant cache hit.
[2024-05-28 10:54:08] [INFO ] Dead Transitions using invariants and state equation in 1177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4115 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s349 1) (EQ s1310 1)), p0:(AND (EQ s319 1) (EQ s4441 1)), p2:(AND (EQ s301 1) (EQ s5047 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 135 reset in 3043 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-06 finished in 7417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7469 transitions
Trivial Post-agglo rules discarded 7469 transitions
Performed 7469 trivial Post agglomeration. Transition count delta: 7469
Iterating post reduction 0 with 7469 rules applied. Total rules applied 7469 place count 8481 transition count 8731
Reduce places removed 7469 places and 0 transitions.
Performed 231 Post agglomeration using F-continuation condition.Transition count delta: 231
Iterating post reduction 1 with 7700 rules applied. Total rules applied 15169 place count 1012 transition count 8500
Reduce places removed 308 places and 0 transitions.
Ensure Unique test removed 7600 transitions
Reduce isomorphic transitions removed 7600 transitions.
Iterating post reduction 2 with 7908 rules applied. Total rules applied 23077 place count 704 transition count 900
Applied a total of 23077 rules in 329 ms. Remains 704 /8481 variables (removed 7777) and now considering 900/16200 (removed 15300) transitions.
// Phase 1: matrix 900 rows 704 cols
[2024-05-28 10:54:12] [INFO ] Computed 204 invariants in 3 ms
[2024-05-28 10:54:13] [INFO ] Implicit Places using invariants in 575 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 578 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/8481 places, 900/16200 transitions.
Graph (trivial) has 294 edges and 504 vertex of which 195 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 194 places
Ensure Unique test removed 290 transitions
Reduce isomorphic transitions removed 290 transitions.
Discarding 290 places :
Symmetric choice reduction at 0 with 290 rule applications. Total rules 291 place count 20 transition count 320
Iterating global reduction 0 with 290 rules applied. Total rules applied 581 place count 20 transition count 320
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Iterating post reduction 0 with 288 rules applied. Total rules applied 869 place count 20 transition count 32
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 875 place count 14 transition count 26
Iterating global reduction 1 with 6 rules applied. Total rules applied 881 place count 14 transition count 26
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 1 with 2 rules applied. Total rules applied 883 place count 13 transition count 25
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 886 place count 10 transition count 22
Iterating global reduction 1 with 3 rules applied. Total rules applied 889 place count 10 transition count 22
Applied a total of 889 rules in 8 ms. Remains 10 /504 variables (removed 494) and now considering 22/900 (removed 878) transitions.
// Phase 1: matrix 22 rows 10 cols
[2024-05-28 10:54:13] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 10:54:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 10:54:13] [INFO ] Invariant cache hit.
[2024-05-28 10:54:13] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/8481 places, 22/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1012 ms. Remains : 10/8481 places, 22/16200 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s4 0)), p2:(AND (NOT (AND (EQ s1 1) (EQ s6 1))) (NOT (AND (EQ s0 1) (EQ s8 1)))), p1:(AND (EQ s0 1) (EQ s8 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 6446 reset in 102 ms.
Product exploration explored 100000 steps with 6424 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))))]
Knowledge based reduction with 1 factoid took 343 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Finished random walk after 6 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (F (AND (NOT p1) (NOT p2))), (F (OR (NOT p0) (AND p1 (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 435 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-28 10:54:14] [INFO ] Invariant cache hit.
[2024-05-28 10:54:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 10:54:14] [INFO ] Invariant cache hit.
[2024-05-28 10:54:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-28 10:54:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 10:54:14] [INFO ] Invariant cache hit.
[2024-05-28 10:54:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 10/10 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 507 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Finished random walk after 8 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (OR (NOT p0) (AND p1 (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 460 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 6468 reset in 96 ms.
Product exploration explored 100000 steps with 6573 reset in 96 ms.
Built C files in :
/tmp/ltsmin16701059115038931918
[2024-05-28 10:54:16] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-28 10:54:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:54:16] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-28 10:54:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:54:16] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-28 10:54:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:54:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16701059115038931918
Running compilation step : cd /tmp/ltsmin16701059115038931918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 99 ms.
Running link step : cd /tmp/ltsmin16701059115038931918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16701059115038931918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18035936195554172085.hoa' '--buchi-type=spotba'
LTSmin run took 53 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100080-LTLFireability-07 finished in 4623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7820 transitions
Trivial Post-agglo rules discarded 7820 transitions
Performed 7820 trivial Post agglomeration. Transition count delta: 7820
Iterating post reduction 0 with 7820 rules applied. Total rules applied 7820 place count 8481 transition count 8380
Reduce places removed 7820 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 7899 rules applied. Total rules applied 15719 place count 661 transition count 8301
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 7700 transitions
Reduce isomorphic transitions removed 7700 transitions.
Iterating post reduction 2 with 7857 rules applied. Total rules applied 23576 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 23675 place count 504 transition count 502
Applied a total of 23675 rules in 113 ms. Remains 504 /8481 variables (removed 7977) and now considering 502/16200 (removed 15698) transitions.
// Phase 1: matrix 502 rows 504 cols
[2024-05-28 10:54:16] [INFO ] Computed 203 invariants in 2 ms
[2024-05-28 10:54:17] [INFO ] Implicit Places using invariants in 353 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 358 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 303/8481 places, 502/16200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 7 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 1 with 2 rules applied. Total rules applied 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 5 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-28 10:54:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 10:54:17] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 10:54:17] [INFO ] Invariant cache hit.
[2024-05-28 10:54:17] [INFO ] Implicit Places using invariants and state equation in 22 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 : 5/8481 places, 8/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 520 ms. Remains : 5/8481 places, 8/16200 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s4 1), p1:(OR (NEQ s0 1) (NEQ s2 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 3 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-09 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1814 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2024-05-28 10:54:19] [INFO ] Computed 281 invariants in 92 ms
[2024-05-28 10:54:20] [INFO ] Implicit Places using invariants in 1271 ms returned []
Implicit Place search using SMT only with invariants took 1273 ms to find 0 implicit places.
[2024-05-28 10:54:20] [INFO ] Invariant cache hit.
[2024-05-28 10:54:21] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4138 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s192 1) (EQ s200 1) (EQ s6222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-10 finished in 4290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8481 transition count 8201
Reduce places removed 8078 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 1 with 15878 rules applied. Total rules applied 23877 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 23976 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 24273 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 24668 place count 7 transition count 6
Applied a total of 24668 rules in 87 ms. Remains 7 /8481 variables (removed 8474) and now considering 6/16200 (removed 16194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-28 10:54:21] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 10:54:21] [INFO ] Implicit Places using invariants in 24 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8481 places, 6/16200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 10:54:21] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:54:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 10:54:21] [INFO ] Invariant cache hit.
[2024-05-28 10:54:21] [INFO ] Implicit Places using invariants and state equation in 20 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 : 2/8481 places, 3/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 2/8481 places, 3/16200 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-11 finished in 221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p0||F(p1)))))'
Support contains 3 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 1850 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2024-05-28 10:54:23] [INFO ] Computed 281 invariants in 106 ms
[2024-05-28 10:54:25] [INFO ] Implicit Places using invariants in 1285 ms returned []
Implicit Place search using SMT only with invariants took 1287 ms to find 0 implicit places.
[2024-05-28 10:54:25] [INFO ] Invariant cache hit.
[2024-05-28 10:54:26] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4221 ms. Remains : 8481/8481 places, 16200/16200 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s379 1) (EQ s7976 1)), p1:(EQ s1280 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 2703 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-13 finished in 7253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8481 transition count 8201
Reduce places removed 8078 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 1 with 15878 rules applied. Total rules applied 23877 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 23976 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 24273 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 24668 place count 7 transition count 6
Applied a total of 24668 rules in 75 ms. Remains 7 /8481 variables (removed 8474) and now considering 6/16200 (removed 16194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-28 10:54:29] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 10:54:29] [INFO ] Implicit Places using invariants in 227 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 235 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8481 places, 6/16200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 10:54:29] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:54:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 10:54:29] [INFO ] Invariant cache hit.
[2024-05-28 10:54:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/8481 places, 3/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 355 ms. Remains : 2/8481 places, 3/16200 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-14 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 8481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Drop transitions removed 7999 transitions
Trivial Post-agglo rules discarded 7999 transitions
Performed 7999 trivial Post agglomeration. Transition count delta: 7999
Iterating post reduction 0 with 7999 rules applied. Total rules applied 7999 place count 8481 transition count 8201
Reduce places removed 8078 places and 0 transitions.
Ensure Unique test removed 7800 transitions
Reduce isomorphic transitions removed 7800 transitions.
Iterating post reduction 1 with 15878 rules applied. Total rules applied 23877 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 23976 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 24273 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 24668 place count 7 transition count 6
Applied a total of 24668 rules in 76 ms. Remains 7 /8481 variables (removed 8474) and now considering 6/16200 (removed 16194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-28 10:54:29] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 10:54:29] [INFO ] Implicit Places using invariants in 23 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8481 places, 6/16200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 10:54:29] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 10:54:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 10:54:29] [INFO ] Invariant cache hit.
[2024-05-28 10:54:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/8481 places, 3/16200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 2/8481 places, 3/16200 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 0)], 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 14423 reset in 41 ms.
Product exploration explored 100000 steps with 14310 reset in 48 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-05-28 10:54:30] [INFO ] Invariant cache hit.
[2024-05-28 10:54:30] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 10:54:30] [INFO ] Invariant cache hit.
[2024-05-28 10:54:30] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 10:54:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 10:54:30] [INFO ] Invariant cache hit.
[2024-05-28 10:54:30] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 2/2 places, 3/3 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14379 reset in 48 ms.
Product exploration explored 100000 steps with 14391 reset in 48 ms.
Built C files in :
/tmp/ltsmin14791739751248815553
[2024-05-28 10:54:31] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2024-05-28 10:54:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:54:31] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2024-05-28 10:54:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:54:31] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2024-05-28 10:54:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:54:31] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14791739751248815553
Running compilation step : cd /tmp/ltsmin14791739751248815553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin14791739751248815553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14791739751248815553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7617593828420702599.hoa' '--buchi-type=spotba'
LTSmin run took 88 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100080-LTLFireability-15 finished in 2015 ms.
All properties solved by simple procedures.
Total runtime 103030 ms.

BK_STOP 1716893672776

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ServersAndClients-PT-100080, 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 r351-tall-171679102300393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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