Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r276-smll-165307353200300.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-S02D1C1A10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353200300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.1M
-rw-r--r-- 1 mcc users 8.5K Apr 29 12:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 12:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 12:20 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.5K May 9 09:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 8.8M 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-S02D1C1A10-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653188933767

Running Version 202205111006
[2022-05-22 03:08:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 03:08:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 03:08:57] [INFO ] Load time of PNML (sax parser for PT used): 1293 ms
[2022-05-22 03:08:57] [INFO ] Transformed 8189 places.
[2022-05-22 03:08:57] [INFO ] Transformed 10235 transitions.
[2022-05-22 03:08:57] [INFO ] Found NUPN structural information;
[2022-05-22 03:08:57] [INFO ] Parsed PT model containing 8189 places and 10235 transitions in 1567 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 8189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8189/8189 places, 10235/10235 transitions.
Discarding 3038 places :
Symmetric choice reduction at 0 with 3038 rule applications. Total rules 3038 place count 5151 transition count 5172
Iterating global reduction 0 with 3038 rules applied. Total rules applied 6076 place count 5151 transition count 5172
Applied a total of 6076 rules in 3718 ms. Remains 5151 /8189 variables (removed 3038) and now considering 5172/10235 (removed 5063) transitions.
// Phase 1: matrix 5172 rows 5151 cols
[2022-05-22 03:09:03] [INFO ] Invariants computation overflowed in 1655 ms
[2022-05-22 03:09:04] [INFO ] Implicit Places using invariants in 2820 ms returned []
// Phase 1: matrix 5172 rows 5151 cols
[2022-05-22 03:09:05] [INFO ] Invariants computation overflowed in 609 ms
[2022-05-22 03:09:07] [INFO ] Implicit Places using invariants and state equation in 2603 ms returned []
Implicit Place search using SMT with State Equation took 5480 ms to find 0 implicit places.
// Phase 1: matrix 5172 rows 5151 cols
[2022-05-22 03:09:07] [INFO ] Invariants computation overflowed in 401 ms
[2022-05-22 03:09:13] [INFO ] Dead Transitions using invariants and state equation in 6240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5151/8189 places, 5172/10235 transitions.
Finished structural reductions, in 1 iterations. Remains : 5151/8189 places, 5172/10235 transitions.
Support contains 49 out of 5151 places after structural reductions.
[2022-05-22 03:09:14] [INFO ] Flatten gal took : 637 ms
[2022-05-22 03:09:15] [INFO ] Flatten gal took : 285 ms
[2022-05-22 03:09:15] [INFO ] Input system was already deterministic with 5172 transitions.
Incomplete random walk after 10000 steps, including 383 resets, run finished after 1746 ms. (steps per millisecond=5 ) properties (out of 25) seen :8
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 76 ms. (steps per millisecond=13 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 76 ms. (steps per millisecond=13 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 5172 rows 5151 cols
[2022-05-22 03:09:18] [INFO ] Invariants computation overflowed in 269 ms
[2022-05-22 03:09:31] [INFO ] After 8112ms SMT Verify possible using state equation in real domain returned unsat :0 sat :12 real:3
[2022-05-22 03:09:38] [INFO ] After 15004ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :12 real:3
Attempting to minimize the solution found.
Minimization took 3650 ms.
[2022-05-22 03:09:42] [INFO ] After 23750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :12 real:3
[2022-05-22 03:09:55] [INFO ] After 8298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-22 03:10:03] [INFO ] After 16089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 4135 ms.
[2022-05-22 03:10:07] [INFO ] After 24759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 2 different solutions.
Finished Parikh walk after 471 steps, including 0 resets, run visited all 15 properties in 107 ms. (steps per millisecond=4 )
Parikh walk visited 15 properties in 120 ms.
Computed a total of 5151 stabilizing places and 5172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5151 transition count 5172
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((F(X(G(X(p1))))&&p0)))'
Support contains 6 out of 5151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Graph (complete) has 3081 edges and 5151 vertex of which 75 are kept as prefixes of interest. Removing 5076 places using SCC suffix rule.43 ms
Discarding 5076 places :
Also discarding 5071 output transitions
Drop transitions removed 5071 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 92 ms. Remains 74 /5151 variables (removed 5077) and now considering 100/5172 (removed 5072) transitions.
// Phase 1: matrix 100 rows 74 cols
[2022-05-22 03:10:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:10:08] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 100 rows 74 cols
[2022-05-22 03:10:08] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-22 03:10:08] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [0, 4, 10, 16, 26, 28, 30, 34, 38, 40, 52, 54, 58, 60]
Discarding 14 places :
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT with State Equation took 230 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/5151 places, 88/5172 transitions.
Graph (complete) has 42 edges and 60 vertex of which 48 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 36 transition count 64
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 31 place count 36 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 35 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 35 transition count 57
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 35 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 38 place count 35 transition count 52
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 34 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 34 transition count 52
Applied a total of 41 rules in 33 ms. Remains 34 /60 variables (removed 26) and now considering 52/88 (removed 36) transitions.
// Phase 1: matrix 52 rows 34 cols
[2022-05-22 03:10:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:10:08] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 52 rows 34 cols
[2022-05-22 03:10:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:10:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/5151 places, 52/5172 transitions.
Finished structural reductions, in 2 iterations. Remains : 34/5151 places, 52/5172 transitions.
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s25 1)), p1:(AND (EQ s12 1) (EQ s13 1) (EQ s31 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 3 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-00 finished in 1011 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(X(p1)))||p0)))'
Support contains 4 out of 5151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 5122 transition count 5123
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 5122 transition count 5123
Applied a total of 58 rules in 2518 ms. Remains 5122 /5151 variables (removed 29) and now considering 5123/5172 (removed 49) transitions.
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:10:11] [INFO ] Invariants computation overflowed in 420 ms
[2022-05-22 03:10:12] [INFO ] Implicit Places using invariants in 1377 ms returned []
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:10:13] [INFO ] Invariants computation overflowed in 363 ms
[2022-05-22 03:10:14] [INFO ] Implicit Places using invariants and state equation in 2208 ms returned []
Implicit Place search using SMT with State Equation took 3591 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:10:15] [INFO ] Invariants computation overflowed in 446 ms
[2022-05-22 03:10:16] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5122/5151 places, 5123/5172 transitions.
Finished structural reductions, in 1 iterations. Remains : 5122/5151 places, 5123/5172 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (AND (EQ s4048 1) (EQ s4052 1)) (AND (EQ s733 1) (EQ s735 1))), p1:(AND (EQ s4048 1) (EQ s4052 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-04 finished in 7644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F((p1 U p2)) U p1)||p0)))'
Support contains 7 out of 5151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 5123 transition count 5125
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 5123 transition count 5125
Applied a total of 56 rules in 2275 ms. Remains 5123 /5151 variables (removed 28) and now considering 5125/5172 (removed 47) transitions.
// Phase 1: matrix 5125 rows 5123 cols
[2022-05-22 03:10:19] [INFO ] Invariants computation overflowed in 355 ms
[2022-05-22 03:10:20] [INFO ] Implicit Places using invariants in 1360 ms returned []
// Phase 1: matrix 5125 rows 5123 cols
[2022-05-22 03:10:20] [INFO ] Invariants computation overflowed in 286 ms
[2022-05-22 03:10:22] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 3288 ms to find 0 implicit places.
// Phase 1: matrix 5125 rows 5123 cols
[2022-05-22 03:10:22] [INFO ] Invariants computation overflowed in 272 ms
[2022-05-22 03:10:23] [INFO ] Dead Transitions using invariants and state equation in 1190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5123/5151 places, 5125/5172 transitions.
Finished structural reductions, in 1 iterations. Remains : 5123/5151 places, 5125/5172 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s4132 1) (AND (EQ s350 1) (EQ s359 1))), p1:(AND (EQ s2445 1) (EQ s2454 1)), p2:(AND (EQ s702 1) (EQ s708 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-06 finished in 6970 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 5151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 5121 transition count 5122
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 5121 transition count 5122
Applied a total of 60 rules in 2128 ms. Remains 5121 /5151 variables (removed 30) and now considering 5122/5172 (removed 50) transitions.
// Phase 1: matrix 5122 rows 5121 cols
[2022-05-22 03:10:26] [INFO ] Invariants computation overflowed in 445 ms
[2022-05-22 03:10:27] [INFO ] Implicit Places using invariants in 1435 ms returned []
// Phase 1: matrix 5122 rows 5121 cols
[2022-05-22 03:10:27] [INFO ] Invariants computation overflowed in 287 ms
[2022-05-22 03:10:28] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 3342 ms to find 0 implicit places.
// Phase 1: matrix 5122 rows 5121 cols
[2022-05-22 03:10:29] [INFO ] Invariants computation overflowed in 279 ms
[2022-05-22 03:10:30] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5151 places, 5122/5172 transitions.
Finished structural reductions, in 1 iterations. Remains : 5121/5151 places, 5122/5172 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s3525 1) (NEQ s3526 1)), p0:(AND (EQ s1709 1) (EQ s1710 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 92430 steps with 46215 reset in 10001 ms.
Product exploration timeout after 81350 steps with 40675 reset in 10001 ms.
Computed a total of 5121 stabilizing places and 5122 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5121 transition count 5122
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 (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 9 factoid took 200 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-07 finished in 30217 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 5151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 5119 transition count 5118
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 5119 transition count 5118
Applied a total of 64 rules in 1986 ms. Remains 5119 /5151 variables (removed 32) and now considering 5118/5172 (removed 54) transitions.
// Phase 1: matrix 5118 rows 5119 cols
[2022-05-22 03:10:55] [INFO ] Invariants computation overflowed in 269 ms
[2022-05-22 03:10:56] [INFO ] Implicit Places using invariants in 1267 ms returned []
// Phase 1: matrix 5118 rows 5119 cols
[2022-05-22 03:10:57] [INFO ] Invariants computation overflowed in 279 ms
[2022-05-22 03:10:58] [INFO ] Implicit Places using invariants and state equation in 1996 ms returned []
Implicit Place search using SMT with State Equation took 3285 ms to find 0 implicit places.
// Phase 1: matrix 5118 rows 5119 cols
[2022-05-22 03:10:59] [INFO ] Invariants computation overflowed in 265 ms
[2022-05-22 03:11:04] [INFO ] Dead Transitions using invariants and state equation in 5296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5119/5151 places, 5118/5172 transitions.
Finished structural reductions, in 1 iterations. Remains : 5119/5151 places, 5118/5172 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1663 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 3 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-08 finished in 10695 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||p1)))'
Support contains 4 out of 5151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Graph (complete) has 3081 edges and 5151 vertex of which 48 are kept as prefixes of interest. Removing 5103 places using SCC suffix rule.20 ms
Discarding 5103 places :
Also discarding 5105 output transitions
Drop transitions removed 5105 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 38 ms. Remains 47 /5151 variables (removed 5104) and now considering 66/5172 (removed 5106) transitions.
// Phase 1: matrix 66 rows 47 cols
[2022-05-22 03:11:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:11:04] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 66 rows 47 cols
[2022-05-22 03:11:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:04] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [8, 20, 26, 30, 34]
Discarding 5 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 120 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/5151 places, 62/5172 transitions.
Graph (complete) has 25 edges and 42 vertex of which 38 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 33 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 32 transition count 53
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 32 transition count 51
Applied a total of 15 rules in 9 ms. Remains 32 /42 variables (removed 10) and now considering 51/62 (removed 11) transitions.
// Phase 1: matrix 51 rows 32 cols
[2022-05-22 03:11:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:04] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 51 rows 32 cols
[2022-05-22 03:11:04] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-22 03:11:04] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/5151 places, 51/5172 transitions.
Finished structural reductions, in 2 iterations. Remains : 32/5151 places, 51/5172 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s27 1) (EQ s30 1)), p0:(AND (EQ s12 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-09 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 5151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Graph (complete) has 3081 edges and 5151 vertex of which 31 are kept as prefixes of interest. Removing 5120 places using SCC suffix rule.13 ms
Discarding 5120 places :
Also discarding 5131 output transitions
Drop transitions removed 5131 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 27 ms. Remains 30 /5151 variables (removed 5121) and now considering 40/5172 (removed 5132) transitions.
// Phase 1: matrix 40 rows 30 cols
[2022-05-22 03:11:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:04] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 40 rows 30 cols
[2022-05-22 03:11:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:04] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [2, 4, 6, 12, 14, 18]
Discarding 6 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT with State Equation took 103 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/5151 places, 34/5172 transitions.
Graph (complete) has 17 edges and 24 vertex of which 18 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 13 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 13 transition count 20
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 13 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 13 transition count 19
Applied a total of 16 rules in 6 ms. Remains 13 /24 variables (removed 11) and now considering 19/34 (removed 15) transitions.
// Phase 1: matrix 19 rows 13 cols
[2022-05-22 03:11:04] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:11:04] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 19 rows 13 cols
[2022-05-22 03:11:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:04] [INFO ] Implicit Places using invariants and state equation in 34 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 : 13/5151 places, 19/5172 transitions.
Finished structural reductions, in 2 iterations. Remains : 13/5151 places, 19/5172 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s10 1) (NEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9665 reset in 290 ms.
Product exploration explored 100000 steps with 9650 reset in 295 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 19
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-10 finished in 1006 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0)||F(p1)) U X((p1 U p2))))))'
Support contains 5 out of 5151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Graph (complete) has 3081 edges and 5151 vertex of which 71 are kept as prefixes of interest. Removing 5080 places using SCC suffix rule.12 ms
Discarding 5080 places :
Also discarding 5075 output transitions
Drop transitions removed 5075 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 29 ms. Remains 70 /5151 variables (removed 5081) and now considering 96/5172 (removed 5076) transitions.
// Phase 1: matrix 96 rows 70 cols
[2022-05-22 03:11:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:05] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 96 rows 70 cols
[2022-05-22 03:11:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:11:05] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [0, 2, 6, 8, 14, 18, 29, 31, 37, 39, 43, 50, 54, 60]
Discarding 14 places :
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Implicit Place search using SMT with State Equation took 188 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/5151 places, 83/5172 transitions.
Graph (complete) has 40 edges and 56 vertex of which 44 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 34 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 25 place count 34 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 32 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 32 transition count 57
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 32 transition count 53
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 32 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 32 transition count 52
Applied a total of 39 rules in 17 ms. Remains 32 /56 variables (removed 24) and now considering 52/83 (removed 31) transitions.
// Phase 1: matrix 52 rows 32 cols
[2022-05-22 03:11:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:06] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 52 rows 32 cols
[2022-05-22 03:11:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:06] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/5151 places, 52/5172 transitions.
Finished structural reductions, in 2 iterations. Remains : 32/5151 places, 52/5172 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s29 1) (EQ s31 1)), p1:(AND (EQ s10 1) (EQ s12 1)), p2:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 18211 reset in 510 ms.
Product exploration explored 100000 steps with 18265 reset in 494 ms.
Computed a total of 32 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 52
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 p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 413 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
Finished random walk after 375 steps, including 10 resets, run visited all 4 properties in 22 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 665 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
// Phase 1: matrix 52 rows 32 cols
[2022-05-22 03:11:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 03:11:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-22 03:11:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 03:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 03:11:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-22 03:11:09] [INFO ] Computed and/alt/rep : 38/46/38 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-22 03:11:09] [INFO ] Added : 12 causal constraints over 3 iterations in 42 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 32 cols
[2022-05-22 03:11:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:11:09] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 52 rows 32 cols
[2022-05-22 03:11:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:09] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-05-22 03:11:09] [INFO ] Redundant transitions in 30 ms returned [1, 8, 19, 25, 30]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
// Phase 1: matrix 47 rows 32 cols
[2022-05-22 03:11:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:11:09] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/32 places, 47/52 transitions.
Graph (complete) has 17 edges and 32 vertex of which 27 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 24 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 22 transition count 41
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 22 transition count 39
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 22 transition count 35
Applied a total of 17 rules in 9 ms. Remains 22 /32 variables (removed 10) and now considering 35/47 (removed 12) transitions.
// Phase 1: matrix 35 rows 22 cols
[2022-05-22 03:11:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:09] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 35 rows 22 cols
[2022-05-22 03:11:09] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-22 03:11:09] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/32 places, 35/52 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/32 places, 35/52 transitions.
Computed a total of 22 stabilizing places and 35 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 35
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 p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 591 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
Finished random walk after 74 steps, including 3 resets, run visited all 4 properties in 4 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 659 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
// Phase 1: matrix 35 rows 22 cols
[2022-05-22 03:11:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 03:11:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-22 03:11:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 03:11:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 03:11:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-22 03:11:11] [INFO ] Computed and/alt/rep : 26/34/26 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-22 03:11:11] [INFO ] Added : 7 causal constraints over 2 iterations in 27 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
Stuttering criterion allowed to conclude after 27 steps with 2 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-11 finished in 6326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p1)||(G(p2) U p3))))'
Support contains 8 out of 5151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Graph (complete) has 3081 edges and 5151 vertex of which 87 are kept as prefixes of interest. Removing 5064 places using SCC suffix rule.13 ms
Discarding 5064 places :
Also discarding 5052 output transitions
Drop transitions removed 5052 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 29 ms. Remains 86 /5151 variables (removed 5065) and now considering 119/5172 (removed 5053) transitions.
// Phase 1: matrix 119 rows 86 cols
[2022-05-22 03:11:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:12] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 119 rows 86 cols
[2022-05-22 03:11:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:12] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [0, 2, 4, 8, 10, 14, 25, 29, 33, 46, 48, 50, 65, 67, 81, 83]
Discarding 16 places :
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Implicit Place search using SMT with State Equation took 203 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/5151 places, 106/5172 transitions.
Graph (complete) has 49 edges and 70 vertex of which 57 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 44 transition count 80
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 32 place count 44 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 42 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 39 place count 42 transition count 75
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 48 place count 42 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 42 transition count 65
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 50 place count 41 transition count 65
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 41 transition count 65
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 41 transition count 64
Applied a total of 53 rules in 13 ms. Remains 41 /70 variables (removed 29) and now considering 64/106 (removed 42) transitions.
// Phase 1: matrix 64 rows 41 cols
[2022-05-22 03:11:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:11:12] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 64 rows 41 cols
[2022-05-22 03:11:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:11:12] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/5151 places, 64/5172 transitions.
Finished structural reductions, in 2 iterations. Remains : 41/5151 places, 64/5172 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND p1 (NOT p3)), true, p1, (NOT p2), (NOT p3), (AND p2 (NOT p3) p1), (AND p1 (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s17 1) (EQ s20 1)), p3:(AND (EQ s27 1) (EQ s30 1)), p0:(AND (EQ s35 1) (EQ s37 1)), p2:(AND (EQ s17 1) (EQ s20 1) (NOT (AND (EQ s6 1) (EQ s8 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2610 steps with 95 reset in 7 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-12 finished in 740 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(G(!p1)))))'
Support contains 4 out of 5151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 5122 transition count 5123
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 5122 transition count 5123
Applied a total of 58 rules in 2789 ms. Remains 5122 /5151 variables (removed 29) and now considering 5123/5172 (removed 49) transitions.
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:11:15] [INFO ] Invariants computation overflowed in 266 ms
[2022-05-22 03:11:16] [INFO ] Implicit Places using invariants in 1212 ms returned []
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:11:17] [INFO ] Invariants computation overflowed in 364 ms
[2022-05-22 03:11:18] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned []
Implicit Place search using SMT with State Equation took 3198 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:11:19] [INFO ] Invariants computation overflowed in 427 ms
[2022-05-22 03:11:20] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5122/5151 places, 5123/5172 transitions.
Finished structural reductions, in 1 iterations. Remains : 5122/5151 places, 5123/5172 transitions.
Stuttering acceptance computed with spot in 138 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s3025 1) (EQ s3027 1)), p0:(AND (EQ s1183 1) (EQ s1189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25959 reset in 8837 ms.
Product exploration explored 100000 steps with 25943 reset in 8734 ms.
Computed a total of 5122 stabilizing places and 5123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5122 transition count 5123
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 p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 398 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 193 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 2983 steps, including 125 resets, run visited all 3 properties in 279 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F p0)]
Knowledge based reduction with 8 factoid took 545 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 4 out of 5122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5122/5122 places, 5123/5123 transitions.
Applied a total of 0 rules in 1311 ms. Remains 5122 /5122 variables (removed 0) and now considering 5123/5123 (removed 0) transitions.
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:11:44] [INFO ] Invariants computation overflowed in 440 ms
[2022-05-22 03:11:45] [INFO ] Implicit Places using invariants in 1450 ms returned []
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:11:45] [INFO ] Invariants computation overflowed in 267 ms
[2022-05-22 03:11:47] [INFO ] Implicit Places using invariants and state equation in 1875 ms returned []
Implicit Place search using SMT with State Equation took 3335 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:11:47] [INFO ] Invariants computation overflowed in 320 ms
[2022-05-22 03:11:48] [INFO ] Dead Transitions using invariants and state equation in 1203 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5122/5122 places, 5123/5123 transitions.
Computed a total of 5122 stabilizing places and 5123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5122 transition count 5123
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 p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 322 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 386 resets, run finished after 890 ms. (steps per millisecond=11 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:11:54] [INFO ] Invariants computation overflowed in 305 ms
[2022-05-22 03:12:00] [INFO ] After 4920ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-22 03:12:00] [INFO ] After 5295ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 382 ms.
[2022-05-22 03:12:00] [INFO ] After 6703ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 292 steps, including 0 resets, run visited all 1 properties in 57 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 60 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F p0)]
Knowledge based reduction with 8 factoid took 564 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 25926 reset in 7940 ms.
Product exploration explored 100000 steps with 25991 reset in 8245 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 161 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 4 out of 5122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5122/5122 places, 5123/5123 transitions.
Graph (complete) has 3072 edges and 5122 vertex of which 50 are kept as prefixes of interest. Removing 5072 places using SCC suffix rule.4 ms
Discarding 5072 places :
Also discarding 5055 output transitions
Drop transitions removed 5055 transitions
Applied a total of 1 rules in 17 ms. Remains 50 /5122 variables (removed 5072) and now considering 68/5123 (removed 5055) transitions.
[2022-05-22 03:12:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 68 rows 50 cols
[2022-05-22 03:12:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:12:18] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/5122 places, 68/5123 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/5122 places, 68/5123 transitions.
Product exploration explored 100000 steps with 25935 reset in 7853 ms.
Product exploration explored 100000 steps with 25919 reset in 8176 ms.
Built C files in :
/tmp/ltsmin17087842768134028134
[2022-05-22 03:12:34] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17087842768134028134
Running compilation step : cd /tmp/ltsmin17087842768134028134;'/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/ltsmin17087842768134028134;'/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/ltsmin17087842768134028134;'/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 4 out of 5122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5122/5122 places, 5123/5123 transitions.
Applied a total of 0 rules in 1214 ms. Remains 5122 /5122 variables (removed 0) and now considering 5123/5123 (removed 0) transitions.
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:12:39] [INFO ] Invariants computation overflowed in 267 ms
[2022-05-22 03:12:40] [INFO ] Implicit Places using invariants in 990 ms returned []
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:12:40] [INFO ] Invariants computation overflowed in 266 ms
[2022-05-22 03:12:41] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2764 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5122 cols
[2022-05-22 03:12:42] [INFO ] Invariants computation overflowed in 267 ms
[2022-05-22 03:12:42] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5122/5122 places, 5123/5123 transitions.
Built C files in :
/tmp/ltsmin11032840716389833337
[2022-05-22 03:12:43] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11032840716389833337
Running compilation step : cd /tmp/ltsmin11032840716389833337;'/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/ltsmin11032840716389833337;'/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/ltsmin11032840716389833337;'/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 03:12:46] [INFO ] Flatten gal took : 254 ms
[2022-05-22 03:12:47] [INFO ] Flatten gal took : 286 ms
[2022-05-22 03:12:47] [INFO ] Time to serialize gal into /tmp/LTL3296105025639396071.gal : 59 ms
[2022-05-22 03:12:47] [INFO ] Time to serialize properties into /tmp/LTL7323692964947328031.ltl : 6 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/LTL3296105025639396071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7323692964947328031.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/LTL3296105...266
Read 1 LTL properties
Checking formula 0 : !((X((F("((dFactor101112221211==1)&&(patient11122212112==1))"))U(X(G(!("((dFactor812122121==1)&&(patient121221211==1))")))))))
Formula 0 simplified : !X(F"((dFactor101112221211==1)&&(patient11122212112==1))" U XG!"((dFactor812122121==1)&&(patient121221211==1))")
Detected timeout of ITS tools.
[2022-05-22 03:13:02] [INFO ] Flatten gal took : 194 ms
[2022-05-22 03:13:02] [INFO ] Applying decomposition
[2022-05-22 03:13:02] [INFO ] Flatten gal took : 187 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/graph14485772354510163028.txt' '-o' '/tmp/graph14485772354510163028.bin' '-w' '/tmp/graph14485772354510163028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14485772354510163028.bin' '-l' '-1' '-v' '-w' '/tmp/graph14485772354510163028.weights' '-q' '0' '-e' '0.001'
[2022-05-22 03:13:03] [INFO ] Decomposing Gal with order
[2022-05-22 03:13:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 03:13:07] [INFO ] Removed a total of 1388 redundant transitions.
[2022-05-22 03:13:07] [INFO ] Flatten gal took : 851 ms
[2022-05-22 03:13:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2036 labels/synchronizations in 721 ms.
[2022-05-22 03:13:09] [INFO ] Time to serialize gal into /tmp/LTL16549479329044692659.gal : 106 ms
[2022-05-22 03:13:09] [INFO ] Time to serialize properties into /tmp/LTL1242539876573586704.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16549479329044692659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1242539876573586704.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1654947...246
Read 1 LTL properties
Checking formula 0 : !((X((F("((u789.dFactor101112221211==1)&&(i469.u788.patient11122212112==1))"))U(X(G(!("((u2013.dFactor812122121==1)&&(i1234.u2016.pati...180
Formula 0 simplified : !X(F"((u789.dFactor101112221211==1)&&(i469.u788.patient11122212112==1))" U XG!"((u2013.dFactor812122121==1)&&(i1234.u2016.patient121...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4780511953593649195
[2022-05-22 03:13:24] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4780511953593649195
Running compilation step : cd /tmp/ltsmin4780511953593649195;'/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/ltsmin4780511953593649195;'/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/ltsmin4780511953593649195;'/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)
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-13 finished in 134407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(F((X(p0)&&p1)))||G(p2)))))))'
Support contains 4 out of 5151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 5121 transition count 5121
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 5121 transition count 5121
Applied a total of 60 rules in 1893 ms. Remains 5121 /5151 variables (removed 30) and now considering 5121/5172 (removed 51) transitions.
// Phase 1: matrix 5121 rows 5121 cols
[2022-05-22 03:13:29] [INFO ] Invariants computation overflowed in 286 ms
[2022-05-22 03:13:30] [INFO ] Implicit Places using invariants in 1042 ms returned []
// Phase 1: matrix 5121 rows 5121 cols
[2022-05-22 03:13:30] [INFO ] Invariants computation overflowed in 266 ms
[2022-05-22 03:13:31] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 2770 ms to find 0 implicit places.
// Phase 1: matrix 5121 rows 5121 cols
[2022-05-22 03:13:32] [INFO ] Invariants computation overflowed in 271 ms
[2022-05-22 03:13:32] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5151 places, 5121/5172 transitions.
Finished structural reductions, in 1 iterations. Remains : 5121/5151 places, 5121/5172 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s1734 1) (EQ s1739 1)), p1:(EQ s2287 1), p0:(EQ s729 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-14 finished in 6031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(G(!p1)))))'
Found a SL insensitive property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-13
Stuttering acceptance computed with spot in 180 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 4 out of 5151 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5151/5151 places, 5172/5172 transitions.
Graph (complete) has 3081 edges and 5151 vertex of which 50 are kept as prefixes of interest. Removing 5101 places using SCC suffix rule.11 ms
Discarding 5101 places :
Also discarding 5104 output transitions
Drop transitions removed 5104 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 26 ms. Remains 49 /5151 variables (removed 5102) and now considering 67/5172 (removed 5105) transitions.
// Phase 1: matrix 67 rows 49 cols
[2022-05-22 03:13:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:13:33] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 67 rows 49 cols
[2022-05-22 03:13:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:13:33] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [0, 2, 4, 12, 16, 18, 29, 35, 39]
Discarding 9 places :
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Implicit Place search using SMT with State Equation took 146 ms to find 9 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 40/5151 places, 59/5172 transitions.
Graph (complete) has 27 edges and 40 vertex of which 32 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 26 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 26 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 25 transition count 42
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 25 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 25 transition count 41
Applied a total of 21 rules in 6 ms. Remains 25 /40 variables (removed 15) and now considering 41/59 (removed 18) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-22 03:13:33] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:13:33] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-22 03:13:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:13:33] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 25/5151 places, 41/5172 transitions.
Finished structural reductions, in 2 iterations. Remains : 25/5151 places, 41/5172 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s21 1) (EQ s23 1)), p0:(AND (EQ s10 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25048 reset in 217 ms.
Product exploration explored 100000 steps with 24936 reset in 243 ms.
Computed a total of 25 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 41
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 p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 329 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 287 steps, including 10 resets, run visited all 3 properties in 3 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F p0)]
Knowledge based reduction with 8 factoid took 503 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2022-05-22 03:13:35] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:13:35] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 41 rows 25 cols
[2022-05-22 03:13:35] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:13:35] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 25 cols
[2022-05-22 03:13:35] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 03:13:35] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 41/41 transitions.
Computed a total of 25 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 41
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 p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 364 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 191 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Finished random walk after 508 steps, including 20 resets, run visited all 3 properties in 12 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 (NOT p0))), (F p0)]
Knowledge based reduction with 8 factoid took 456 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Product exploration explored 100000 steps with 25041 reset in 239 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 186 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 39
Applied a total of 2 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 39/41 (removed 2) transitions.
[2022-05-22 03:13:38] [INFO ] Redundant transitions in 20 ms returned [9, 21]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 37 rows 25 cols
[2022-05-22 03:13:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 03:13:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/25 places, 37/41 transitions.
Graph (complete) has 13 edges and 25 vertex of which 23 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 4 ms. Remains 23 /25 variables (removed 2) and now considering 37/37 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/25 places, 37/41 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 37/41 transitions.
Product exploration explored 100000 steps with 25027 reset in 379 ms.
Stuttering criterion allowed to conclude after 61580 steps with 15379 reset in 247 ms.
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLFireability-13 finished in 5813 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLFireability-13 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-22 03:13:39] [INFO ] Flatten gal took : 177 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 283045 ms.

BK_STOP 1653189219738

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S02D1C1A10.tgz
mv ViralEpidemic-PT-S02D1C1A10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;