Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 13:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 26 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678269376163

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 09:56:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 09:56:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:56:19] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-08 09:56:19] [INFO ] Transformed 25 places.
[2023-03-08 09:56:19] [INFO ] Transformed 18 transitions.
[2023-03-08 09:56:19] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 19 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-08 09:56:20] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-08 09:56:20] [INFO ] Implicit Places using invariants in 231 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 314 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 20 out of 24 places after structural reductions.
[2023-03-08 09:56:20] [INFO ] Flatten gal took : 34 ms
[2023-03-08 09:56:20] [INFO ] Flatten gal took : 11 ms
[2023-03-08 09:56:20] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10032 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 24 cols
[2023-03-08 09:56:20] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-08 09:56:21] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:56:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 09:56:21] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-08 09:56:21] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:56:21] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 09:56:21] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 84 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 4 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0) U p1)||G((((p2 U p0)&&G(p3))||p1)))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 6 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 09:56:22] [INFO ] Computed 5 place invariants in 21 ms
[2023-03-08 09:56:22] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 09:56:22] [INFO ] Invariant cache hit.
[2023-03-08 09:56:22] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 09:56:22] [INFO ] Invariant cache hit.
[2023-03-08 09:56:22] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 799 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 5}, { cond=(OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3)), acceptance={} source=6 dest: 5}, { cond=(OR p1 (AND p0 p3) (AND p2 p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 s0), p0:(LEQ 1 s19), p2:(LEQ s17 s4), p3:(LEQ s5 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 780 ms.
Product exploration explored 100000 steps with 0 reset in 615 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 p1 (NOT p0) p2 p3), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3))), true, (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X p3)), (X (X (OR p1 (AND p0 p3) (AND p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1540 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10023 steps, including 3 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:56:27] [INFO ] Invariant cache hit.
[2023-03-08 09:56:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 09:56:27] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:56:27] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:56:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 09:56:27] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:56:27] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-08 09:56:27] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 09:56:27] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 850 steps, including 0 resets, run visited all 2 properties in 48 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 48 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3))), true, (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X p3)), (X (X (OR p1 (AND p0 p3) (AND p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p0) p2))), (F (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2)))), (F (OR (AND (NOT p1) p3 p0) (AND (NOT p1) p3 p2))), (F (AND (NOT p1) p3 (NOT p0) p2)), (F (NOT (OR (AND p1 p3 (NOT p0)) (AND p3 (NOT p0) p2)))), (F (NOT (OR p1 (AND p3 p0) (AND p3 p2)))), (F (NOT p3))]
Knowledge based reduction with 18 factoid took 1873 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 348 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:56:29] [INFO ] Invariant cache hit.
[2023-03-08 09:56:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 09:56:29] [INFO ] Invariant cache hit.
[2023-03-08 09:56:30] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-08 09:56:30] [INFO ] Invariant cache hit.
[2023-03-08 09:56:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p3 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 514 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 09:56:31] [INFO ] Invariant cache hit.
[2023-03-08 09:56:31] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 09:56:31] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:56:31] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:56:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 09:56:31] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:56:31] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:56:31] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 09:56:31] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 906 steps, including 0 resets, run visited all 2 properties in 37 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 38 ms.
Knowledge obtained : [(AND p1 p3 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p3)), (F (AND (NOT p1) (NOT p0) p3))]
Knowledge based reduction with 7 factoid took 708 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 2 reset in 323 ms.
Product exploration explored 100000 steps with 1 reset in 531 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 18 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 18 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 18 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 16 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 16 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 22 rules in 26 ms. Remains 16 /22 variables (removed 6) and now considering 13/18 (removed 5) transitions.
[2023-03-08 09:56:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-08 09:56:34] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 09:56:34] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 16/22 places, 13/18 transitions.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 09:56:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 09:56:34] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 09:56:34] [INFO ] Invariant cache hit.
[2023-03-08 09:56:34] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 09:56:34] [INFO ] Invariant cache hit.
[2023-03-08 09:56:34] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 21/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-00 finished in 12612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 21 transition count 8
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 24 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 10 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 8 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 09:56:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 09:56:34] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 09:56:34] [INFO ] Invariant cache hit.
[2023-03-08 09:56:34] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-08 09:56:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:56:34] [INFO ] Invariant cache hit.
[2023-03-08 09:56:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 9/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s7 s8), p0:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11 reset in 195 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-01 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 19 place count 13 transition count 6
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 28 place count 8 transition count 6
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 6 transition count 4
Applied a total of 32 rules in 8 ms. Remains 6 /24 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-08 09:56:35] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 09:56:35] [INFO ] Implicit Places using invariants in 35 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/24 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46 ms. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s4)], 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 4 reset in 337 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-02 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 1 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 09:56:35] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 09:56:35] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 09:56:35] [INFO ] Invariant cache hit.
[2023-03-08 09:56:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-08 09:56:35] [INFO ] Invariant cache hit.
[2023-03-08 09:56:35] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 s3), p1:(LEQ s8 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-03 finished in 507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F((G(!p0)||G(p1))))) U p2))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 15 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 13 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 12 transition count 10
Applied a total of 20 rules in 8 ms. Remains 12 /24 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-08 09:56:36] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 09:56:36] [INFO ] Implicit Places using invariants in 48 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 10/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61 ms. Remains : 11/24 places, 10/18 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), true, (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 3 s5), p0:(LEQ s10 s6), p1:(GT 3 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 76720 steps with 2 reset in 258 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-04 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(X(p1) U ((p2&&X(p1))||X(G(p1)))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 09:56:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 09:56:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 09:56:36] [INFO ] Invariant cache hit.
[2023-03-08 09:56:36] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-08 09:56:36] [INFO ] Invariant cache hit.
[2023-03-08 09:56:36] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 s17), p1:(AND (GT 2 s17) (LEQ 1 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 ClientsAndServers-PT-N0020P4-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-05 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (F((F(p1)&&X(p2)))||X(p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 09:56:37] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 09:56:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 09:56:37] [INFO ] Invariant cache hit.
[2023-03-08 09:56:37] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-08 09:56:37] [INFO ] Invariant cache hit.
[2023-03-08 09:56:37] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s0 s19), p0:(GT 3 s3), p2:(LEQ 2 s16)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 394 ms.
Product exploration explored 100000 steps with 50000 reset in 303 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 p1 p0 (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 10 factoid took 213 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-06 finished in 1369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G(p3)||p2))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 1 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:56:38] [INFO ] Invariant cache hit.
[2023-03-08 09:56:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 09:56:38] [INFO ] Invariant cache hit.
[2023-03-08 09:56:38] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-08 09:56:38] [INFO ] Invariant cache hit.
[2023-03-08 09:56:38] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (LEQ 3 s8) (LEQ s4 s17)), p3:(LEQ s1 s3), p1:(GT 3 s8), p0:(GT s3 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 357 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-07 finished in 611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X((p0 U (p1||G(p0))))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:56:39] [INFO ] Invariant cache hit.
[2023-03-08 09:56:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 09:56:39] [INFO ] Invariant cache hit.
[2023-03-08 09:56:39] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-08 09:56:39] [INFO ] Invariant cache hit.
[2023-03-08 09:56:39] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s5 s17), p1:(AND (LEQ s2 s9) (GT s5 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2592 reset in 148 ms.
Product exploration explored 100000 steps with 2615 reset in 167 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 591 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 613 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=306 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 532 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-08 09:56:41] [INFO ] Invariant cache hit.
[2023-03-08 09:56:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 09:56:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:41] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 09:56:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:56:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 09:56:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:41] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 09:56:41] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-08 09:56:41] [INFO ] Added : 15 causal constraints over 3 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:56:41] [INFO ] Invariant cache hit.
[2023-03-08 09:56:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 09:56:41] [INFO ] Invariant cache hit.
[2023-03-08 09:56:41] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-08 09:56:41] [INFO ] Invariant cache hit.
[2023-03-08 09:56:41] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 515 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 531 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=265 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 546 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-08 09:56:43] [INFO ] Invariant cache hit.
[2023-03-08 09:56:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 09:56:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:43] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 09:56:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:56:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 09:56:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:43] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-08 09:56:43] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 09:56:43] [INFO ] Added : 15 causal constraints over 3 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2584 reset in 175 ms.
Product exploration explored 100000 steps with 2586 reset in 183 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 20 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 17 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 17 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 17 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 14 rules in 11 ms. Remains 17 /20 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2023-03-08 09:56:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2023-03-08 09:56:44] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 09:56:44] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 17/20 places, 15/18 transitions.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 09:56:44] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 09:56:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 09:56:44] [INFO ] Invariant cache hit.
[2023-03-08 09:56:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-08 09:56:44] [INFO ] Invariant cache hit.
[2023-03-08 09:56:44] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-08 finished in 5935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(!p0)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 09:56:44] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 09:56:44] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 09:56:44] [INFO ] Invariant cache hit.
[2023-03-08 09:56:45] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-08 09:56:45] [INFO ] Invariant cache hit.
[2023-03-08 09:56:45] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s19 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5455 steps with 0 reset in 14 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-13 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 09:56:45] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 09:56:45] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 09:56:45] [INFO ] Invariant cache hit.
[2023-03-08 09:56:45] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-08 09:56:45] [INFO ] Invariant cache hit.
[2023-03-08 09:56:45] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s4)], 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 1096 reset in 168 ms.
Product exploration explored 100000 steps with 1101 reset in 191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 1428 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=714 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 252 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-08 09:56:46] [INFO ] Invariant cache hit.
[2023-03-08 09:56:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 09:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 09:56:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:56:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 09:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:46] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-08 09:56:46] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 09:56:46] [INFO ] Added : 15 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 20 transition count 8
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 4 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-08 09:56:46] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 09:56:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 09:56:46] [INFO ] Invariant cache hit.
[2023-03-08 09:56:46] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-08 09:56:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:56:46] [INFO ] Invariant cache hit.
[2023-03-08 09:56:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/20 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 7/20 places, 5/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-08 09:56:47] [INFO ] Invariant cache hit.
[2023-03-08 09:56:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 09:56:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 09:56:47] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 09:56:47] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10247 reset in 125 ms.
Product exploration explored 100000 steps with 10184 reset in 133 ms.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 09:56:47] [INFO ] Invariant cache hit.
[2023-03-08 09:56:47] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 09:56:47] [INFO ] Invariant cache hit.
[2023-03-08 09:56:47] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-08 09:56:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:56:47] [INFO ] Invariant cache hit.
[2023-03-08 09:56:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-14 finished in 2482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0)&&(p0 U (p1||G(p0)))))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 1 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 09:56:47] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 09:56:47] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 09:56:47] [INFO ] Invariant cache hit.
[2023-03-08 09:56:47] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-08 09:56:47] [INFO ] Invariant cache hit.
[2023-03-08 09:56:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(OR p1 p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LEQ 3 s9) (GT s11 s4)), p0:(GT s11 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1944 reset in 226 ms.
Product exploration explored 100000 steps with 1840 reset in 255 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10018 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 09:56:49] [INFO ] Invariant cache hit.
[2023-03-08 09:56:49] [INFO ] After 25ms 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 p1) (NOT p0)), true, (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1))]
Knowledge based reduction with 3 factoid took 290 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 09:56:50] [INFO ] Invariant cache hit.
[2023-03-08 09:56:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 09:56:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 09:56:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:56:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 09:56:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:50] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 09:56:50] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 09:56:50] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:56:50] [INFO ] Invariant cache hit.
[2023-03-08 09:56:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 09:56:50] [INFO ] Invariant cache hit.
[2023-03-08 09:56:50] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-08 09:56:50] [INFO ] Invariant cache hit.
[2023-03-08 09:56:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 326 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=326 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 09:56:51] [INFO ] Invariant cache hit.
[2023-03-08 09:56:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 09:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 09:56:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:56:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 09:56:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:56:52] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 09:56:52] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 09:56:52] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1842 reset in 233 ms.
Product exploration explored 100000 steps with 2008 reset in 210 ms.
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 09:56:52] [INFO ] Invariant cache hit.
[2023-03-08 09:56:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 09:56:52] [INFO ] Invariant cache hit.
[2023-03-08 09:56:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-08 09:56:53] [INFO ] Invariant cache hit.
[2023-03-08 09:56:53] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-15 finished in 5284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0) U p1)||G((((p2 U p0)&&G(p3))||p1)))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0020P4-LTLCardinality-00
Stuttering acceptance computed with spot in 374 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 18 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 7 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 09:56:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 09:56:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 09:56:53] [INFO ] Invariant cache hit.
[2023-03-08 09:56:53] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-08 09:56:53] [INFO ] Invariant cache hit.
[2023-03-08 09:56:53] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/24 places, 10/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 119 ms. Remains : 14/24 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 5}, { cond=(OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3)), acceptance={} source=6 dest: 5}, { cond=(OR p1 (AND p0 p3) (AND p2 p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 s0), p0:(LEQ 1 s12), p2:(LEQ s10 s2), p3:(LEQ s3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 247 ms.
Product exploration explored 100000 steps with 1 reset in 286 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 p1 (NOT p0) p2 p3), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3))), true, (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X p3)), (X (X (OR p1 (AND p0 p3) (AND p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1405 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10002 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 09:56:56] [INFO ] Invariant cache hit.
[2023-03-08 09:56:56] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:56:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 09:56:56] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:56:56] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3))), true, (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X p3)), (X (X (OR p1 (AND p0 p3) (AND p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p0) p2))), (F (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2)))), (F (OR (AND (NOT p1) p3 p0) (AND (NOT p1) p3 p2))), (F (AND (NOT p1) p3 (NOT p0) p2)), (F (NOT (OR (AND p1 p3 (NOT p0)) (AND p3 (NOT p0) p2)))), (F (NOT (OR p1 (AND p3 p0) (AND p3 p2)))), (F (NOT p3))]
Knowledge based reduction with 18 factoid took 1832 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Support contains 4 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 09:56:58] [INFO ] Invariant cache hit.
[2023-03-08 09:56:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 09:56:58] [INFO ] Invariant cache hit.
[2023-03-08 09:56:58] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 09:56:58] [INFO ] Invariant cache hit.
[2023-03-08 09:56:58] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 14/14 places, 10/10 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 p1 p3 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 504 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10011 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 6) seen :5
Finished Best-First random walk after 1369 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=684 )
Knowledge obtained : [(AND p1 p3 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p3)), (F (AND (NOT p1) (NOT p0) p3))]
Knowledge based reduction with 7 factoid took 705 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 3 reset in 216 ms.
Product exploration explored 100000 steps with 3 reset in 240 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 13 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 8 ms. Remains 12 /14 variables (removed 2) and now considering 9/10 (removed 1) transitions.
[2023-03-08 09:57:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 09:57:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 09:57:02] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/14 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 12/14 places, 9/10 transitions.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 10
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 09:57:02] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 09:57:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 09:57:02] [INFO ] Invariant cache hit.
[2023-03-08 09:57:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-08 09:57:02] [INFO ] Invariant cache hit.
[2023-03-08 09:57:02] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 10/10 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 13/14 places, 10/10 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-00 finished in 9440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X((p0 U (p1||G(p0))))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P4-LTLCardinality-08
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 15 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 13 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 12 transition count 10
Applied a total of 20 rules in 6 ms. Remains 12 /24 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-08 09:57:02] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 09:57:02] [INFO ] Implicit Places using invariants in 33 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/24 places, 10/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 42 ms. Remains : 11/24 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s3 s10), p1:(AND (LEQ s2 s6) (GT s3 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15126 reset in 115 ms.
Product exploration explored 100000 steps with 15130 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 388 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 206 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=206 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 477 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 10 rows 11 cols
[2023-03-08 09:57:04] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:57:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 09:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 09:57:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:57:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 09:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:04] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-08 09:57:04] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 09:57:04] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 09:57:04] [INFO ] Invariant cache hit.
[2023-03-08 09:57:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 09:57:04] [INFO ] Invariant cache hit.
[2023-03-08 09:57:04] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 09:57:04] [INFO ] Invariant cache hit.
[2023-03-08 09:57:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 11/11 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 477 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 124 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=124 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 486 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-08 09:57:06] [INFO ] Invariant cache hit.
[2023-03-08 09:57:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 09:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-08 09:57:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:57:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 09:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 09:57:06] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 09:57:06] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15107 reset in 110 ms.
Product exploration explored 100000 steps with 15144 reset in 130 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 09:57:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:57:07] [INFO ] Invariant cache hit.
[2023-03-08 09:57:07] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 ms. Remains : 11/11 places, 10/10 transitions.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 09:57:07] [INFO ] Invariant cache hit.
[2023-03-08 09:57:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 09:57:07] [INFO ] Invariant cache hit.
[2023-03-08 09:57:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-08 09:57:07] [INFO ] Invariant cache hit.
[2023-03-08 09:57:07] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 11/11 places, 10/10 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-08 finished in 4625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P4-LTLCardinality-14
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 20 transition count 8
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 7 transition count 5
Applied a total of 30 rules in 2 ms. Remains 7 /24 variables (removed 17) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-08 09:57:07] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 09:57:07] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 09:57:07] [INFO ] Invariant cache hit.
[2023-03-08 09:57:07] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 09:57:07] [INFO ] Invariant cache hit.
[2023-03-08 09:57:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 7/24 places, 5/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 123 ms. Remains : 7/24 places, 5/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10319 reset in 125 ms.
Product exploration explored 100000 steps with 10162 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-08 09:57:08] [INFO ] Invariant cache hit.
[2023-03-08 09:57:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 09:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-08 09:57:08] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 09:57:08] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 09:57:08] [INFO ] Invariant cache hit.
[2023-03-08 09:57:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 09:57:08] [INFO ] Invariant cache hit.
[2023-03-08 09:57:08] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-08 09:57:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:57:08] [INFO ] Invariant cache hit.
[2023-03-08 09:57:08] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-08 09:57:08] [INFO ] Invariant cache hit.
[2023-03-08 09:57:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 09:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:57:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 09:57:09] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 09:57:09] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10207 reset in 113 ms.
Product exploration explored 100000 steps with 10183 reset in 130 ms.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 09:57:09] [INFO ] Invariant cache hit.
[2023-03-08 09:57:09] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 09:57:09] [INFO ] Invariant cache hit.
[2023-03-08 09:57:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-08 09:57:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:57:09] [INFO ] Invariant cache hit.
[2023-03-08 09:57:09] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-14 finished in 2294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0)&&(p0 U (p1||G(p0)))))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P4-LTLCardinality-15
Stuttering acceptance computed with spot in 410 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 13 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 18 place count 13 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 10 transition count 8
Applied a total of 24 rules in 5 ms. Remains 10 /24 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-08 09:57:10] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 09:57:10] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 09:57:10] [INFO ] Invariant cache hit.
[2023-03-08 09:57:10] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-08 09:57:10] [INFO ] Invariant cache hit.
[2023-03-08 09:57:10] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 108 ms. Remains : 10/24 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(OR p1 p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LEQ 3 s3) (GT s5 s1)), p0:(GT s5 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3666 reset in 195 ms.
Stack based approach found an accepted trace after 211 steps with 7 reset with depth 44 and stack size 43 in 1 ms.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-15 finished in 872 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-08 09:57:10] [INFO ] Flatten gal took : 6 ms
[2023-03-08 09:57:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-08 09:57:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 50 arcs took 0 ms.
Total runtime 50851 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0020P4
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678269446798

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 7 (type EXCL) for 6 ClientsAndServers-PT-N0020P4-LTLCardinality-14
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ClientsAndServers-PT-N0020P4-LTLCardinality-14
lola: result : false
lola: markings : 1289
lola: fired transitions : 1289
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 ClientsAndServers-PT-N0020P4-LTLCardinality-15
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for ClientsAndServers-PT-N0020P4-LTLCardinality-15
lola: result : false
lola: markings : 1291
lola: fired transitions : 1291
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ClientsAndServers-PT-N0020P4-LTLCardinality-08
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P4-LTLCardinality-14: LTL false LTL model checker
ClientsAndServers-PT-N0020P4-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P4-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 12/32 ClientsAndServers-PT-N0020P4-LTLCardinality-08 1734198 m, 346839 m/sec, 5136434 t fired, .

Time elapsed: 5 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P4-LTLCardinality-14: LTL false LTL model checker
ClientsAndServers-PT-N0020P4-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P4-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 23/32 ClientsAndServers-PT-N0020P4-LTLCardinality-08 3403787 m, 333917 m/sec, 10267179 t fired, .

Time elapsed: 10 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for ClientsAndServers-PT-N0020P4-LTLCardinality-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P4-LTLCardinality-14: LTL false LTL model checker
ClientsAndServers-PT-N0020P4-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P4-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P4-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N0020P4-LTLCardinality-00
lola: time limit : 3585 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N0020P4-LTLCardinality-00
lola: result : false
lola: markings : 1581
lola: fired transitions : 1582
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P4-LTLCardinality-00: LTL false LTL model checker
ClientsAndServers-PT-N0020P4-LTLCardinality-08: LTL unknown AGGR
ClientsAndServers-PT-N0020P4-LTLCardinality-14: LTL false LTL model checker
ClientsAndServers-PT-N0020P4-LTLCardinality-15: LTL false LTL model checker


Time elapsed: 15 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P4.tgz
mv ClientsAndServers-PT-N0020P4 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;