Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 11K Feb 25 22:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 22:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 20:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 23:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 23:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 22:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 22:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 19M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679246207096

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S02D1C1A12
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:16:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:16:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:16:49] [INFO ] Load time of PNML (sax parser for PT used): 849 ms
[2023-03-19 17:16:49] [INFO ] Transformed 32765 places.
[2023-03-19 17:16:49] [INFO ] Transformed 40955 transitions.
[2023-03-19 17:16:49] [INFO ] Parsed PT model containing 32765 places and 40955 transitions and 90101 arcs in 1073 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4085 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:17:03] [INFO ] Invariants computation overflowed in 9787 ms
[2023-03-19 17:17:06] [INFO ] Implicit Places using invariants in 12356 ms returned []
Implicit Place search using SMT only with invariants took 12382 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:17:15] [INFO ] Invariants computation overflowed in 9561 ms
[2023-03-19 17:17:18] [INFO ] Dead Transitions using invariants and state equation in 12089 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28564 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Support contains 54 out of 32765 places after structural reductions.
[2023-03-19 17:17:20] [INFO ] Flatten gal took : 1330 ms
[2023-03-19 17:17:21] [INFO ] Flatten gal took : 980 ms
[2023-03-19 17:17:23] [INFO ] Input system was already deterministic with 40955 transitions.
Incomplete random walk after 10000 steps, including 929 resets, run finished after 2756 ms. (steps per millisecond=3 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 203 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 204 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 200 ms. (steps per millisecond=5 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 208 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 209 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 203 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 207 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 201 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 199 ms. (steps per millisecond=5 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 260 ms. (steps per millisecond=3 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 206 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 205 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 200 ms. (steps per millisecond=5 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 205 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 212 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 203 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 204 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 201 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 205 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 209 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 211 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 205 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 201 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 206 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 202 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 209 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 203 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 200 ms. (steps per millisecond=5 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 200 ms. (steps per millisecond=5 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 271 ms. (steps per millisecond=3 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 203 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 209 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 204 ms. (steps per millisecond=4 ) properties (out of 33) seen :0
Interrupted probabilistic random walk after 50455 steps, run timeout after 27009 ms. (steps per millisecond=1 ) properties seen :{2=1, 15=1, 16=1, 26=1, 27=1}
Probabilistic random walk after 50455 steps, saw 48237 distinct states, run finished after 27012 ms. (steps per millisecond=1 ) properties seen :5
Running SMT prover for 28 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:18:09] [INFO ] Invariants computation overflowed in 9068 ms
[2023-03-19 17:18:24] [INFO ] After 14987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
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:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-19 17:18:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 17:18:49] [INFO ] After 25071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:28
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 44 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 423 are kept as prefixes of interest. Removing 32342 places using SCC suffix rule.33 ms
Discarding 32342 places :
Also discarding 39871 output transitions
Drop transitions removed 39871 transitions
Drop transitions removed 694 transitions
Reduce isomorphic transitions removed 694 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 884 rules applied. Total rules applied 885 place count 423 transition count 200
Reduce places removed 190 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 191 rules applied. Total rules applied 1076 place count 233 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1077 place count 232 transition count 199
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1077 place count 232 transition count 184
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1107 place count 217 transition count 184
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1151 place count 173 transition count 140
Iterating global reduction 3 with 44 rules applied. Total rules applied 1195 place count 173 transition count 140
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 1329 place count 106 transition count 73
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1330 place count 105 transition count 72
Ensure Unique test removed 26 places
Iterating post reduction 3 with 26 rules applied. Total rules applied 1356 place count 79 transition count 72
Applied a total of 1356 rules in 172 ms. Remains 79 /32765 variables (removed 32686) and now considering 72/40955 (removed 40883) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 79/32765 places, 72/40955 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 28) seen :17
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 72 rows 79 cols
[2023-03-19 17:18:49] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-19 17:18:49] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-19 17:18:49] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 17:18:49] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-19 17:18:50] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p0&&G(F(p1))))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3796 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:19:02] [INFO ] Invariants computation overflowed in 8721 ms
[2023-03-19 17:19:05] [INFO ] Implicit Places using invariants in 11010 ms returned []
Implicit Place search using SMT only with invariants took 11011 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:19:14] [INFO ] Invariants computation overflowed in 9167 ms
[2023-03-19 17:19:16] [INFO ] Dead Transitions using invariants and state equation in 11527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26339 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT 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:(LEQ s21477 s20456), p1:(LEQ s14821 s643)], 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]]
Product exploration timeout after 25570 steps with 8834 reset in 10002 ms.
Product exploration timeout after 21530 steps with 7362 reset in 10002 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 338 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 923 resets, run finished after 2255 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 1904 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24346 steps, run timeout after 12009 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 24346 steps, saw 23418 distinct states, run finished after 12010 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:21:58] [INFO ] Invariants computation overflowed in 9778 ms
[2023-03-19 17:22:03] [INFO ] After 4749ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:22:28] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 31 are kept as prefixes of interest. Removing 32734 places using SCC suffix rule.10 ms
Discarding 32734 places :
Also discarding 40874 output transitions
Drop transitions removed 40874 transitions
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 31 transition count 7
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 97 place count 9 transition count 7
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 7 transition count 5
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 7 transition count 5
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 2 transition count 2
Applied a total of 108 rules in 68 ms. Remains 2 /32765 variables (removed 32763) and now considering 2/40955 (removed 40953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 2/32765 places, 2/40955 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 315 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 32765 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3682 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:22:41] [INFO ] Invariants computation overflowed in 9023 ms
[2023-03-19 17:22:44] [INFO ] Implicit Places using invariants in 11418 ms returned []
Implicit Place search using SMT only with invariants took 11419 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:22:53] [INFO ] Invariants computation overflowed in 9061 ms
[2023-03-19 17:22:55] [INFO ] Dead Transitions using invariants and state equation in 11367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26472 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 945 resets, run finished after 2149 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 1854 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24270 steps, run timeout after 12002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 24270 steps, saw 23346 distinct states, run finished after 12002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:25:12] [INFO ] Invariants computation overflowed in 9386 ms
[2023-03-19 17:25:17] [INFO ] After 4709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:25:42] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 31 are kept as prefixes of interest. Removing 32734 places using SCC suffix rule.10 ms
Discarding 32734 places :
Also discarding 40874 output transitions
Drop transitions removed 40874 transitions
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 31 transition count 7
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 97 place count 9 transition count 7
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 7 transition count 5
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 7 transition count 5
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 4 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 2 transition count 2
Applied a total of 108 rules in 53 ms. Remains 2 /32765 variables (removed 32763) and now considering 2/40955 (removed 40953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 2/32765 places, 2/40955 transitions.
Finished random walk after 4 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 45110 steps with 4293 reset in 10001 ms.
Product exploration timeout after 34610 steps with 3285 reset in 10003 ms.
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3042 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:26:15] [INFO ] Invariants computation overflowed in 9035 ms
[2023-03-19 17:26:17] [INFO ] Implicit Places using invariants in 11550 ms returned []
Implicit Place search using SMT only with invariants took 11551 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:26:26] [INFO ] Invariants computation overflowed in 8680 ms
[2023-03-19 17:26:28] [INFO ] Dead Transitions using invariants and state equation in 10993 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25589 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 finished in 459586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 47 are kept as prefixes of interest. Removing 32718 places using SCC suffix rule.43 ms
Discarding 32718 places :
Also discarding 40884 output transitions
Drop transitions removed 40884 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 33 transition count 44
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 33 transition count 44
Applied a total of 27 rules in 83 ms. Remains 33 /32765 variables (removed 32732) and now considering 44/40955 (removed 40911) transitions.
// Phase 1: matrix 44 rows 33 cols
[2023-03-19 17:26:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 17:26:30] [INFO ] Invariant cache hit.
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [0, 5, 11, 15, 19, 21, 25]
Discarding 7 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT with State Equation took 65 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/32765 places, 38/40955 transitions.
Graph (complete) has 18 edges and 26 vertex of which 19 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 14 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 14 transition count 25
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 14 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 15 place count 14 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 13 transition count 21
Applied a total of 17 rules in 4 ms. Remains 13 /26 variables (removed 13) and now considering 21/38 (removed 17) transitions.
// Phase 1: matrix 21 rows 13 cols
[2023-03-19 17:26:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-19 17:26:30] [INFO ] Invariant cache hit.
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/32765 places, 21/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 13/32765 places, 21/40955 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 82 are kept as prefixes of interest. Removing 32683 places using SCC suffix rule.23 ms
Discarding 32683 places :
Also discarding 40831 output transitions
Drop transitions removed 40831 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 59 transition count 78
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 59 transition count 78
Graph (complete) has 33 edges and 59 vertex of which 56 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
Iterating post reduction 0 with 1 rules applied. Total rules applied 46 place count 56 transition count 75
Applied a total of 46 rules in 59 ms. Remains 56 /32765 variables (removed 32709) and now considering 75/40955 (removed 40880) transitions.
// Phase 1: matrix 75 rows 56 cols
[2023-03-19 17:26:30] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 17:26:30] [INFO ] Invariant cache hit.
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [0, 4, 6, 10, 14, 16, 29, 31, 35, 49]
Discarding 10 places :
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Implicit Place search using SMT with State Equation took 88 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/32765 places, 66/40955 transitions.
Graph (complete) has 30 edges and 46 vertex of which 37 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 28 transition count 48
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 28 transition count 45
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 28 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 26 place count 28 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 27 transition count 40
Applied a total of 28 rules in 2 ms. Remains 27 /46 variables (removed 19) and now considering 40/66 (removed 26) transitions.
// Phase 1: matrix 40 rows 27 cols
[2023-03-19 17:26:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-19 17:26:30] [INFO ] Invariant cache hit.
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/32765 places, 40/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 27/32765 places, 40/40955 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 339 steps with 13 reset in 3 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 128 are kept as prefixes of interest. Removing 32637 places using SCC suffix rule.16 ms
Discarding 32637 places :
Also discarding 40759 output transitions
Drop transitions removed 40759 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 92 transition count 122
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 92 transition count 122
Graph (complete) has 51 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 72 place count 91 transition count 121
Applied a total of 72 rules in 48 ms. Remains 91 /32765 variables (removed 32674) and now considering 121/40955 (removed 40834) transitions.
// Phase 1: matrix 121 rows 91 cols
[2023-03-19 17:26:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 17:26:30] [INFO ] Invariant cache hit.
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [0, 2, 4, 10, 16, 18, 20, 24, 34, 36, 40, 42, 44, 63, 68, 85, 87]
Discarding 17 places :
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Implicit Place search using SMT with State Equation took 100 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/32765 places, 107/40955 transitions.
Graph (complete) has 50 edges and 74 vertex of which 60 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 44 transition count 76
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 38 place count 44 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 42 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 42 transition count 69
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 42 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 49 place count 42 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 41 transition count 63
Applied a total of 51 rules in 7 ms. Remains 41 /74 variables (removed 33) and now considering 63/107 (removed 44) transitions.
// Phase 1: matrix 63 rows 41 cols
[2023-03-19 17:26:30] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 17:26:30] [INFO ] Invariant cache hit.
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/32765 places, 63/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 212 ms. Remains : 41/32765 places, 63/40955 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 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:(LEQ s33 s22), p0:(GT s16 s11)], 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 35 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 47 are kept as prefixes of interest. Removing 32718 places using SCC suffix rule.19 ms
Discarding 32718 places :
Also discarding 40884 output transitions
Drop transitions removed 40884 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 33 transition count 44
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 33 transition count 44
Graph (complete) has 17 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 32 transition count 43
Applied a total of 28 rules in 50 ms. Remains 32 /32765 variables (removed 32733) and now considering 43/40955 (removed 40912) transitions.
// Phase 1: matrix 43 rows 32 cols
[2023-03-19 17:26:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 17:26:30] [INFO ] Invariant cache hit.
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [0, 4, 8, 12, 18]
Discarding 5 places :
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 64 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/32765 places, 38/40955 transitions.
Graph (complete) has 16 edges and 27 vertex of which 22 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
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 18 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 18 transition count 27
Applied a total of 11 rules in 2 ms. Remains 18 /27 variables (removed 9) and now considering 27/38 (removed 11) transitions.
// Phase 1: matrix 27 rows 18 cols
[2023-03-19 17:26:30] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-19 17:26:30] [INFO ] Invariant cache hit.
[2023-03-19 17:26:30] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/32765 places, 27/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 18/32765 places, 27/40955 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3148 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:26:43] [INFO ] Invariants computation overflowed in 8994 ms
[2023-03-19 17:26:45] [INFO ] Implicit Places using invariants in 11559 ms returned []
Implicit Place search using SMT only with invariants took 11559 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:26:54] [INFO ] Invariants computation overflowed in 8936 ms
[2023-03-19 17:26:57] [INFO ] Dead Transitions using invariants and state equation in 11314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26023 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s8998 s14805), p0:(LEQ s29334 s6974)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 9 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 finished in 26224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3530 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:27:09] [INFO ] Invariants computation overflowed in 8957 ms
[2023-03-19 17:27:12] [INFO ] Implicit Places using invariants in 11454 ms returned []
Implicit Place search using SMT only with invariants took 11459 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:27:21] [INFO ] Invariants computation overflowed in 9054 ms
[2023-03-19 17:27:23] [INFO ] Dead Transitions using invariants and state equation in 11389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26382 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s31777 s16980)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 47850 steps with 4457 reset in 10002 ms.
Product exploration timeout after 34930 steps with 3259 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 920 resets, run finished after 2144 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 1877 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17074 steps, run visited all 1 properties in 8081 ms. (steps per millisecond=2 )
Probabilistic random walk after 17074 steps, saw 16468 distinct states, run finished after 8094 ms. (steps per millisecond=2 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3767 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:30:04] [INFO ] Invariants computation overflowed in 9784 ms
[2023-03-19 17:30:07] [INFO ] Implicit Places using invariants in 12357 ms returned []
Implicit Place search using SMT only with invariants took 12357 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:30:16] [INFO ] Invariants computation overflowed in 9666 ms
[2023-03-19 17:30:19] [INFO ] Dead Transitions using invariants and state equation in 12063 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28191 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 929 resets, run finished after 2315 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 2035 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17074 steps, run visited all 1 properties in 8381 ms. (steps per millisecond=2 )
Probabilistic random walk after 17074 steps, saw 16468 distinct states, run finished after 8395 ms. (steps per millisecond=2 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 47690 steps with 4574 reset in 10002 ms.
Product exploration timeout after 34790 steps with 3321 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 84 are kept as prefixes of interest. Removing 32681 places using SCC suffix rule.16 ms
Discarding 32681 places :
Also discarding 40827 output transitions
Drop transitions removed 40827 transitions
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 61 transition count 82
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 61 transition count 82
Applied a total of 47 rules in 54 ms. Remains 61 /32765 variables (removed 32704) and now considering 82/40955 (removed 40873) transitions.
[2023-03-19 17:32:58] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 82 rows 61 cols
[2023-03-19 17:32:58] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:32:58] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/32765 places, 82/40955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 61/32765 places, 82/40955 transitions.
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3315 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:33:10] [INFO ] Invariants computation overflowed in 9231 ms
[2023-03-19 17:33:13] [INFO ] Implicit Places using invariants in 11837 ms returned []
Implicit Place search using SMT only with invariants took 11838 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:33:23] [INFO ] Invariants computation overflowed in 10383 ms
[2023-03-19 17:33:26] [INFO ] Dead Transitions using invariants and state equation in 12954 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28109 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 finished in 390092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1||(p2 U p3)||G(p4)))))'
Support contains 10 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3292 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:33:40] [INFO ] Invariants computation overflowed in 9738 ms
[2023-03-19 17:33:42] [INFO ] Implicit Places using invariants in 12095 ms returned []
Implicit Place search using SMT only with invariants took 12099 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:33:52] [INFO ] Invariants computation overflowed in 9412 ms
[2023-03-19 17:33:54] [INFO ] Dead Transitions using invariants and state equation in 11783 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27178 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4))), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1) (AND (NOT p0) p4) (AND (NOT p0) p3)), (NOT p3), (OR (AND p0 p3 (NOT p4)) (AND p0 p1 (NOT p4)) (AND p0 p2 (NOT p4))), (OR (AND p1 p2 (NOT p3) (NOT p4)) (AND p0 p1 (NOT p3) (NOT p4)))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p3 p2 p4), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p3 p2 p4), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p4)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p4), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 p4), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p3 (NOT p0)) (AND p2 (NOT p0)) (AND p4 (NOT p0))), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p4) p0) (AND p3 (NOT p4) p0) (AND p2 (NOT p4) p0)), acceptance={} source=4 dest: 1}, { cond=(OR (AND p1 p4) (AND p3 p4) (AND p2 p4)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3) (NOT p2) (NOT p4) p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3) p2 (NOT p4)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2) p4), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2 p4), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s24445 s7472), p3:(LEQ s8294 s19710), p2:(LEQ s5854 s14912), p4:(LEQ s31112 s24154), p0:(AND (GT s24445 s7472) (GT s8688 s21421))], 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 1 steps with 0 reset in 7 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10 finished in 27581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3310 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:34:07] [INFO ] Invariants computation overflowed in 9151 ms
[2023-03-19 17:34:09] [INFO ] Implicit Places using invariants in 11470 ms returned []
Implicit Place search using SMT only with invariants took 11471 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:34:18] [INFO ] Invariants computation overflowed in 8969 ms
[2023-03-19 17:34:21] [INFO ] Dead Transitions using invariants and state equation in 11322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26106 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ s19973 s2904) (GT s8963 s4463))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 46870 steps with 4380 reset in 10003 ms.
Product exploration timeout after 33950 steps with 3141 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 909 resets, run finished after 2269 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 1944 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23370 steps, run timeout after 12012 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 23370 steps, saw 22490 distinct states, run finished after 12012 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:37:01] [INFO ] Invariants computation overflowed in 10038 ms
[2023-03-19 17:37:06] [INFO ] After 4920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:37:31] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 54 are kept as prefixes of interest. Removing 32711 places using SCC suffix rule.9 ms
Discarding 32711 places :
Also discarding 40813 output transitions
Drop transitions removed 40813 transitions
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 54 transition count 16
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 161 place count 20 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 20 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 19 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 15 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 15 transition count 11
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 181 place count 10 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 9 transition count 5
Ensure Unique test removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 185 place count 6 transition count 5
Applied a total of 185 rules in 47 ms. Remains 6 /32765 variables (removed 32759) and now considering 5/40955 (removed 40950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 6/32765 places, 5/40955 transitions.
Finished random walk after 19 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4045 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:37:45] [INFO ] Invariants computation overflowed in 9535 ms
[2023-03-19 17:37:48] [INFO ] Implicit Places using invariants in 11951 ms returned []
Implicit Place search using SMT only with invariants took 11951 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:37:57] [INFO ] Invariants computation overflowed in 9448 ms
[2023-03-19 17:37:59] [INFO ] Dead Transitions using invariants and state equation in 11787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27788 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 929 resets, run finished after 2208 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 2028 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23754 steps, run timeout after 12007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 23754 steps, saw 22854 distinct states, run finished after 12007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:40:23] [INFO ] Invariants computation overflowed in 10939 ms
[2023-03-19 17:40:27] [INFO ] After 4617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:40:52] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 54 are kept as prefixes of interest. Removing 32711 places using SCC suffix rule.9 ms
Discarding 32711 places :
Also discarding 40813 output transitions
Drop transitions removed 40813 transitions
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 54 transition count 16
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 161 place count 20 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 20 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 19 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 15 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 15 transition count 11
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 181 place count 10 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 9 transition count 5
Ensure Unique test removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 185 place count 6 transition count 5
Applied a total of 185 rules in 45 ms. Remains 6 /32765 variables (removed 32759) and now considering 5/40955 (removed 40950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 6/32765 places, 5/40955 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 48280 steps with 4522 reset in 10002 ms.
Product exploration timeout after 35450 steps with 3359 reset in 10001 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 149 are kept as prefixes of interest. Removing 32616 places using SCC suffix rule.19 ms
Discarding 32616 places :
Also discarding 40728 output transitions
Drop transitions removed 40728 transitions
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 107 transition count 142
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 107 transition count 142
Graph (complete) has 61 edges and 107 vertex of which 105 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 86 place count 105 transition count 140
Applied a total of 86 rules in 57 ms. Remains 105 /32765 variables (removed 32660) and now considering 140/40955 (removed 40815) transitions.
[2023-03-19 17:41:13] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 140 rows 105 cols
[2023-03-19 17:41:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:41:13] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/32765 places, 140/40955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 105/32765 places, 140/40955 transitions.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3952 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:41:27] [INFO ] Invariants computation overflowed in 9793 ms
[2023-03-19 17:41:29] [INFO ] Implicit Places using invariants in 12111 ms returned []
Implicit Place search using SMT only with invariants took 12112 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:41:39] [INFO ] Invariants computation overflowed in 9563 ms
[2023-03-19 17:41:41] [INFO ] Dead Transitions using invariants and state equation in 11943 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28009 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 finished in 467664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 3548 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:41:55] [INFO ] Invariants computation overflowed in 9338 ms
[2023-03-19 17:41:57] [INFO ] Implicit Places using invariants in 11766 ms returned []
Implicit Place search using SMT only with invariants took 11766 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:42:07] [INFO ] Invariants computation overflowed in 9889 ms
[2023-03-19 17:42:10] [INFO ] Dead Transitions using invariants and state equation in 12179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27496 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(LEQ 1 s31656)], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 6 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-12 finished in 27856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5539 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:42:25] [INFO ] Invariants computation overflowed in 9516 ms
[2023-03-19 17:42:27] [INFO ] Implicit Places using invariants in 11904 ms returned []
Implicit Place search using SMT only with invariants took 11904 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:42:38] [INFO ] Invariants computation overflowed in 10111 ms
[2023-03-19 17:42:40] [INFO ] Dead Transitions using invariants and state equation in 12411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29857 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s19373)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 46740 steps with 4272 reset in 10001 ms.
Product exploration timeout after 34970 steps with 3203 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 997 resets, run finished after 2175 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 1898 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23411 steps, run timeout after 12006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 23411 steps, saw 22529 distinct states, run finished after 12006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:45:38] [INFO ] Invariants computation overflowed in 12117 ms
[2023-03-19 17:46:03] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 15 are kept as prefixes of interest. Removing 32750 places using SCC suffix rule.8 ms
Discarding 32750 places :
Also discarding 40916 output transitions
Drop transitions removed 40916 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 15 transition count 5
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 45 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 3 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 3
Applied a total of 49 rules in 38 ms. Remains 3 /32765 variables (removed 32762) and now considering 3/40955 (removed 40952) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 3/32765 places, 3/40955 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 6671 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:46:20] [INFO ] Invariants computation overflowed in 10048 ms
[2023-03-19 17:46:23] [INFO ] Implicit Places using invariants in 12618 ms returned []
Implicit Place search using SMT only with invariants took 12620 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:46:33] [INFO ] Invariants computation overflowed in 10319 ms
[2023-03-19 17:46:35] [INFO ] Dead Transitions using invariants and state equation in 12662 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31956 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 981 resets, run finished after 2175 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 1982 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23346 steps, run timeout after 12009 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 23346 steps, saw 22467 distinct states, run finished after 12009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:48:59] [INFO ] Invariants computation overflowed in 11717 ms
[2023-03-19 17:49:24] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 15 are kept as prefixes of interest. Removing 32750 places using SCC suffix rule.8 ms
Discarding 32750 places :
Also discarding 40916 output transitions
Drop transitions removed 40916 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 15 transition count 5
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 45 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 3 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 3
Applied a total of 49 rules in 38 ms. Remains 3 /32765 variables (removed 32762) and now considering 3/40955 (removed 40952) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 3/32765 places, 3/40955 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 47520 steps with 4514 reset in 10001 ms.
Product exploration timeout after 34910 steps with 3280 reset in 10002 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 45 are kept as prefixes of interest. Removing 32720 places using SCC suffix rule.16 ms
Discarding 32720 places :
Also discarding 40886 output transitions
Drop transitions removed 40886 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 33 transition count 45
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 33 transition count 45
Applied a total of 25 rules in 45 ms. Remains 33 /32765 variables (removed 32732) and now considering 45/40955 (removed 40910) transitions.
[2023-03-19 17:49:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 33 cols
[2023-03-19 17:49:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:49:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/32765 places, 45/40955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 33/32765 places, 45/40955 transitions.
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5919 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:50:00] [INFO ] Invariants computation overflowed in 9507 ms
[2023-03-19 17:50:02] [INFO ] Implicit Places using invariants in 11906 ms returned []
Implicit Place search using SMT only with invariants took 11906 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:50:12] [INFO ] Invariants computation overflowed in 9635 ms
[2023-03-19 17:50:15] [INFO ] Dead Transitions using invariants and state equation in 12087 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29913 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 finished in 485507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p0)))))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5842 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:50:31] [INFO ] Invariants computation overflowed in 9443 ms
[2023-03-19 17:50:33] [INFO ] Implicit Places using invariants in 11751 ms returned []
Implicit Place search using SMT only with invariants took 11751 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2023-03-19 17:50:43] [INFO ] Invariants computation overflowed in 9773 ms
[2023-03-19 17:50:45] [INFO ] Dead Transitions using invariants and state equation in 12084 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29678 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s4835 s15624)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 8 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14 finished in 29840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 91 are kept as prefixes of interest. Removing 32674 places using SCC suffix rule.16 ms
Discarding 32674 places :
Also discarding 40818 output transitions
Drop transitions removed 40818 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 65 transition count 86
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 65 transition count 86
Applied a total of 51 rules in 47 ms. Remains 65 /32765 variables (removed 32700) and now considering 86/40955 (removed 40869) transitions.
// Phase 1: matrix 86 rows 65 cols
[2023-03-19 17:50:45] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:50:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 17:50:45] [INFO ] Invariant cache hit.
[2023-03-19 17:50:45] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [0, 2, 4, 8, 12, 14, 18, 20, 24, 41, 43, 47, 61, 63]
Discarding 14 places :
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT with State Equation took 86 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/32765 places, 74/40955 transitions.
Graph (complete) has 37 edges and 51 vertex of which 38 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 26 transition count 47
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 30 place count 26 transition count 42
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 26 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 33 place count 26 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 24 transition count 37
Applied a total of 37 rules in 2 ms. Remains 24 /51 variables (removed 27) and now considering 37/74 (removed 37) transitions.
// Phase 1: matrix 37 rows 24 cols
[2023-03-19 17:50:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:50:45] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-19 17:50:45] [INFO ] Invariant cache hit.
[2023-03-19 17:50:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/32765 places, 37/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 24/32765 places, 37/40955 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s12 s21)], 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 22 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-15 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p0&&G(F(p1))))))'
Found a Lengthening insensitive property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 143 are kept as prefixes of interest. Removing 32622 places using SCC suffix rule.24 ms
Discarding 32622 places :
Also discarding 40738 output transitions
Drop transitions removed 40738 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 103 transition count 137
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 103 transition count 137
Graph (complete) has 59 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 80 place count 102 transition count 136
Applied a total of 80 rules in 57 ms. Remains 102 /32765 variables (removed 32663) and now considering 136/40955 (removed 40819) transitions.
// Phase 1: matrix 136 rows 102 cols
[2023-03-19 17:50:46] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:50:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 17:50:46] [INFO ] Invariant cache hit.
[2023-03-19 17:50:46] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [0, 2, 4, 6, 8, 10, 12, 18, 31, 33, 35, 41, 43, 45, 54, 58, 62, 66, 68, 72, 82]
Discarding 21 places :
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Implicit Place search using SMT with State Equation took 123 ms to find 21 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 81/32765 places, 117/40955 transitions.
Graph (complete) has 58 edges and 81 vertex of which 63 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 45 transition count 81
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 45 place count 45 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 43 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 43 transition count 71
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 43 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 43 transition count 70
Applied a total of 53 rules in 4 ms. Remains 43 /81 variables (removed 38) and now considering 70/117 (removed 47) transitions.
// Phase 1: matrix 70 rows 43 cols
[2023-03-19 17:50:46] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:50:46] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 17:50:46] [INFO ] Invariant cache hit.
[2023-03-19 17:50:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 43/32765 places, 70/40955 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 235 ms. Remains : 43/32765 places, 70/40955 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT 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:(LEQ s39 s27), p1:(LEQ s15 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33316 reset in 192 ms.
Product exploration explored 100000 steps with 33249 reset in 201 ms.
Computed a total of 43 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 70
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), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 4920 steps, including 95 resets, run visited all 1 properties in 13 ms. (steps per millisecond=378 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 70/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-19 17:50:47] [INFO ] Invariant cache hit.
[2023-03-19 17:50:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 17:50:47] [INFO ] Invariant cache hit.
[2023-03-19 17:50:47] [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.
[2023-03-19 17:50:47] [INFO ] Invariant cache hit.
[2023-03-19 17:50:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 43/43 places, 70/70 transitions.
Computed a total of 43 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 70
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1920 steps, including 37 resets, run visited all 1 properties in 8 ms. (steps per millisecond=240 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 8419 steps with 232 reset in 20 ms.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 finished in 2721 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 84 are kept as prefixes of interest. Removing 32681 places using SCC suffix rule.21 ms
Discarding 32681 places :
Also discarding 40827 output transitions
Drop transitions removed 40827 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 60 transition count 81
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 60 transition count 81
Applied a total of 47 rules in 55 ms. Remains 60 /32765 variables (removed 32705) and now considering 81/40955 (removed 40874) transitions.
// Phase 1: matrix 81 rows 60 cols
[2023-03-19 17:50:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-19 17:50:49] [INFO ] Invariant cache hit.
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [0, 2, 7, 13, 15, 17, 19, 21, 23, 33, 41, 47, 49, 53]
Discarding 14 places :
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Implicit Place search using SMT with State Equation took 76 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 46/32765 places, 68/40955 transitions.
Graph (complete) has 35 edges and 46 vertex of which 33 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 23 transition count 45
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 26 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 22 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 22 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 22 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 22 transition count 38
Applied a total of 31 rules in 4 ms. Remains 22 /46 variables (removed 24) and now considering 38/68 (removed 30) transitions.
// Phase 1: matrix 38 rows 22 cols
[2023-03-19 17:50:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-19 17:50:49] [INFO ] Invariant cache hit.
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 22/32765 places, 38/40955 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 173 ms. Remains : 22/32765 places, 38/40955 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s21 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 405 steps with 18 reset in 0 ms.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 finished in 392 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 149 are kept as prefixes of interest. Removing 32616 places using SCC suffix rule.18 ms
Discarding 32616 places :
Also discarding 40728 output transitions
Drop transitions removed 40728 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 106 transition count 141
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 106 transition count 141
Graph (complete) has 59 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 86 place count 104 transition count 139
Applied a total of 86 rules in 52 ms. Remains 104 /32765 variables (removed 32661) and now considering 139/40955 (removed 40816) transitions.
// Phase 1: matrix 139 rows 104 cols
[2023-03-19 17:50:49] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 17:50:49] [INFO ] Invariant cache hit.
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [0, 2, 4, 6, 8, 18, 34, 38, 40, 51, 59, 61, 67, 79, 87, 89, 99]
Discarding 17 places :
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Implicit Place search using SMT with State Equation took 96 ms to find 17 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 87/32765 places, 126/40955 transitions.
Graph (complete) has 57 edges and 87 vertex of which 73 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 58 transition count 97
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 38 place count 58 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 56 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 56 transition count 89
Applied a total of 43 rules in 4 ms. Remains 56 /87 variables (removed 31) and now considering 89/126 (removed 37) transitions.
// Phase 1: matrix 89 rows 56 cols
[2023-03-19 17:50:49] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 17:50:49] [INFO ] Invariant cache hit.
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 56/32765 places, 89/40955 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 206 ms. Remains : 56/32765 places, 89/40955 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ s49 s15) (GT s38 s25))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 289 steps with 5 reset in 1 ms.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 finished in 397 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 45 are kept as prefixes of interest. Removing 32720 places using SCC suffix rule.39 ms
Discarding 32720 places :
Also discarding 40886 output transitions
Drop transitions removed 40886 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 32 transition count 44
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 32 transition count 44
Applied a total of 25 rules in 66 ms. Remains 32 /32765 variables (removed 32733) and now considering 44/40955 (removed 40911) transitions.
// Phase 1: matrix 44 rows 32 cols
[2023-03-19 17:50:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 17:50:49] [INFO ] Invariant cache hit.
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [0, 2, 9, 11, 15, 17, 21, 23]
Discarding 8 places :
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Implicit Place search using SMT with State Equation took 54 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/32765 places, 35/40955 transitions.
Graph (complete) has 18 edges and 24 vertex of which 16 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 11 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 11 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 11 transition count 19
Applied a total of 15 rules in 2 ms. Remains 11 /24 variables (removed 13) and now considering 19/35 (removed 16) transitions.
// Phase 1: matrix 19 rows 11 cols
[2023-03-19 17:50:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-19 17:50:49] [INFO ] Invariant cache hit.
[2023-03-19 17:50:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/32765 places, 19/40955 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 163 ms. Remains : 11/32765 places, 19/40955 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 412 steps with 38 reset in 0 ms.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 finished in 446 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 17:50:51] [INFO ] Flatten gal took : 950 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 2042640 ms.
ITS solved all properties within timeout

BK_STOP 1679248252745

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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