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-165307353300356.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-S04D1C1A03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307353300356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 11K Apr 29 12:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 29 12:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 12:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 29 12:11 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 4.5K May 9 09:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 09:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:22 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 284K 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-S04D1C1A03-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653217857155

Running Version 202205111006
[2022-05-22 11:10:59] [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 11:10:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 11:11:00] [INFO ] Load time of PNML (sax parser for PT used): 296 ms
[2022-05-22 11:11:00] [INFO ] Transformed 511 places.
[2022-05-22 11:11:00] [INFO ] Transformed 765 transitions.
[2022-05-22 11:11:00] [INFO ] Parsed PT model containing 511 places and 765 transitions in 546 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 765/765 transitions.
Discarding 225 places :
Symmetric choice reduction at 0 with 225 rule applications. Total rules 225 place count 286 transition count 333
Iterating global reduction 0 with 225 rules applied. Total rules applied 450 place count 286 transition count 333
Applied a total of 450 rules in 118 ms. Remains 286 /511 variables (removed 225) and now considering 333/765 (removed 432) transitions.
// Phase 1: matrix 333 rows 286 cols
[2022-05-22 11:11:00] [INFO ] Computed 1 place invariants in 43 ms
[2022-05-22 11:11:01] [INFO ] Implicit Places using invariants in 653 ms returned []
// Phase 1: matrix 333 rows 286 cols
[2022-05-22 11:11:01] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-22 11:11:01] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
// Phase 1: matrix 333 rows 286 cols
[2022-05-22 11:11:01] [INFO ] Computed 1 place invariants in 33 ms
[2022-05-22 11:11:02] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/511 places, 333/765 transitions.
Finished structural reductions, in 1 iterations. Remains : 286/511 places, 333/765 transitions.
Support contains 63 out of 286 places after structural reductions.
[2022-05-22 11:11:02] [INFO ] Flatten gal took : 126 ms
[2022-05-22 11:11:02] [INFO ] Flatten gal took : 64 ms
[2022-05-22 11:11:02] [INFO ] Input system was already deterministic with 333 transitions.
Support contains 61 out of 286 places (down from 63) after GAL structural reductions.
Finished random walk after 7461 steps, including 114 resets, run visited all 32 properties in 364 ms. (steps per millisecond=20 )
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 286 stabilizing places and 333 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 286 transition count 333
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(((X(p1) U p1)&&p0)))'
Support contains 8 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Graph (complete) has 172 edges and 286 vertex of which 35 are kept as prefixes of interest. Removing 251 places using SCC suffix rule.7 ms
Discarding 251 places :
Also discarding 268 output transitions
Drop transitions removed 268 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 35 transition count 61
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 13 place count 27 transition count 40
Iterating global reduction 1 with 8 rules applied. Total rules applied 21 place count 27 transition count 40
Applied a total of 21 rules in 20 ms. Remains 27 /286 variables (removed 259) and now considering 40/333 (removed 293) transitions.
// Phase 1: matrix 40 rows 27 cols
[2022-05-22 11:11:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:03] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 40 rows 27 cols
[2022-05-22 11:11:03] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-22 11:11:03] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-22 11:11:04] [INFO ] Redundant transitions in 18 ms returned [17]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 39 rows 27 cols
[2022-05-22 11:11:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/286 places, 39/333 transitions.
Graph (complete) has 15 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 3 ms. Remains 26 /27 variables (removed 1) and now considering 38/39 (removed 1) transitions.
// Phase 1: matrix 38 rows 26 cols
[2022-05-22 11:11:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:04] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 38 rows 26 cols
[2022-05-22 11:11:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:04] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/286 places, 38/333 transitions.
Finished structural reductions, in 2 iterations. Remains : 26/286 places, 38/333 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s19 1) (OR (AND (GEQ s22 1) (GEQ s25 1)) (AND (GEQ s14 1) (GEQ s17 1)))), p1:(AND (GEQ s8 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 4 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-01 finished in 617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 236 transition count 236
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 236 transition count 236
Applied a total of 100 rules in 20 ms. Remains 236 /286 variables (removed 50) and now considering 236/333 (removed 97) transitions.
// Phase 1: matrix 236 rows 236 cols
[2022-05-22 11:11:04] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-22 11:11:04] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 236 rows 236 cols
[2022-05-22 11:11:04] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-22 11:11:05] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
// Phase 1: matrix 236 rows 236 cols
[2022-05-22 11:11:05] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-22 11:11:05] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/286 places, 236/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/286 places, 236/333 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s187 1) (LT s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 790 ms.
Product exploration explored 100000 steps with 50000 reset in 619 ms.
Computed a total of 236 stabilizing places and 236 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 236
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 :(X p0)
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-02 finished in 2713 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Graph (complete) has 172 edges and 286 vertex of which 14 are kept as prefixes of interest. Removing 272 places using SCC suffix rule.1 ms
Discarding 272 places :
Also discarding 306 output transitions
Drop transitions removed 306 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 13 transition count 19
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 11 transition count 15
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 11 transition count 15
Applied a total of 12 rules in 5 ms. Remains 11 /286 variables (removed 275) and now considering 15/333 (removed 318) transitions.
// Phase 1: matrix 15 rows 11 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:11:07] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 15 rows 11 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:11:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-22 11:11:07] [INFO ] Redundant transitions in 12 ms returned [8]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 14 rows 11 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:11:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/286 places, 14/333 transitions.
Graph (complete) has 5 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 10 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:07] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:07] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/286 places, 13/333 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/286 places, 13/333 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Graph (complete) has 172 edges and 286 vertex of which 27 are kept as prefixes of interest. Removing 259 places using SCC suffix rule.1 ms
Discarding 259 places :
Also discarding 282 output transitions
Drop transitions removed 282 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 49
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 18 transition count 27
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 18 transition count 27
Applied a total of 18 rules in 7 ms. Remains 18 /286 variables (removed 268) and now considering 27/333 (removed 306) transitions.
// Phase 1: matrix 27 rows 18 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:11:07] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 27 rows 18 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-22 11:11:07] [INFO ] Redundant transitions in 12 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 26 rows 18 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:07] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/286 places, 26/333 transitions.
Graph (complete) has 8 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 3 ms. Remains 17 /18 variables (removed 1) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 17 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:11:07] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 25 rows 17 cols
[2022-05-22 11:11:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:07] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/286 places, 25/333 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/286 places, 25/333 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s6 1)), p1:(OR (LT s13 1) (LT s16 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 11 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 finished in 369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(G(F(G(F(p0))))))&&F(X(p1)))))'
Support contains 4 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 238 transition count 239
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 238 transition count 239
Applied a total of 96 rules in 20 ms. Remains 238 /286 variables (removed 48) and now considering 239/333 (removed 94) transitions.
// Phase 1: matrix 239 rows 238 cols
[2022-05-22 11:11:07] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-22 11:11:07] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 239 rows 238 cols
[2022-05-22 11:11:08] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-22 11:11:08] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
// Phase 1: matrix 239 rows 238 cols
[2022-05-22 11:11:08] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-22 11:11:08] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/286 places, 239/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 238/286 places, 239/333 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s128 1)), p1:(AND (GEQ s25 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-05 finished in 1234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||G(p1)||F(p2)))))'
Support contains 5 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 238 transition count 239
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 238 transition count 239
Applied a total of 96 rules in 11 ms. Remains 238 /286 variables (removed 48) and now considering 239/333 (removed 94) transitions.
// Phase 1: matrix 239 rows 238 cols
[2022-05-22 11:11:09] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:11:09] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 239 rows 238 cols
[2022-05-22 11:11:09] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-22 11:11:09] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
// Phase 1: matrix 239 rows 238 cols
[2022-05-22 11:11:09] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-22 11:11:09] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/286 places, 239/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 238/286 places, 239/333 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(GEQ s147 1), p2:(OR (LT s153 1) (LT s156 1)), p1:(OR (LT s49 1) (LT s52 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 690 ms.
Product exploration explored 100000 steps with 50000 reset in 528 ms.
Computed a total of 238 stabilizing places and 239 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 239
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) p2 p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 12 factoid took 478 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 finished in 2843 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X((G((F(p3)||p2))&&p1)))&&p0)))'
Support contains 8 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 241 transition count 246
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 241 transition count 246
Applied a total of 90 rules in 11 ms. Remains 241 /286 variables (removed 45) and now considering 246/333 (removed 87) transitions.
// Phase 1: matrix 246 rows 241 cols
[2022-05-22 11:11:11] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:11:12] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 246 rows 241 cols
[2022-05-22 11:11:12] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-22 11:11:12] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
// Phase 1: matrix 246 rows 241 cols
[2022-05-22 11:11:12] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:11:12] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/286 places, 246/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 241/286 places, 246/333 transitions.
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s58 1) (GEQ s60 1)), p1:(AND (GEQ s25 1) (GEQ s26 1)), p2:(OR (LT s73 1) (LT s74 1)), p3:(OR (LT s125 1) (LT s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-07 finished in 1566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((G(p1)&&X((p2 U p3))&&p0)))))'
Support contains 7 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Graph (complete) has 172 edges and 286 vertex of which 49 are kept as prefixes of interest. Removing 237 places using SCC suffix rule.1 ms
Discarding 237 places :
Also discarding 245 output transitions
Drop transitions removed 245 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 48 transition count 80
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 20 place count 36 transition count 48
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 36 transition count 48
Applied a total of 32 rules in 9 ms. Remains 36 /286 variables (removed 250) and now considering 48/333 (removed 285) transitions.
// Phase 1: matrix 48 rows 36 cols
[2022-05-22 11:11:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:11:13] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 48 rows 36 cols
[2022-05-22 11:11:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:11:13] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-22 11:11:13] [INFO ] Redundant transitions in 15 ms returned [37]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 47 rows 36 cols
[2022-05-22 11:11:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:11:13] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/286 places, 47/333 transitions.
Graph (complete) has 19 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 35 /36 variables (removed 1) and now considering 46/47 (removed 1) transitions.
// Phase 1: matrix 46 rows 35 cols
[2022-05-22 11:11:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-22 11:11:13] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 46 rows 35 cols
[2022-05-22 11:11:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:11:13] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/286 places, 46/333 transitions.
Finished structural reductions, in 2 iterations. Remains : 35/286 places, 46/333 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p3) (NOT p0) (NOT p1)), (NOT p3)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0 p1) (AND p2 p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p2)) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(AND (GEQ s6 1) (GEQ s9 1)), p0:(AND (GEQ s6 1) (GEQ s9 1)), p1:(LT s14 1), p2:(OR (AND (GEQ s20 1) (GEQ s23 1)) (AND (GEQ s30 1) (GEQ s33 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 23 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 finished in 435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0)))&&F(X(X(p1)))))'
Support contains 4 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 237 transition count 240
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 237 transition count 240
Applied a total of 98 rules in 11 ms. Remains 237 /286 variables (removed 49) and now considering 240/333 (removed 93) transitions.
// Phase 1: matrix 240 rows 237 cols
[2022-05-22 11:11:13] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-22 11:11:14] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 240 rows 237 cols
[2022-05-22 11:11:14] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-22 11:11:14] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
// Phase 1: matrix 240 rows 237 cols
[2022-05-22 11:11:14] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-22 11:11:14] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/286 places, 240/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 237/286 places, 240/333 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (LT s69 1) (LT s71 1)), p1:(AND (GEQ s123 1) (GEQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 finished in 1138 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((X(p0)||p1)&&!p1))||G(p2)))'
Support contains 6 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 240 transition count 242
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 240 transition count 242
Applied a total of 92 rules in 6 ms. Remains 240 /286 variables (removed 46) and now considering 242/333 (removed 91) transitions.
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:14] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:11:15] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:15] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:11:15] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:15] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-22 11:11:16] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/286 places, 242/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/286 places, 242/333 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s56 1) (GEQ s57 1)), p0:(AND (GEQ s236 1) (GEQ s238 1)), p2:(OR (LT s236 1) (LT s238 1) (LT s177 1) (LT s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1766 reset in 795 ms.
Product exploration explored 100000 steps with 1724 reset in 810 ms.
Computed a total of 240 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 240 transition count 242
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) p2), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1713 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:20] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-22 11:11:20] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 6 ms returned sat
[2022-05-22 11:11:20] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-22 11:11:20] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 6 ms returned sat
[2022-05-22 11:11:21] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-22 11:11:21] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-22 11:11:21] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 5 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2)), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 28 factoid took 2352 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p0) (NOT p2))]
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:23] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:11:24] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:24] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:11:24] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:24] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:11:24] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 242/242 transitions.
Computed a total of 240 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 240 transition count 242
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) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 925 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:26] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:11:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-22 11:11:26] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-22 11:11:26] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-22 11:11:26] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-22 11:11:26] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-22 11:11:26] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 18 factoid took 1277 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 1757 reset in 398 ms.
Product exploration explored 100000 steps with 1753 reset in 461 ms.
Built C files in :
/tmp/ltsmin16790572324490777044
[2022-05-22 11:11:29] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16790572324490777044
Running compilation step : cd /tmp/ltsmin16790572324490777044;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 749 ms.
Running link step : cd /tmp/ltsmin16790572324490777044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16790572324490777044;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2798124920252828290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:44] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-22 11:11:45] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:45] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-22 11:11:45] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 240 cols
[2022-05-22 11:11:45] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-22 11:11:45] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 242/242 transitions.
Built C files in :
/tmp/ltsmin11250032334299188459
[2022-05-22 11:11:45] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11250032334299188459
Running compilation step : cd /tmp/ltsmin11250032334299188459;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 550 ms.
Running link step : cd /tmp/ltsmin11250032334299188459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11250032334299188459;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3656455008619806862.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 11:12:00] [INFO ] Flatten gal took : 24 ms
[2022-05-22 11:12:00] [INFO ] Flatten gal took : 19 ms
[2022-05-22 11:12:00] [INFO ] Time to serialize gal into /tmp/LTL10043815138246334941.gal : 6 ms
[2022-05-22 11:12:00] [INFO ] Time to serialize properties into /tmp/LTL1304043179534261460.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10043815138246334941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1304043179534261460.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/LTL1004381...267
Read 1 LTL properties
Checking formula 0 : !(((F(((X("((dFactor3444>=1)&&(patient4441>=1))"))||("((cFactor3143>=1)&&(patient1431>=1))"))&&("((cFactor3143<1)||(patient1431<1))"))...239
Formula 0 simplified : !(F("((cFactor3143<1)||(patient1431<1))" & ("((cFactor3143>=1)&&(patient1431>=1))" | X"((dFactor3444>=1)&&(patient4441>=1))")) | G"(...228
Detected timeout of ITS tools.
[2022-05-22 11:12:15] [INFO ] Flatten gal took : 17 ms
[2022-05-22 11:12:15] [INFO ] Applying decomposition
[2022-05-22 11:12:15] [INFO ] Flatten gal took : 17 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/graph15953450312291640989.txt' '-o' '/tmp/graph15953450312291640989.bin' '-w' '/tmp/graph15953450312291640989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15953450312291640989.bin' '-l' '-1' '-v' '-w' '/tmp/graph15953450312291640989.weights' '-q' '0' '-e' '0.001'
[2022-05-22 11:12:16] [INFO ] Decomposing Gal with order
[2022-05-22 11:12:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 11:12:16] [INFO ] Removed a total of 79 redundant transitions.
[2022-05-22 11:12:16] [INFO ] Flatten gal took : 88 ms
[2022-05-22 11:12:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 13 ms.
[2022-05-22 11:12:16] [INFO ] Time to serialize gal into /tmp/LTL11814059761278379518.gal : 9 ms
[2022-05-22 11:12:16] [INFO ] Time to serialize properties into /tmp/LTL15781036094339063872.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11814059761278379518.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15781036094339063872.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/LTL1181405...247
Read 1 LTL properties
Checking formula 0 : !(((F(((X("((u153.dFactor3444>=1)&&(i99.u155.patient4441>=1))"))||("((u37.cFactor3143>=1)&&(i23.u38.patient1431>=1))"))&&("((u37.cFact...305
Formula 0 simplified : !(F("((u37.cFactor3143<1)||(i23.u38.patient1431<1))" & ("((u37.cFactor3143>=1)&&(i23.u38.patient1431>=1))" | X"((u153.dFactor3444>=1...294
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14592849143000560268
[2022-05-22 11:12:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14592849143000560268
Running compilation step : cd /tmp/ltsmin14592849143000560268;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 526 ms.
Running link step : cd /tmp/ltsmin14592849143000560268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14592849143000560268;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((X((LTLAPp0==true))||(LTLAPp1==true))&&!(LTLAPp1==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-12 finished in 91517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U F(p1)) U ((p0 U p2)||X(!G(F(p1)))))))'
Support contains 4 out of 286 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 239 transition count 243
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 239 transition count 243
Applied a total of 94 rules in 6 ms. Remains 239 /286 variables (removed 47) and now considering 243/333 (removed 90) transitions.
// Phase 1: matrix 243 rows 239 cols
[2022-05-22 11:12:46] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-22 11:12:46] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 243 rows 239 cols
[2022-05-22 11:12:46] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-22 11:12:46] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 239 cols
[2022-05-22 11:12:46] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-22 11:12:47] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/286 places, 243/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 239/286 places, 243/333 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s113 1) (GEQ s116 1)), p2:(AND (GEQ s108 1) (GEQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2111 reset in 668 ms.
Product exploration explored 100000 steps with 2124 reset in 710 ms.
Computed a total of 239 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 239 transition count 243
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 p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 7 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-13 finished in 2522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X(G(p1))))'
Support contains 4 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 238 transition count 239
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 238 transition count 239
Applied a total of 96 rules in 10 ms. Remains 238 /286 variables (removed 48) and now considering 239/333 (removed 94) transitions.
// Phase 1: matrix 239 rows 238 cols
[2022-05-22 11:12:49] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-22 11:12:49] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 239 rows 238 cols
[2022-05-22 11:12:49] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:12:49] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
// Phase 1: matrix 239 rows 238 cols
[2022-05-22 11:12:49] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-22 11:12:50] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/286 places, 239/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 238/286 places, 239/333 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s232 1) (LT s234 1)), p0:(AND (GEQ s86 1) (GEQ s88 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-14 finished in 1278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((X(p0)||p1)&&!p1))||G(p2)))'
Found a CL insensitive property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-12
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 286 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 286/286 places, 333/333 transitions.
Graph (complete) has 172 edges and 286 vertex of which 35 are kept as prefixes of interest. Removing 251 places using SCC suffix rule.1 ms
Discarding 251 places :
Also discarding 267 output transitions
Drop transitions removed 267 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 34 transition count 50
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 30 transition count 40
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 30 transition count 40
Applied a total of 24 rules in 9 ms. Remains 30 /286 variables (removed 256) and now considering 40/333 (removed 293) transitions.
// Phase 1: matrix 40 rows 30 cols
[2022-05-22 11:12:50] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:12:50] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 40 rows 30 cols
[2022-05-22 11:12:50] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-22 11:12:50] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 30 cols
[2022-05-22 11:12:50] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-22 11:12:50] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 30/286 places, 40/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/286 places, 40/333 transitions.
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s7 1) (GEQ s8 1)), p0:(AND (GEQ s26 1) (GEQ s28 1)), p2:(OR (LT s26 1) (LT s28 1) (LT s18 1) (LT s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5164 reset in 318 ms.
Stuttering criterion allowed to conclude after 44491 steps with 2302 reset in 156 ms.
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-12 finished in 1030 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-22 11:12:51] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6735103831345071953
[2022-05-22 11:12:51] [INFO ] Computing symmetric may disable matrix : 333 transitions.
[2022-05-22 11:12:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 11:12:51] [INFO ] Computing symmetric may enable matrix : 333 transitions.
[2022-05-22 11:12:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 11:12:51] [INFO ] Applying decomposition
[2022-05-22 11:12:51] [INFO ] Flatten gal took : 28 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/graph5838239826738097273.txt' '-o' '/tmp/graph5838239826738097273.bin' '-w' '/tmp/graph5838239826738097273.weights'
[2022-05-22 11:12:51] [INFO ] Computing Do-Not-Accords matrix : 333 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5838239826738097273.bin' '-l' '-1' '-v' '-w' '/tmp/graph5838239826738097273.weights' '-q' '0' '-e' '0.001'
[2022-05-22 11:12:51] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 11:12:51] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6735103831345071953
Running compilation step : cd /tmp/ltsmin6735103831345071953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-22 11:12:51] [INFO ] Decomposing Gal with order
[2022-05-22 11:12:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 11:12:51] [INFO ] Removed a total of 215 redundant transitions.
[2022-05-22 11:12:51] [INFO ] Flatten gal took : 83 ms
[2022-05-22 11:12:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 19 ms.
[2022-05-22 11:12:51] [INFO ] Time to serialize gal into /tmp/LTLFireability13946699657875685007.gal : 10 ms
[2022-05-22 11:12:51] [INFO ] Time to serialize properties into /tmp/LTLFireability6834628367979635951.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13946699657875685007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6834628367979635951.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((F(((X("((u178.dFactor3444>=1)&&(i121.u180.patient4441>=1))"))||("((u45.cFactor3143>=1)&&(i30.u43.patient1431>=1))"))&&("((u45.cFac...307
Formula 0 simplified : !(F("((u45.cFactor3143<1)||(i30.u43.patient1431<1))" & ("((u45.cFactor3143>=1)&&(i30.u43.patient1431>=1))" | X"((u178.dFactor3444>=1...296
Compilation finished in 1209 ms.
Running link step : cd /tmp/ltsmin6735103831345071953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6735103831345071953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((X((LTLAPp0==true))||(LTLAPp1==true))&&!(LTLAPp1==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: LTL layer: formula: (<>(((X((LTLAPp0==true))||(LTLAPp1==true))&&!(LTLAPp1==true)))||[]((LTLAPp2==true)))
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: "(<>(((X((LTLAPp0==true))||(LTLAPp1==true))&&!(LTLAPp1==true)))||[]((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.027: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.187: DFS-FIFO for weak LTL, using special progress label 337
pins2lts-mc-linux64( 0/ 8), 0.187: There are 338 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.187: State length is 287, there are 345 groups
pins2lts-mc-linux64( 0/ 8), 0.187: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.187: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.187: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.187: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.323: ~1 levels ~960 states ~12840 transitions
pins2lts-mc-linux64( 4/ 8), 0.514: ~1 levels ~1920 states ~33808 transitions
pins2lts-mc-linux64( 4/ 8), 0.847: ~1 levels ~3840 states ~79080 transitions
pins2lts-mc-linux64( 4/ 8), 1.281: ~1 levels ~7680 states ~156512 transitions
pins2lts-mc-linux64( 4/ 8), 1.947: ~1 levels ~15360 states ~301000 transitions
pins2lts-mc-linux64( 4/ 8), 3.291: ~1 levels ~30720 states ~618480 transitions
pins2lts-mc-linux64( 4/ 8), 5.249: ~1 levels ~61440 states ~1409088 transitions
pins2lts-mc-linux64( 2/ 8), 8.008: ~1 levels ~122880 states ~2924776 transitions
pins2lts-mc-linux64( 2/ 8), 12.426: ~1 levels ~245760 states ~6158328 transitions
pins2lts-mc-linux64( 4/ 8), 20.345: ~1 levels ~491520 states ~12403864 transitions
pins2lts-mc-linux64( 4/ 8), 36.335: ~1 levels ~983040 states ~23989456 transitions
pins2lts-mc-linux64( 4/ 8), 73.919: ~1 levels ~1966080 states ~53251568 transitions
pins2lts-mc-linux64( 2/ 8), 145.990: ~1 levels ~3932160 states ~106875072 transitions
pins2lts-mc-linux64( 2/ 8), 294.767: ~1 levels ~7864320 states ~220928496 transitions
pins2lts-mc-linux64( 2/ 8), 611.879: ~1 levels ~15728640 states ~458137784 transitions
pins2lts-mc-linux64( 6/ 8), 629.045: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 629.708:
pins2lts-mc-linux64( 0/ 8), 629.708: mean standard work distribution: 5.2% (states) 1.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 629.709:
pins2lts-mc-linux64( 0/ 8), 629.709: Explored 14689504 states 477968116 transitions, fanout: 32.538
pins2lts-mc-linux64( 0/ 8), 629.709: Total exploration time 629.500 sec (628.850 sec minimum, 628.997 sec on average)
pins2lts-mc-linux64( 0/ 8), 629.709: States per second: 23335, Transitions per second: 759282
pins2lts-mc-linux64( 0/ 8), 629.709:
pins2lts-mc-linux64( 0/ 8), 629.709: Progress states detected: 109393524
pins2lts-mc-linux64( 0/ 8), 629.709: Redundant explorations: -86.5719
pins2lts-mc-linux64( 0/ 8), 629.709:
pins2lts-mc-linux64( 0/ 8), 629.709: Queue width: 8B, total height: 141004096, memory: 1075.78MB
pins2lts-mc-linux64( 0/ 8), 629.709: Tree memory: 1090.6MB, 10.5 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 629.709: Tree fill ratio (roots/leafs): 81.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 629.709: Stored 346 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 629.709: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 629.709: Est. total memory use: 2166.4MB (~2099.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6735103831345071953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((X((LTLAPp0==true))||(LTLAPp1==true))&&!(LTLAPp1==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6735103831345071953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((X((LTLAPp0==true))||(LTLAPp1==true))&&!(LTLAPp1==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-22 11:33:32] [INFO ] Flatten gal took : 543 ms
[2022-05-22 11:33:32] [INFO ] Time to serialize gal into /tmp/LTLFireability6980169291152817082.gal : 237 ms
[2022-05-22 11:33:32] [INFO ] Time to serialize properties into /tmp/LTLFireability6963359074541175857.ltl : 13 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/LTLFireability6980169291152817082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6963359074541175857.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !(((F(((X("((dFactor3444>=1)&&(patient4441>=1))"))||("((cFactor3143>=1)&&(patient1431>=1))"))&&("((cFactor3143<1)||(patient1431<1))"))...239
Formula 0 simplified : !(F("((cFactor3143<1)||(patient1431<1))" & ("((cFactor3143>=1)&&(patient1431>=1))" | X"((dFactor3444>=1)&&(patient4441>=1))")) | G"(...228
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t8, t9, t10, t13, t14, t17, t18, t21, t24, t26, t27, t33, t41, t46, t48, ...814
Computing Next relation with stutter on 1.2006e+23 deadlock states
Detected timeout of ITS tools.
[2022-05-22 11:54:10] [INFO ] Flatten gal took : 108 ms
[2022-05-22 11:54:11] [INFO ] Input system was already deterministic with 333 transitions.
[2022-05-22 11:54:12] [INFO ] Transformed 286 places.
[2022-05-22 11:54:12] [INFO ] Transformed 333 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-22 11:54:12] [INFO ] Time to serialize gal into /tmp/LTLFireability15386101434598777515.gal : 11 ms
[2022-05-22 11:54:12] [INFO ] Time to serialize properties into /tmp/LTLFireability9222670285685160226.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15386101434598777515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9222670285685160226.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(((X("((dFactor3444>=1)&&(patient4441>=1))"))||("((cFactor3143>=1)&&(patient1431>=1))"))&&("((cFactor3143<1)||(patient1431<1))"))...239
Formula 0 simplified : !(F("((cFactor3143<1)||(patient1431<1))" & ("((cFactor3143>=1)&&(patient1431>=1))" | X"((dFactor3444>=1)&&(patient4441>=1))")) | G"(...228

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ViralEpidemic-PT-S04D1C1A03"
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-S04D1C1A03, 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-165307353300356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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