Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 54M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.2K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 07:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 07:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 06:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 06:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717234074852

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S16D2C4A03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-01 09:27:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-01 09:27:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:28:01] [INFO ] Load time of PNML (sax parser for PT used): 2473 ms
[2024-06-01 09:28:01] [INFO ] Transformed 78643 places.
[2024-06-01 09:28:01] [INFO ] Transformed 144177 transitions.
[2024-06-01 09:28:01] [INFO ] Parsed PT model containing 78643 places and 144177 transitions and 353889 arcs in 3068 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 78643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78643/78643 places, 144177/144177 transitions.
Discarding 4046 places :
Symmetric choice reduction at 0 with 4046 rule applications. Total rules 4046 place count 74597 transition count 79441
Iterating global reduction 0 with 4046 rules applied. Total rules applied 8092 place count 74597 transition count 79441
Discarding 4266 places :
Symmetric choice reduction at 0 with 4266 rule applications. Total rules 12358 place count 70331 transition count 70909
Iterating global reduction 0 with 4266 rules applied. Total rules applied 16624 place count 70331 transition count 70909
Applied a total of 16624 rules in 90625 ms. Remains 70331 /78643 variables (removed 8312) and now considering 70909/144177 (removed 73268) transitions.
// Phase 1: matrix 70909 rows 70331 cols
[2024-06-01 09:29:41] [INFO ] Invariants computation overflowed in 8918 ms
[2024-06-01 09:29:50] [INFO ] Implicit Places using invariants in 17909 ms returned []
Implicit Place search using SMT only with invariants took 17957 ms to find 0 implicit places.
// Phase 1: matrix 70909 rows 70331 cols
[2024-06-01 09:29:58] [INFO ] Invariants computation overflowed in 7545 ms
[2024-06-01 09:30:07] [INFO ] Dead Transitions using invariants and state equation in 16572 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70331/78643 places, 70909/144177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125173 ms. Remains : 70331/78643 places, 70909/144177 transitions.
Support contains 60 out of 70331 places after structural reductions.
[2024-06-01 09:30:11] [INFO ] Flatten gal took : 3082 ms
[2024-06-01 09:30:13] [INFO ] Flatten gal took : 2348 ms
[2024-06-01 09:30:18] [INFO ] Input system was already deterministic with 70909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6408 ms. (steps per millisecond=1 ) properties (out of 29) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 800 ms. (steps per millisecond=12 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 925 ms. (steps per millisecond=10 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 796 ms. (steps per millisecond=12 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 908 ms. (steps per millisecond=11 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 797 ms. (steps per millisecond=12 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 991 ms. (steps per millisecond=10 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 982 ms. (steps per millisecond=10 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1102 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 834 ms. (steps per millisecond=11 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 811 ms. (steps per millisecond=12 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=12 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 70909 rows 70331 cols
[2024-06-01 09:30:43] [INFO ] Invariants computation overflowed in 6962 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-01 09:31:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 09:31:09] [INFO ] After 25562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 70331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Graph (complete) has 65638 edges and 70331 vertex of which 100 are kept as prefixes of interest. Removing 70231 places using SCC suffix rule.92 ms
Discarding 70231 places :
Also discarding 70727 output transitions
Drop transitions removed 70727 transitions
Drop transitions removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 100 transition count 84
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 104 place count 95 transition count 84
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 104 place count 95 transition count 71
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 130 place count 82 transition count 71
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 145 place count 67 transition count 56
Iterating global reduction 2 with 15 rules applied. Total rules applied 160 place count 67 transition count 56
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 2 with 6 rules applied. Total rules applied 166 place count 64 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 63 transition count 52
Applied a total of 167 rules in 311 ms. Remains 63 /70331 variables (removed 70268) and now considering 52/70909 (removed 70857) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 63/70331 places, 52/70909 transitions.
Finished random walk after 410 steps, including 6 resets, run visited all 12 properties in 4 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 70331 stabilizing places and 70909 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70331 transition count 70909
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p1))&&p0))))'
Support contains 4 out of 70331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 70282 transition count 70804
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 70282 transition count 70804
Applied a total of 98 rules in 34304 ms. Remains 70282 /70331 variables (removed 49) and now considering 70804/70909 (removed 105) transitions.
// Phase 1: matrix 70804 rows 70282 cols
[2024-06-01 09:31:53] [INFO ] Invariants computation overflowed in 8365 ms
[2024-06-01 09:32:02] [INFO ] Implicit Places using invariants in 17208 ms returned []
Implicit Place search using SMT only with invariants took 17219 ms to find 0 implicit places.
// Phase 1: matrix 70804 rows 70282 cols
[2024-06-01 09:32:11] [INFO ] Invariants computation overflowed in 8976 ms
[2024-06-01 09:32:19] [INFO ] Dead Transitions using invariants and state equation in 17758 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70282/70331 places, 70804/70909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69296 ms. Remains : 70282/70331 places, 70804/70909 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s5868 1) (GEQ s5912 1)), p1:(AND (GEQ s46173 1) (GEQ s46199 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 23 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-00 finished in 70071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 70331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Graph (complete) has 65638 edges and 70331 vertex of which 64 are kept as prefixes of interest. Removing 70267 places using SCC suffix rule.156 ms
Discarding 70267 places :
Also discarding 70770 output transitions
Drop transitions removed 70770 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 63 transition count 113
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 65 place count 24 transition count 35
Iterating global reduction 1 with 39 rules applied. Total rules applied 104 place count 24 transition count 35
Applied a total of 104 rules in 301 ms. Remains 24 /70331 variables (removed 70307) and now considering 35/70909 (removed 70874) transitions.
// Phase 1: matrix 35 rows 24 cols
[2024-06-01 09:32:20] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:32:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 09:32:20] [INFO ] Invariant cache hit.
[2024-06-01 09:32:20] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-01 09:32:21] [INFO ] Redundant transitions in 29 ms returned [5, 9, 17, 23, 27]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
// Phase 1: matrix 30 rows 24 cols
[2024-06-01 09:32:21] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:32:21] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/70331 places, 30/70909 transitions.
Graph (complete) has 12 edges and 24 vertex of which 19 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
Applied a total of 1 rules in 3 ms. Remains 19 /24 variables (removed 5) and now considering 25/30 (removed 5) transitions.
// Phase 1: matrix 25 rows 19 cols
[2024-06-01 09:32:21] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:32:21] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 09:32:21] [INFO ] Invariant cache hit.
[2024-06-01 09:32:21] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/70331 places, 25/70909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 556 ms. Remains : 19/70331 places, 25/70909 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s6 1) (LT s9 1)), p0:(OR (LT s16 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2932 reset in 438 ms.
Product exploration explored 100000 steps with 2923 reset in 189 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 25
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 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 25 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-01 finished in 1428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(G(p1))&&F(p2))))'
Support contains 4 out of 70331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 70281 transition count 70817
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 70281 transition count 70817
Applied a total of 100 rules in 33543 ms. Remains 70281 /70331 variables (removed 50) and now considering 70817/70909 (removed 92) transitions.
// Phase 1: matrix 70817 rows 70281 cols
[2024-06-01 09:33:00] [INFO ] Invariants computation overflowed in 4445 ms
[2024-06-01 09:33:08] [INFO ] Implicit Places using invariants in 12978 ms returned []
Implicit Place search using SMT only with invariants took 12985 ms to find 0 implicit places.
// Phase 1: matrix 70817 rows 70281 cols
[2024-06-01 09:33:13] [INFO ] Invariants computation overflowed in 5017 ms
[2024-06-01 09:33:22] [INFO ] Dead Transitions using invariants and state equation in 13551 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70281/70331 places, 70817/70909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60089 ms. Remains : 70281/70331 places, 70817/70909 transitions.
Stuttering acceptance computed with spot in 330 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (LT s26713 1) (LT s27213 1) (LT s59444 1) (LT s59487 1)), p2:(OR (LT s26713 1) (LT s27213 1)), p0:(AND (GEQ s59444 1) (GEQ s59487 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, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 18700 steps with 2 reset in 10004 ms.
Product exploration timeout after 17060 steps with 2 reset in 10006 ms.
Computed a total of 70281 stabilizing places and 70817 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70281 transition count 70817
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (AND (NOT p0) p2 p1)), (X (AND p2 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND p2 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 5289 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5610 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75571 steps, run timeout after 18027 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 75571 steps, saw 74819 distinct states, run finished after 18029 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 70817 rows 70281 cols
[2024-06-01 09:34:38] [INFO ] Invariants computation overflowed in 4882 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-01 09:35:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 09:35:03] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 70281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70281/70281 places, 70817/70817 transitions.
Graph (complete) has 65612 edges and 70281 vertex of which 28 are kept as prefixes of interest. Removing 70253 places using SCC suffix rule.28 ms
Discarding 70253 places :
Also discarding 70753 output transitions
Drop transitions removed 70753 transitions
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 28 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 27 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 40 place count 27 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 25 transition count 24
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 58 place count 11 transition count 10
Iterating global reduction 2 with 14 rules applied. Total rules applied 72 place count 11 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 10 transition count 9
Applied a total of 73 rules in 128 ms. Remains 10 /70281 variables (removed 70271) and now considering 9/70817 (removed 70808) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 10/70281 places, 9/70817 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (AND (NOT p0) p2 p1)), (X (AND p2 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND p2 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 28 factoid took 6549 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-02 finished in 168696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(G(p2)||F(p3)))))'
Support contains 7 out of 70331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 70283 transition count 70806
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 70283 transition count 70806
Applied a total of 96 rules in 31944 ms. Remains 70283 /70331 variables (removed 48) and now considering 70806/70909 (removed 103) transitions.
// Phase 1: matrix 70806 rows 70283 cols
[2024-06-01 09:35:46] [INFO ] Invariants computation overflowed in 3707 ms
[2024-06-01 09:35:54] [INFO ] Implicit Places using invariants in 12258 ms returned []
Implicit Place search using SMT only with invariants took 12269 ms to find 0 implicit places.
// Phase 1: matrix 70806 rows 70283 cols
[2024-06-01 09:35:58] [INFO ] Invariants computation overflowed in 3425 ms
[2024-06-01 09:36:06] [INFO ] Dead Transitions using invariants and state equation in 12068 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70283/70331 places, 70806/70909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56286 ms. Remains : 70283/70331 places, 70806/70909 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s48763 1), p0:(AND (GEQ s61917 1) (GEQ s61938 1)), p2:(OR (AND (GEQ s15784 1) (GEQ s15842 1)) (GEQ s48763 1)), p3:(AND (GEQ s39700 1) (GEQ s39726 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8101 steps with 0 reset in 4526 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-03 finished in 61208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 70331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Graph (complete) has 65638 edges and 70331 vertex of which 30 are kept as prefixes of interest. Removing 70301 places using SCC suffix rule.85 ms
Discarding 70301 places :
Also discarding 70834 output transitions
Drop transitions removed 70834 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 29 transition count 51
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 40 place count 13 transition count 19
Iterating global reduction 1 with 16 rules applied. Total rules applied 56 place count 13 transition count 19
Applied a total of 56 rules in 204 ms. Remains 13 /70331 variables (removed 70318) and now considering 19/70909 (removed 70890) transitions.
// Phase 1: matrix 19 rows 13 cols
[2024-06-01 09:36:12] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:36:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 09:36:12] [INFO ] Invariant cache hit.
[2024-06-01 09:36:12] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 09:36:12] [INFO ] Redundant transitions in 15 ms returned [6, 11, 18]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 16 rows 13 cols
[2024-06-01 09:36:12] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:36:12] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/70331 places, 16/70909 transitions.
Graph (complete) has 6 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 2 ms. Remains 10 /13 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-06-01 09:36:12] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:36:12] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 09:36:12] [INFO ] Invariant cache hit.
[2024-06-01 09:36:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/70331 places, 13/70909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 10/70331 places, 13/70909 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-04 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 19 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-04 finished in 531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 4 out of 70331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Graph (complete) has 65638 edges and 70331 vertex of which 52 are kept as prefixes of interest. Removing 70279 places using SCC suffix rule.67 ms
Discarding 70279 places :
Also discarding 70782 output transitions
Drop transitions removed 70782 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 51 transition count 88
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 66 place count 24 transition count 34
Iterating global reduction 1 with 27 rules applied. Total rules applied 93 place count 24 transition count 34
Applied a total of 93 rules in 182 ms. Remains 24 /70331 variables (removed 70307) and now considering 34/70909 (removed 70875) transitions.
// Phase 1: matrix 34 rows 24 cols
[2024-06-01 09:36:12] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:36:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 09:36:12] [INFO ] Invariant cache hit.
[2024-06-01 09:36:12] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-01 09:36:12] [INFO ] Redundant transitions in 17 ms returned [4, 9, 19, 23]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 30 rows 24 cols
[2024-06-01 09:36:12] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:36:12] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/70331 places, 30/70909 transitions.
Graph (complete) has 12 edges and 24 vertex of which 20 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 3 ms. Remains 20 /24 variables (removed 4) and now considering 26/30 (removed 4) transitions.
// Phase 1: matrix 26 rows 20 cols
[2024-06-01 09:36:12] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:36:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 09:36:12] [INFO ] Invariant cache hit.
[2024-06-01 09:36:12] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/70331 places, 26/70909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 493 ms. Remains : 20/70331 places, 26/70909 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s15 1) (GEQ s19 1)), p0:(OR (LT s9 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 238 steps with 5 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-05 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(p1)))||G(p2)))'
Support contains 8 out of 70331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 70286 transition count 70810
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 70286 transition count 70810
Applied a total of 90 rules in 42096 ms. Remains 70286 /70331 variables (removed 45) and now considering 70810/70909 (removed 99) transitions.
// Phase 1: matrix 70810 rows 70286 cols
[2024-06-01 09:36:59] [INFO ] Invariants computation overflowed in 4347 ms
[2024-06-01 09:37:07] [INFO ] Implicit Places using invariants in 12381 ms returned []
Implicit Place search using SMT only with invariants took 12389 ms to find 0 implicit places.
// Phase 1: matrix 70810 rows 70286 cols
[2024-06-01 09:37:12] [INFO ] Invariants computation overflowed in 4542 ms
[2024-06-01 09:37:20] [INFO ] Dead Transitions using invariants and state equation in 13211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70286/70331 places, 70810/70909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67703 ms. Remains : 70286/70331 places, 70810/70909 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(AND (GEQ s24066 1) (GEQ s24076 1)), p1:(AND (GEQ s33433 1) (GEQ s33440 1)), p2:(OR (AND (GEQ s46850 1) (GEQ s46871 1)) (AND (GEQ s43370 1) (GEQ s43402...], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 10 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-06 finished in 68138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 70331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Graph (complete) has 65638 edges and 70331 vertex of which 20 are kept as prefixes of interest. Removing 70311 places using SCC suffix rule.51 ms
Discarding 70311 places :
Also discarding 70844 output transitions
Drop transitions removed 70844 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 19 transition count 31
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 12 transition count 17
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 12 transition count 17
Applied a total of 48 rules in 123 ms. Remains 12 /70331 variables (removed 70319) and now considering 17/70909 (removed 70892) transitions.
// Phase 1: matrix 17 rows 12 cols
[2024-06-01 09:37:21] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:37:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 09:37:21] [INFO ] Invariant cache hit.
[2024-06-01 09:37:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 09:37:21] [INFO ] Redundant transitions in 18 ms returned [14, 16]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-06-01 09:37:21] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:37:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/70331 places, 15/70909 transitions.
Graph (complete) has 5 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-06-01 09:37:21] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:37:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 09:37:21] [INFO ] Invariant cache hit.
[2024-06-01 09:37:21] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/70331 places, 13/70909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 10/70331 places, 13/70909 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 1 reset in 1 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-07 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 70331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Graph (complete) has 65638 edges and 70331 vertex of which 46 are kept as prefixes of interest. Removing 70285 places using SCC suffix rule.69 ms
Discarding 70285 places :
Also discarding 70788 output transitions
Drop transitions removed 70788 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 45 transition count 77
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 64 place count 25 transition count 37
Iterating global reduction 1 with 20 rules applied. Total rules applied 84 place count 25 transition count 37
Applied a total of 84 rules in 189 ms. Remains 25 /70331 variables (removed 70306) and now considering 37/70909 (removed 70872) transitions.
// Phase 1: matrix 37 rows 25 cols
[2024-06-01 09:37:21] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:37:21] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 09:37:21] [INFO ] Invariant cache hit.
[2024-06-01 09:37:22] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-01 09:37:22] [INFO ] Redundant transitions in 26 ms returned [3, 11, 16, 18, 33, 35]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
// Phase 1: matrix 31 rows 25 cols
[2024-06-01 09:37:22] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:37:22] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/70331 places, 31/70909 transitions.
Graph (complete) has 13 edges and 25 vertex of which 19 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
Applied a total of 1 rules in 1 ms. Remains 19 /25 variables (removed 6) and now considering 25/31 (removed 6) transitions.
// Phase 1: matrix 25 rows 19 cols
[2024-06-01 09:37:22] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:37:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 09:37:22] [INFO ] Invariant cache hit.
[2024-06-01 09:37:22] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/70331 places, 25/70909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 19/70331 places, 25/70909 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-08 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:(OR (LT s16 1) (LT s18 1) (AND (GEQ s8 1) (GEQ s11 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3150 reset in 223 ms.
Product exploration explored 100000 steps with 3139 reset in 324 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 25
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 (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-08 finished in 1209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 8 out of 70331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Graph (complete) has 65638 edges and 70331 vertex of which 112 are kept as prefixes of interest. Removing 70219 places using SCC suffix rule.73 ms
Discarding 70219 places :
Also discarding 70647 output transitions
Drop transitions removed 70647 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 111 transition count 214
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 114 place count 45 transition count 68
Iterating global reduction 1 with 66 rules applied. Total rules applied 180 place count 45 transition count 68
Applied a total of 180 rules in 220 ms. Remains 45 /70331 variables (removed 70286) and now considering 68/70909 (removed 70841) transitions.
// Phase 1: matrix 68 rows 45 cols
[2024-06-01 09:37:23] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:37:23] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 09:37:23] [INFO ] Invariant cache hit.
[2024-06-01 09:37:23] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-06-01 09:37:23] [INFO ] Redundant transitions in 36 ms returned [7, 15, 19, 28, 44, 48, 60, 62, 64, 67]
Found 10 redundant transitions using SMT.
Drop transitions removed 10 transitions
Redundant transitions reduction (with SMT) removed 10 transitions.
// Phase 1: matrix 58 rows 45 cols
[2024-06-01 09:37:23] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:37:23] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/70331 places, 58/70909 transitions.
Graph (complete) has 24 edges and 45 vertex of which 35 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 2 ms. Remains 35 /45 variables (removed 10) and now considering 48/58 (removed 10) transitions.
// Phase 1: matrix 48 rows 35 cols
[2024-06-01 09:37:23] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:37:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 09:37:23] [INFO ] Invariant cache hit.
[2024-06-01 09:37:23] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/70331 places, 48/70909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 569 ms. Remains : 35/70331 places, 48/70909 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-09 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 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s15 1) (LT s4 1) (LT s7 1)), p1:(OR (LT s29 1) (LT s34 1)), p2:(OR (LT s24 1) (LT s27 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 2089 reset in 159 ms.
Product exploration explored 100000 steps with 2089 reset in 186 ms.
Computed a total of 35 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 48
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 p0 p1 p2), (X p2), (X p0), (X p1), (X (X p2)), (X (X p0)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-09 finished in 1279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 70331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Graph (complete) has 65638 edges and 70331 vertex of which 24 are kept as prefixes of interest. Removing 70307 places using SCC suffix rule.60 ms
Discarding 70307 places :
Also discarding 70839 output transitions
Drop transitions removed 70839 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 23 transition count 39
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 14 transition count 21
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 14 transition count 21
Applied a total of 49 rules in 143 ms. Remains 14 /70331 variables (removed 70317) and now considering 21/70909 (removed 70888) transitions.
// Phase 1: matrix 21 rows 14 cols
[2024-06-01 09:37:24] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:37:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 09:37:24] [INFO ] Invariant cache hit.
[2024-06-01 09:37:24] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 09:37:24] [INFO ] Redundant transitions in 14 ms returned [4, 10, 20]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-06-01 09:37:24] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:37:24] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/70331 places, 18/70909 transitions.
Graph (complete) has 7 edges and 14 vertex of which 11 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 15/18 (removed 3) transitions.
// Phase 1: matrix 15 rows 11 cols
[2024-06-01 09:37:24] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:37:24] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 09:37:24] [INFO ] Invariant cache hit.
[2024-06-01 09:37:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/70331 places, 15/70909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 311 ms. Remains : 11/70331 places, 15/70909 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-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 (LT s7 1) (LT s10 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 4857 reset in 67 ms.
Product exploration explored 100000 steps with 4854 reset in 75 ms.
Computed a total of 11 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 15
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 (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-10 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 3 out of 70331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 70280 transition count 70801
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 70280 transition count 70801
Applied a total of 102 rules in 46849 ms. Remains 70280 /70331 variables (removed 51) and now considering 70801/70909 (removed 108) transitions.
// Phase 1: matrix 70801 rows 70280 cols
[2024-06-01 09:38:15] [INFO ] Invariants computation overflowed in 3722 ms
[2024-06-01 09:38:23] [INFO ] Implicit Places using invariants in 12116 ms returned []
Implicit Place search using SMT only with invariants took 12122 ms to find 0 implicit places.
// Phase 1: matrix 70801 rows 70280 cols
[2024-06-01 09:38:27] [INFO ] Invariants computation overflowed in 3171 ms
[2024-06-01 09:38:35] [INFO ] Dead Transitions using invariants and state equation in 11737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70280/70331 places, 70801/70909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70725 ms. Remains : 70280/70331 places, 70801/70909 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-12 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: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s23033 1) (LT s23043 1)), p1:(LT s5365 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][false, false, false]]
Product exploration timeout after 15480 steps with 5160 reset in 10005 ms.
Product exploration timeout after 15510 steps with 5170 reset in 10007 ms.
Computed a total of 70280 stabilizing places and 70801 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70280 transition count 70801
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-12 finished in 112401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 70331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Graph (complete) has 65638 edges and 70331 vertex of which 56 are kept as prefixes of interest. Removing 70275 places using SCC suffix rule.50 ms
Discarding 70275 places :
Also discarding 70778 output transitions
Drop transitions removed 70778 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 55 transition count 97
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 65 place count 24 transition count 35
Iterating global reduction 1 with 31 rules applied. Total rules applied 96 place count 24 transition count 35
Applied a total of 96 rules in 130 ms. Remains 24 /70331 variables (removed 70307) and now considering 35/70909 (removed 70874) transitions.
// Phase 1: matrix 35 rows 24 cols
[2024-06-01 09:39:17] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:39:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 09:39:17] [INFO ] Invariant cache hit.
[2024-06-01 09:39:17] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-01 09:39:17] [INFO ] Redundant transitions in 17 ms returned [5, 9, 17, 24, 32]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
// Phase 1: matrix 30 rows 24 cols
[2024-06-01 09:39:17] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 09:39:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/70331 places, 30/70909 transitions.
Graph (complete) has 12 edges and 24 vertex of which 19 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Applied a total of 1 rules in 1 ms. Remains 19 /24 variables (removed 5) and now considering 25/30 (removed 5) transitions.
// Phase 1: matrix 25 rows 19 cols
[2024-06-01 09:39:17] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:39:17] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 09:39:17] [INFO ] Invariant cache hit.
[2024-06-01 09:39:17] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/70331 places, 25/70909 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 19/70331 places, 25/70909 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1)), p1:(AND (GEQ s14 1) (GEQ s18 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 30 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-13 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 70331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70331/70331 places, 70909/70909 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 70280 transition count 70802
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 70280 transition count 70802
Applied a total of 102 rules in 38044 ms. Remains 70280 /70331 variables (removed 51) and now considering 70802/70909 (removed 107) transitions.
// Phase 1: matrix 70802 rows 70280 cols
[2024-06-01 09:40:00] [INFO ] Invariants computation overflowed in 4628 ms
[2024-06-01 09:40:08] [INFO ] Implicit Places using invariants in 12871 ms returned []
Implicit Place search using SMT only with invariants took 12873 ms to find 0 implicit places.
// Phase 1: matrix 70802 rows 70280 cols
[2024-06-01 09:40:13] [INFO ] Invariants computation overflowed in 4347 ms
[2024-06-01 09:40:22] [INFO ] Dead Transitions using invariants and state equation in 13436 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70280/70331 places, 70802/70909 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64364 ms. Remains : 70280/70331 places, 70802/70909 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s15941 1) (LT s15974 1)), p0:(AND (GEQ s13460 1) (GEQ s13497 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 timeout after 18810 steps with 3 reset in 10003 ms.
Product exploration timeout after 17260 steps with 3 reset in 10008 ms.
Computed a total of 70280 stabilizing places and 70802 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70280 transition count 70802
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5728 ms. (steps per millisecond=1 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 932 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 70802 rows 70280 cols
[2024-06-01 09:41:14] [INFO ] Invariants computation overflowed in 3769 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-01 09:41:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 09:41:39] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 70280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70280/70280 places, 70802/70802 transitions.
Graph (complete) has 65613 edges and 70280 vertex of which 17 are kept as prefixes of interest. Removing 70263 places using SCC suffix rule.27 ms
Discarding 70263 places :
Also discarding 70776 output transitions
Drop transitions removed 70776 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 17 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 15 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 12 transition count 10
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 12 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 11 transition count 9
Applied a total of 23 rules in 104 ms. Remains 11 /70280 variables (removed 70269) and now considering 9/70802 (removed 70793) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 11/70280 places, 9/70802 transitions.
Finished random walk after 62 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 423 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 70280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70280/70280 places, 70802/70802 transitions.
Graph (complete) has 65613 edges and 70280 vertex of which 56 are kept as prefixes of interest. Removing 70224 places using SCC suffix rule.42 ms
Discarding 70224 places :
Also discarding 70654 output transitions
Drop transitions removed 70654 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 55 transition count 104
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 72 place count 27 transition count 41
Iterating global reduction 1 with 28 rules applied. Total rules applied 100 place count 27 transition count 41
Applied a total of 100 rules in 112 ms. Remains 27 /70280 variables (removed 70253) and now considering 41/70802 (removed 70761) transitions.
// Phase 1: matrix 41 rows 27 cols
[2024-06-01 09:41:40] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:41:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 09:41:40] [INFO ] Invariant cache hit.
[2024-06-01 09:41:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-01 09:41:41] [INFO ] Redundant transitions in 20 ms returned [6, 17, 23, 26, 37, 40]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
// Phase 1: matrix 35 rows 27 cols
[2024-06-01 09:41:41] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:41:41] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/70280 places, 35/70802 transitions.
Graph (complete) has 15 edges and 27 vertex of which 21 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
Applied a total of 1 rules in 2 ms. Remains 21 /27 variables (removed 6) and now considering 29/35 (removed 6) transitions.
// Phase 1: matrix 29 rows 21 cols
[2024-06-01 09:41:41] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 09:41:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 09:41:41] [INFO ] Invariant cache hit.
[2024-06-01 09:41:41] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/70280 places, 29/70802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 358 ms. Remains : 21/70280 places, 29/70802 transitions.
Computed a total of 21 stabilizing places and 29 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 29
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) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLFireability-15 finished in 143483 ms.
All properties solved by simple procedures.
Total runtime 822919 ms.

BK_STOP 1717234902663

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ViralEpidemic-PT-S16D2C4A03, 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 r461-smll-171701123200258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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