Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 9.0K Apr 29 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K May 9 09:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 09:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 09:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 09:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 09:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 11 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 19M May 10 09:34 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 ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S02D1C1A12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653192849419

Running Version 202205111006
[2022-05-22 04:14:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 04:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 04:14:14] [INFO ] Load time of PNML (sax parser for PT used): 2386 ms
[2022-05-22 04:14:14] [INFO ] Transformed 32765 places.
[2022-05-22 04:14:14] [INFO ] Transformed 40955 transitions.
[2022-05-22 04:14:14] [INFO ] Parsed PT model containing 32765 places and 40955 transitions in 2939 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 7657 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:14:52] [INFO ] Invariants computation overflowed in 29344 ms
[2022-05-22 04:14:57] [INFO ] Implicit Places using invariants in 34445 ms returned []
Implicit Place search using SMT only with invariants took 34492 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:15:22] [INFO ] Invariants computation overflowed in 24626 ms
[2022-05-22 04:15:26] [INFO ] Dead Transitions using invariants and state equation in 29128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32765/32765 places, 40955/40955 transitions.
Support contains 45 out of 32765 places after structural reductions.
[2022-05-22 04:15:29] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-22 04:15:29] [INFO ] Flatten gal took : 2128 ms
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-22 04:15:31] [INFO ] Flatten gal took : 1543 ms
[2022-05-22 04:15:34] [INFO ] Input system was already deterministic with 40955 transitions.
Support contains 43 out of 32765 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 914 resets, run finished after 4085 ms. (steps per millisecond=2 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 320 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 317 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 308 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 313 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 319 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 311 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 309 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 308 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 314 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 315 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 306 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 309 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 312 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 311 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 314 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 511 ms. (steps per millisecond=1 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 368 ms. (steps per millisecond=2 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 306 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 297 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 296 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 304 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 303 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 425 ms. (steps per millisecond=2 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 353 ms. (steps per millisecond=2 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 297 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 301 ms. (steps per millisecond=3 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 46874 steps, run timeout after 36017 ms. (steps per millisecond=1 ) properties seen :{8=1, 9=1, 10=1, 11=1, 13=1, 15=1}
Probabilistic random walk after 46874 steps, saw 44846 distinct states, run finished after 36019 ms. (steps per millisecond=1 ) properties seen :6
Running SMT prover for 20 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:16:47] [INFO ] Invariants computation overflowed in 24362 ms
[2022-05-22 04:17:08] [INFO ] After 20865ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-22 04:17:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-22 04:17:33] [INFO ] After 25241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 314 are kept as prefixes of interest. Removing 32451 places using SCC suffix rule.67 ms
Discarding 32451 places :
Also discarding 40135 output transitions
Drop transitions removed 40135 transitions
Drop transitions removed 532 transitions
Reduce isomorphic transitions removed 532 transitions.
Drop transitions removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 687 rules applied. Total rules applied 688 place count 314 transition count 133
Reduce places removed 155 places and 0 transitions.
Iterating post reduction 1 with 155 rules applied. Total rules applied 843 place count 159 transition count 133
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 843 place count 159 transition count 123
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 863 place count 149 transition count 123
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 893 place count 119 transition count 93
Iterating global reduction 2 with 30 rules applied. Total rules applied 923 place count 119 transition count 93
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 1019 place count 71 transition count 45
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1020 place count 70 transition count 44
Ensure Unique test removed 20 places
Iterating post reduction 2 with 20 rules applied. Total rules applied 1040 place count 50 transition count 44
Applied a total of 1040 rules in 360 ms. Remains 50 /32765 variables (removed 32715) and now considering 44/40955 (removed 40911) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/32765 places, 44/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 47 are kept as prefixes of interest. Removing 32718 places using SCC suffix rule.86 ms
Discarding 32718 places :
Also discarding 40884 output transitions
Drop transitions removed 40884 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 33 transition count 44
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 33 transition count 44
Graph (complete) has 19 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 32 transition count 43
Applied a total of 28 rules in 195 ms. Remains 32 /32765 variables (removed 32733) and now considering 43/40955 (removed 40912) transitions.
// Phase 1: matrix 43 rows 32 cols
[2022-05-22 04:17:34] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 04:17:34] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 43 rows 32 cols
[2022-05-22 04:17:35] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 04:17:35] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [2, 8, 12, 14, 16, 22]
Discarding 6 places :
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 104 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/32765 places, 38/40955 transitions.
Graph (complete) has 18 edges and 26 vertex of which 20 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 15 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 15 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 15 transition count 23
Applied a total of 15 rules in 5 ms. Remains 15 /26 variables (removed 11) and now considering 23/38 (removed 15) transitions.
// Phase 1: matrix 23 rows 15 cols
[2022-05-22 04:17:35] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 04:17:35] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 23 rows 15 cols
[2022-05-22 04:17:35] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-22 04:17:35] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/32765 places, 23/40955 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/32765 places, 23/40955 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 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 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 3 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 finished in 753 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||G(X(G(G(X(p1)))))))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 8958 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:18:01] [INFO ] Invariants computation overflowed in 16974 ms
[2022-05-22 04:18:05] [INFO ] Implicit Places using invariants in 21045 ms returned []
Implicit Place search using SMT only with invariants took 21047 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:18:24] [INFO ] Invariants computation overflowed in 18897 ms
[2022-05-22 04:18:28] [INFO ] Dead Transitions using invariants and state equation in 22926 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(GT 2 s20154), p0:(LEQ 2 s7427)], 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, null][false, false, false, false, false, false]]
Product exploration timeout after 32760 steps with 3105 reset in 10002 ms.
Product exploration timeout after 25290 steps with 2385 reset in 10004 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 393 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 942 resets, run finished after 3072 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 2690 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23938 steps, run timeout after 15005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 23938 steps, saw 23030 distinct states, run finished after 15011 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:22:21] [INFO ] Invariants computation overflowed in 22757 ms
[2022-05-22 04:22:46] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 14 are kept as prefixes of interest. Removing 32751 places using SCC suffix rule.10 ms
Discarding 32751 places :
Also discarding 40919 output transitions
Drop transitions removed 40919 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 14 transition count 5
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 41 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 41 place count 5 transition count 4
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 43 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 3 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 3 transition count 3
Applied a total of 45 rules in 59 ms. Remains 3 /32765 variables (removed 32762) and now considering 3/40955 (removed 40952) transitions.
Finished structural reductions, in 1 iterations. Remains : 3/32765 places, 3/40955 transitions.
Incomplete random walk after 10000 steps, including 3333 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Probably explored full state space saw : 4 states, properties seen :0
Probabilistic random walk after 7 steps, saw 4 distinct states, run finished after 5 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 4 states, properties seen :0
Exhaustive walk after 7 steps, saw 4 distinct states, run finished after 1 ms. (steps per millisecond=7 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (G p1)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p1)
Knowledge based reduction with 10 factoid took 246 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03 finished in 311088 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G((p1 U p2))&&p0))||G(p3)))'
Support contains 7 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 249 are kept as prefixes of interest. Removing 32516 places using SCC suffix rule.26 ms
Discarding 32516 places :
Also discarding 40574 output transitions
Drop transitions removed 40574 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 70 place count 179 transition count 239
Iterating global reduction 0 with 69 rules applied. Total rules applied 139 place count 179 transition count 239
Graph (complete) has 104 edges and 179 vertex of which 177 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 140 place count 177 transition count 237
Applied a total of 140 rules in 111 ms. Remains 177 /32765 variables (removed 32588) and now considering 237/40955 (removed 40718) transitions.
// Phase 1: matrix 237 rows 177 cols
[2022-05-22 04:22:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 04:22:46] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 237 rows 177 cols
[2022-05-22 04:22:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 04:22:47] [INFO ] Implicit Places using invariants and state equation in 324 ms returned [0, 2, 4, 6, 12, 14, 16, 18, 35, 37, 39, 43, 45, 49, 58, 60, 73, 87, 91, 93, 95, 102, 108, 110, 114, 124, 126, 130, 148, 152, 154, 160, 167, 171, 173]
Discarding 35 places :
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Implicit Place search using SMT with State Equation took 444 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/32765 places, 209/40955 transitions.
Graph (complete) has 102 edges and 142 vertex of which 113 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 82 transition count 148
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 76 place count 82 transition count 135
Performed 5 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 77 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 93 place count 77 transition count 138
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 106 place count 77 transition count 125
Applied a total of 106 rules in 28 ms. Remains 77 /142 variables (removed 65) and now considering 125/209 (removed 84) transitions.
// Phase 1: matrix 125 rows 77 cols
[2022-05-22 04:22:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 04:22:47] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 125 rows 77 cols
[2022-05-22 04:22:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 04:22:47] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/32765 places, 125/40955 transitions.
Finished structural reductions, in 2 iterations. Remains : 77/32765 places, 125/40955 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p2 p3) (AND p0 p1 p3)), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p3) (AND p1 p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ 1 s58) (LEQ s72 s35)), p3:(LEQ s50 s24), p2:(LEQ s72 s35), p1:(LEQ s18 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5145 steps with 73 reset in 84 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05 finished in 1133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 3 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 8682 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:23:16] [INFO ] Invariants computation overflowed in 20196 ms
[2022-05-22 04:23:20] [INFO ] Implicit Places using invariants in 24548 ms returned []
Implicit Place search using SMT only with invariants took 24549 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:23:45] [INFO ] Invariants computation overflowed in 24614 ms
[2022-05-22 04:23:49] [INFO ] Dead Transitions using invariants and state equation in 28573 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LEQ s5184 s17459) (LEQ 1 s20550))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 11 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 finished in 62048 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 11975 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:24:21] [INFO ] Invariants computation overflowed in 20128 ms
[2022-05-22 04:24:26] [INFO ] Implicit Places using invariants in 24427 ms returned []
Implicit Place search using SMT only with invariants took 24431 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:24:46] [INFO ] Invariants computation overflowed in 20786 ms
[2022-05-22 04:24:51] [INFO ] Dead Transitions using invariants and state equation in 24908 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 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 s28941)], 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]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 13 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 finished in 61500 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0) U p1) U G(p2)))))'
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 8132 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:25:18] [INFO ] Invariants computation overflowed in 19429 ms
[2022-05-22 04:25:22] [INFO ] Implicit Places using invariants in 23364 ms returned []
Implicit Place search using SMT only with invariants took 23365 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:25:43] [INFO ] Invariants computation overflowed in 20788 ms
[2022-05-22 04:25:47] [INFO ] Dead Transitions using invariants and state equation in 24795 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s32211 s17236), p1:(LEQ s14449 s10379), p0:(LEQ s27744 s31824)], 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 timeout after 32850 steps with 3170 reset in 10001 ms.
Product exploration timeout after 25180 steps with 2382 reset in 10001 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 476 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 890 resets, run finished after 3808 ms. (steps per millisecond=2 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 2701 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 2728 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 2709 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 2686 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 2705 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 2725 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 2695 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 148 resets, run finished after 2677 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:29:43] [INFO ] Invariants computation overflowed in 22479 ms
[2022-05-22 04:29:54] [INFO ] After 11599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-22 04:30:20] [INFO ] After 9030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-22 04:30:20] [INFO ] After 9097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-22 04:30:20] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 74 are kept as prefixes of interest. Removing 32691 places using SCC suffix rule.14 ms
Discarding 32691 places :
Also discarding 40760 output transitions
Drop transitions removed 40760 transitions
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 74 transition count 27
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 211 place count 32 transition count 27
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 211 place count 32 transition count 24
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 217 place count 29 transition count 24
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 223 place count 23 transition count 18
Iterating global reduction 2 with 6 rules applied. Total rules applied 229 place count 23 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 243 place count 16 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 15 transition count 10
Ensure Unique test removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 247 place count 12 transition count 10
Applied a total of 247 rules in 66 ms. Remains 12 /32765 variables (removed 32753) and now considering 10/40955 (removed 40945) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/32765 places, 10/40955 transitions.
Finished random walk after 21 steps, including 2 resets, run visited all 8 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p2 (NOT p0) (NOT p1))), (F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 676 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 10812 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:30:54] [INFO ] Invariants computation overflowed in 22324 ms
[2022-05-22 04:30:58] [INFO ] Implicit Places using invariants in 26374 ms returned []
Implicit Place search using SMT only with invariants took 26382 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:31:15] [INFO ] Invariants computation overflowed in 16604 ms
[2022-05-22 04:31:19] [INFO ] Dead Transitions using invariants and state equation in 20630 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 702 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 988 resets, run finished after 3835 ms. (steps per millisecond=2 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 2756 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 2720 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 2776 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 2722 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 2721 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 2740 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 2702 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 2760 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:34:49] [INFO ] Invariants computation overflowed in 19500 ms
[2022-05-22 04:35:01] [INFO ] After 11346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-22 04:35:26] [INFO ] After 9464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-22 04:35:26] [INFO ] After 9494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-22 04:35:26] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 74 are kept as prefixes of interest. Removing 32691 places using SCC suffix rule.11 ms
Discarding 32691 places :
Also discarding 40760 output transitions
Drop transitions removed 40760 transitions
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 74 transition count 27
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 211 place count 32 transition count 27
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 211 place count 32 transition count 24
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 217 place count 29 transition count 24
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 223 place count 23 transition count 18
Iterating global reduction 2 with 6 rules applied. Total rules applied 229 place count 23 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 243 place count 16 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 15 transition count 10
Ensure Unique test removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 247 place count 12 transition count 10
Applied a total of 247 rules in 54 ms. Remains 12 /32765 variables (removed 32753) and now considering 10/40955 (removed 40945) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/32765 places, 10/40955 transitions.
Finished random walk after 13 steps, including 1 resets, run visited all 8 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p2 (NOT p1) (NOT p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND p2 p1 (NOT p0))), (F (AND (NOT p2) p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 659 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Product exploration timeout after 33520 steps with 3153 reset in 10002 ms.
Product exploration timeout after 26130 steps with 2522 reset in 10003 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 198 are kept as prefixes of interest. Removing 32567 places using SCC suffix rule.24 ms
Discarding 32567 places :
Also discarding 40651 output transitions
Drop transitions removed 40651 transitions
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 142 transition count 190
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 142 transition count 190
Graph (complete) has 82 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 114 place count 141 transition count 189
Applied a total of 114 rules in 92 ms. Remains 141 /32765 variables (removed 32624) and now considering 189/40955 (removed 40766) transitions.
[2022-05-22 04:35:48] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 189 rows 141 cols
[2022-05-22 04:35:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 04:35:48] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/32765 places, 189/40955 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/32765 places, 189/40955 transitions.
Stuttering criterion allowed to conclude after 17760 steps with 271 reset in 270 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 finished in 657607 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p1)&&!(p2 U p3))))))'
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 8438 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:36:16] [INFO ] Invariants computation overflowed in 19010 ms
[2022-05-22 04:36:20] [INFO ] Implicit Places using invariants in 22999 ms returned []
Implicit Place search using SMT only with invariants took 23001 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:36:41] [INFO ] Invariants computation overflowed in 21014 ms
[2022-05-22 04:36:45] [INFO ] Dead Transitions using invariants and state equation in 25226 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s15604), p3:(LEQ 1 s26805), p1:(LEQ s11312 s29097), p2:(LEQ s2577 s1331)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 30950 steps with 2953 reset in 10003 ms.
Product exploration timeout after 24440 steps with 2308 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 p2), (X (AND (NOT p0) p2 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 774 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 991 resets, run finished after 3553 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 2704 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 2710 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 2711 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 2738 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Finished probabilistic random walk after 43621 steps, run visited all 4 properties in 28922 ms. (steps per millisecond=1 )
Probabilistic random walk after 43621 steps, saw 41769 distinct states, run finished after 28933 ms. (steps per millisecond=1 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 p2), (X (AND (NOT p0) p2 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p0) p2 (NOT p3)))), (F (AND (NOT p0) (NOT p3) (NOT p1)))]
Knowledge based reduction with 12 factoid took 995 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 14597 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:41:41] [INFO ] Invariants computation overflowed in 20080 ms
[2022-05-22 04:41:45] [INFO ] Implicit Places using invariants in 24026 ms returned []
Implicit Place search using SMT only with invariants took 24029 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:42:07] [INFO ] Invariants computation overflowed in 21918 ms
[2022-05-22 04:42:11] [INFO ] Dead Transitions using invariants and state equation in 26184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 p2), (X (AND (NOT p0) p2 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 799 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 986 resets, run finished after 3504 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 2752 ms. (steps per millisecond=3 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 148 resets, run finished after 2666 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 2664 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:46:22] [INFO ] Invariants computation overflowed in 19265 ms
[2022-05-22 04:46:30] [INFO ] After 7611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-22 04:46:55] [INFO ] After 16221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-22 04:46:55] [INFO ] After 16243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-22 04:46:55] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 54 are kept as prefixes of interest. Removing 32711 places using SCC suffix rule.9 ms
Discarding 32711 places :
Also discarding 40814 output transitions
Drop transitions removed 40814 transitions
Drop transitions removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 54 transition count 18
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 157 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 157 place count 21 transition count 16
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 161 place count 19 transition count 16
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 165 place count 15 transition count 12
Iterating global reduction 2 with 4 rules applied. Total rules applied 169 place count 15 transition count 12
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 177 place count 11 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 10 transition count 7
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 180 place count 8 transition count 7
Applied a total of 180 rules in 50 ms. Remains 8 /32765 variables (removed 32757) and now considering 7/40955 (removed 40948) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/32765 places, 7/40955 transitions.
Finished random walk after 26 steps, including 3 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 p2), (X (AND (NOT p0) p2 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p0) p2 (NOT p3)))), (F (AND (NOT p0) (NOT p3) (NOT p1)))]
Knowledge based reduction with 12 factoid took 946 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Product exploration timeout after 32010 steps with 2964 reset in 10006 ms.
Product exploration timeout after 25380 steps with 2378 reset in 10002 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3)]
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 213 are kept as prefixes of interest. Removing 32552 places using SCC suffix rule.26 ms
Discarding 32552 places :
Also discarding 40634 output transitions
Drop transitions removed 40634 transitions
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 59 place count 155 transition count 204
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 155 transition count 204
Graph (complete) has 92 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 118 place count 154 transition count 203
Applied a total of 118 rules in 103 ms. Remains 154 /32765 variables (removed 32611) and now considering 203/40955 (removed 40752) transitions.
[2022-05-22 04:47:17] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 203 rows 154 cols
[2022-05-22 04:47:17] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-22 04:47:17] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/32765 places, 203/40955 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/32765 places, 203/40955 transitions.
Product exploration explored 100000 steps with 1956 reset in 1273 ms.
Product exploration explored 100000 steps with 1952 reset in 1308 ms.
Built C files in :
/tmp/ltsmin14597959787377837420
[2022-05-22 04:47:20] [INFO ] Built C files in 661ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14597959787377837420
Running compilation step : cd /tmp/ltsmin14597959787377837420;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14597959787377837420;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14597959787377837420;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 12145 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:48:01] [INFO ] Invariants computation overflowed in 25147 ms
[2022-05-22 04:48:05] [INFO ] Implicit Places using invariants in 29517 ms returned []
Implicit Place search using SMT only with invariants took 29518 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2022-05-22 04:48:32] [INFO ] Invariants computation overflowed in 26608 ms
[2022-05-22 04:48:36] [INFO ] Dead Transitions using invariants and state equation in 30976 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32765/32765 places, 40955/40955 transitions.
Built C files in :
/tmp/ltsmin14296821496265078845
[2022-05-22 04:48:37] [INFO ] Built C files in 511ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14296821496265078845
Running compilation step : cd /tmp/ltsmin14296821496265078845;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14296821496265078845;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14296821496265078845;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-22 04:48:43] [INFO ] Flatten gal took : 1374 ms
[2022-05-22 04:48:45] [INFO ] Flatten gal took : 1419 ms
[2022-05-22 04:48:45] [INFO ] Time to serialize gal into /tmp/LTL15942844026556372070.gal : 436 ms
[2022-05-22 04:48:45] [INFO ] Time to serialize properties into /tmp/LTL9763677787366610757.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15942844026556372070.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9763677787366610757.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1594284...267
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-22 04:49:02] [INFO ] Flatten gal took : 1378 ms
[2022-05-22 04:49:02] [INFO ] Applying decomposition
[2022-05-22 04:49:03] [INFO ] Flatten gal took : 1371 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13387561940297566214.txt' '-o' '/tmp/graph13387561940297566214.bin' '-w' '/tmp/graph13387561940297566214.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13387561940297566214.bin' '-l' '-1' '-v' '-w' '/tmp/graph13387561940297566214.weights' '-q' '0' '-e' '0.001'
[2022-05-22 04:49:08] [INFO ] Decomposing Gal with order
[2022-05-22 04:49:30] [INFO ] Rewriting arrays to variables to allow decomposition.

BK_STOP 1653195201268

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ViralEpidemic-PT-S02D1C1A12, 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 r276-smll-165307353200307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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