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.r489-tall-167912708001355.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 ltsminxred
Input is ViralEpidemic-PT-S16D2C4A03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912708001355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 55M
-rw-r--r-- 1 mcc users 13K Feb 25 21:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 21:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 21:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:16 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 4.9K Feb 25 17:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 17:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 23:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 23:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 22:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:27 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 54M 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-S16D2C4A03-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S16D2C4A03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679373245291

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S16D2C4A03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 04:34:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 04:34:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 04:34:08] [INFO ] Load time of PNML (sax parser for PT used): 1799 ms
[2023-03-21 04:34:09] [INFO ] Transformed 78643 places.
[2023-03-21 04:34:09] [INFO ] Transformed 144177 transitions.
[2023-03-21 04:34:09] [INFO ] Parsed PT model containing 78643 places and 144177 transitions and 353889 arcs in 2400 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 78643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78643/78643 places, 144177/144177 transitions.
Discarding 4070 places :
Symmetric choice reduction at 0 with 4070 rule applications. Total rules 4070 place count 74573 transition count 79057
Iterating global reduction 0 with 4070 rules applied. Total rules applied 8140 place count 74573 transition count 79057
Discarding 3963 places :
Symmetric choice reduction at 0 with 3963 rule applications. Total rules 12103 place count 70610 transition count 71131
Iterating global reduction 0 with 3963 rules applied. Total rules applied 16066 place count 70610 transition count 71131
Applied a total of 16066 rules in 61890 ms. Remains 70610 /78643 variables (removed 8033) and now considering 71131/144177 (removed 73046) transitions.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-21 04:35:17] [INFO ] Invariants computation overflowed in 5304 ms
[2023-03-21 04:35:23] [INFO ] Implicit Places using invariants in 11443 ms returned []
Implicit Place search using SMT only with invariants took 11486 ms to find 0 implicit places.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-21 04:35:27] [INFO ] Invariants computation overflowed in 4573 ms
[2023-03-21 04:35:33] [INFO ] Dead Transitions using invariants and state equation in 10132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70610/78643 places, 71131/144177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83543 ms. Remains : 70610/78643 places, 71131/144177 transitions.
Support contains 45 out of 70610 places after structural reductions.
[2023-03-21 04:35:37] [INFO ] Flatten gal took : 3158 ms
[2023-03-21 04:35:39] [INFO ] Flatten gal took : 2126 ms
[2023-03-21 04:35:44] [INFO ] Input system was already deterministic with 71131 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5544 ms. (steps per millisecond=1 ) properties (out of 26) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-21 04:35:56] [INFO ] Invariants computation overflowed in 4708 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-21 04:36:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 04:36:22] [INFO ] After 25365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 70610 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Graph (complete) has 65941 edges and 70610 vertex of which 146 are kept as prefixes of interest. Removing 70464 places using SCC suffix rule.111 ms
Discarding 70464 places :
Also discarding 70454 output transitions
Drop transitions removed 70454 transitions
Drop transitions removed 563 transitions
Reduce isomorphic transitions removed 563 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 568 rules applied. Total rules applied 569 place count 146 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 574 place count 141 transition count 109
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 574 place count 141 transition count 86
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 620 place count 118 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 621 place count 117 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 622 place count 117 transition count 85
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 2 with 30 rules applied. Total rules applied 652 place count 102 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 653 place count 101 transition count 69
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 100 transition count 69
Applied a total of 654 rules in 358 ms. Remains 100 /70610 variables (removed 70510) and now considering 69/71131 (removed 71062) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 100/70610 places, 69/71131 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 21) seen :12
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 69 rows 100 cols
[2023-03-21 04:36:23] [INFO ] Computed 31 place invariants in 0 ms
[2023-03-21 04:36:23] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 4 ms returned sat
[2023-03-21 04:36:23] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 70610 stabilizing places and 71131 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70610 transition count 71131
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&X(p1)))||X(p2)))'
Support contains 5 out of 70610 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70609 transition count 71129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70609 transition count 71129
Applied a total of 2 rules in 22500 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:36:50] [INFO ] Invariants computation overflowed in 3657 ms
[2023-03-21 04:36:55] [INFO ] Implicit Places using invariants in 9049 ms returned []
Implicit Place search using SMT only with invariants took 9075 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:36:59] [INFO ] Invariants computation overflowed in 3660 ms
[2023-03-21 04:37:04] [INFO ] Dead Transitions using invariants and state equation in 8603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70609/70610 places, 71129/71131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40189 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 1 s26135), p2:(OR (AND (GT s51199 s46978) (GT s17686 s41500)) (GT s51199 s46978)), p1:(LEQ s51199 s46978)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 15440 steps with 7720 reset in 10007 ms.
Product exploration timeout after 14950 steps with 7475 reset in 10001 ms.
Computed a total of 70609 stabilizing places and 71129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70609 transition count 71129
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 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 11 factoid took 183 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-02 finished in 78371 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 70610 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70609 transition count 71129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70609 transition count 71129
Applied a total of 2 rules in 22379 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:38:08] [INFO ] Invariants computation overflowed in 3568 ms
[2023-03-21 04:38:13] [INFO ] Implicit Places using invariants in 8582 ms returned []
Implicit Place search using SMT only with invariants took 8586 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:38:16] [INFO ] Invariants computation overflowed in 3725 ms
[2023-03-21 04:38:22] [INFO ] Dead Transitions using invariants and state equation in 8934 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70609/70610 places, 71129/71131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39903 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLCardinality-03 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:(AND (LEQ s33709 s27595) (LEQ s7124 s13356))], 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]]
Entered a terminal (fully accepting) state of product in 989 steps with 0 reset in 277 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-03 finished in 40372 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 2 out of 70610 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70609 transition count 71129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70609 transition count 71129
Applied a total of 2 rules in 24531 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:38:51] [INFO ] Invariants computation overflowed in 3884 ms
[2023-03-21 04:38:56] [INFO ] Implicit Places using invariants in 9075 ms returned []
Implicit Place search using SMT only with invariants took 9097 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:38:59] [INFO ] Invariants computation overflowed in 3655 ms
[2023-03-21 04:39:05] [INFO ] Dead Transitions using invariants and state equation in 8890 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70609/70610 places, 71129/71131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42531 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLCardinality-06 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:(LEQ s5583 s4311)], 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 20170 steps with 2 reset in 10002 ms.
Product exploration timeout after 19860 steps with 2 reset in 10004 ms.
Computed a total of 70609 stabilizing places and 71129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70609 transition count 71129
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 217 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 72 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5061 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86240 steps, run timeout after 15007 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 86240 steps, saw 85396 distinct states, run finished after 15009 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:40:07] [INFO ] Invariants computation overflowed in 4033 ms
[2023-03-21 04:40:23] [INFO ] After 15549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 04:40:48] [INFO ] After 25048ms 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 70609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70609/70609 places, 71129/71129 transitions.
Graph (complete) has 65940 edges and 70609 vertex of which 11 are kept as prefixes of interest. Removing 70598 places using SCC suffix rule.19 ms
Discarding 70598 places :
Also discarding 71083 output transitions
Drop transitions removed 71083 transitions
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 42 place count 9 transition count 5
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 46 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 6 transition count 4
Applied a total of 47 rules in 94 ms. Remains 6 /70609 variables (removed 70603) and now considering 4/71129 (removed 71125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 6/70609 places, 4/71129 transitions.
Finished random walk after 6 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
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 237 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 64 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 70609 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70609/70609 places, 71129/71129 transitions.
Applied a total of 0 rules in 11571 ms. Remains 70609 /70609 variables (removed 0) and now considering 71129/71129 (removed 0) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:41:04] [INFO ] Invariants computation overflowed in 3744 ms
[2023-03-21 04:41:09] [INFO ] Implicit Places using invariants in 8994 ms returned []
Implicit Place search using SMT only with invariants took 9006 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:41:13] [INFO ] Invariants computation overflowed in 3766 ms
[2023-03-21 04:41:18] [INFO ] Dead Transitions using invariants and state equation in 8969 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29555 ms. Remains : 70609/70609 places, 71129/71129 transitions.
Computed a total of 70609 stabilizing places and 71129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70609 transition count 71129
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 185 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 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4767 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 88862 steps, run timeout after 15005 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 88862 steps, saw 87997 distinct states, run finished after 15007 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:42:00] [INFO ] Invariants computation overflowed in 3738 ms
[2023-03-21 04:42:16] [INFO ] After 15649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 04:42:41] [INFO ] After 25040ms 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 70609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70609/70609 places, 71129/71129 transitions.
Graph (complete) has 65940 edges and 70609 vertex of which 11 are kept as prefixes of interest. Removing 70598 places using SCC suffix rule.19 ms
Discarding 70598 places :
Also discarding 71083 output transitions
Drop transitions removed 71083 transitions
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 42 place count 9 transition count 5
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 46 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 6 transition count 4
Applied a total of 47 rules in 110 ms. Remains 6 /70609 variables (removed 70603) and now considering 4/71129 (removed 71125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 6/70609 places, 4/71129 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
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 271 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 91 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 76 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 5936 steps with 0 reset in 4388 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-06 finished in 263670 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) U X(X(G(p1)))))'
Support contains 4 out of 70610 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70609 transition count 71129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70609 transition count 71129
Applied a total of 2 rules in 23493 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:43:13] [INFO ] Invariants computation overflowed in 3780 ms
[2023-03-21 04:43:18] [INFO ] Implicit Places using invariants in 8907 ms returned []
Implicit Place search using SMT only with invariants took 8913 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:43:22] [INFO ] Invariants computation overflowed in 3857 ms
[2023-03-21 04:43:27] [INFO ] Dead Transitions using invariants and state equation in 9095 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70609/70610 places, 71129/71131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41517 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(LEQ s23633 s45904), p1:(LEQ s14989 s1386)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 24600 steps with 3392 reset in 10004 ms.
Product exploration timeout after 20830 steps with 3009 reset in 10004 ms.
Computed a total of 70609 stabilizing places and 71129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70609 transition count 71129
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 (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 525 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), true, (NOT p1), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5340 ms. (steps per millisecond=1 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:44:16] [INFO ] Invariants computation overflowed in 3908 ms
[2023-03-21 04:44:31] [INFO ] After 15713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 04:44:57] [INFO ] After 25035ms 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 70609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70609/70609 places, 71129/71129 transitions.
Graph (complete) has 65940 edges and 70609 vertex of which 20 are kept as prefixes of interest. Removing 70589 places using SCC suffix rule.20 ms
Discarding 70589 places :
Also discarding 71040 output transitions
Drop transitions removed 71040 transitions
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 20 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 79 place count 17 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 79 place count 17 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 13 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 12 transition count 9
Applied a total of 88 rules in 86 ms. Remains 12 /70609 variables (removed 70597) and now considering 9/71129 (removed 71120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 12/70609 places, 9/71129 transitions.
Finished random walk after 20 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 12 factoid took 232 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-07 finished in 131102 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((p0 U (p1||G(p0)))))'
Support contains 6 out of 70610 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Applied a total of 0 rules in 15085 ms. Remains 70610 /70610 variables (removed 0) and now considering 71131/71131 (removed 0) transitions.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-21 04:45:16] [INFO ] Invariants computation overflowed in 4384 ms
[2023-03-21 04:45:22] [INFO ] Implicit Places using invariants in 10318 ms returned []
Implicit Place search using SMT only with invariants took 10336 ms to find 0 implicit places.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-21 04:45:27] [INFO ] Invariants computation overflowed in 4178 ms
[2023-03-21 04:45:32] [INFO ] Dead Transitions using invariants and state equation in 9814 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35241 ms. Remains : 70610/70610 places, 71131/71131 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GT s3310 s60158) (OR (LEQ s22909 s17758) (LEQ s28843 s7986))), p0:(GT s3310 s60158)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-08 finished in 35473 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 70610 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Graph (complete) has 65941 edges and 70610 vertex of which 88 are kept as prefixes of interest. Removing 70522 places using SCC suffix rule.79 ms
Discarding 70522 places :
Also discarding 70969 output transitions
Drop transitions removed 70969 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 87 transition count 150
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 79 place count 20 transition count 30
Iterating global reduction 1 with 67 rules applied. Total rules applied 146 place count 20 transition count 30
Applied a total of 146 rules in 147 ms. Remains 20 /70610 variables (removed 70590) and now considering 30/71131 (removed 71101) transitions.
// Phase 1: matrix 30 rows 20 cols
[2023-03-21 04:45:33] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 04:45:33] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 04:45:33] [INFO ] Invariant cache hit.
[2023-03-21 04:45:33] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-21 04:45:33] [INFO ] Redundant transitions in 15 ms returned [2, 6, 13, 23, 28]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
// Phase 1: matrix 25 rows 20 cols
[2023-03-21 04:45:33] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 04:45:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/70610 places, 25/71131 transitions.
Graph (complete) has 11 edges and 20 vertex of which 15 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Applied a total of 1 rules in 6 ms. Remains 15 /20 variables (removed 5) and now considering 20/25 (removed 5) transitions.
// Phase 1: matrix 20 rows 15 cols
[2023-03-21 04:45:33] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 04:45:33] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 04:45:33] [INFO ] Invariant cache hit.
[2023-03-21 04:45:33] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/70610 places, 20/71131 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 292 ms. Remains : 15/70610 places, 20/71131 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLCardinality-09 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 s8 s14)], 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 51 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-09 finished in 372 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((p0&&F(G(p1)))))'
Support contains 4 out of 70610 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70609 transition count 71129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70609 transition count 71129
Applied a total of 2 rules in 23460 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:46:00] [INFO ] Invariants computation overflowed in 4254 ms
[2023-03-21 04:46:06] [INFO ] Implicit Places using invariants in 10175 ms returned []
Implicit Place search using SMT only with invariants took 10176 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:46:11] [INFO ] Invariants computation overflowed in 4337 ms
[2023-03-21 04:46:17] [INFO ] Dead Transitions using invariants and state equation in 10303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70609/70610 places, 71129/71131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43942 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s9695 s24462), p1:(LEQ s54616 s53747)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 20930 steps with 2 reset in 10003 ms.
Product exploration timeout after 20360 steps with 2 reset in 10002 ms.
Computed a total of 70609 stabilizing places and 71129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70609 transition count 71129
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 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4475 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 88002 steps, run timeout after 15018 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 88002 steps, saw 87144 distinct states, run finished after 15018 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:47:19] [INFO ] Invariants computation overflowed in 3880 ms
[2023-03-21 04:47:35] [INFO ] After 15935ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 04:48:00] [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 70609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70609/70609 places, 71129/71129 transitions.
Graph (complete) has 65940 edges and 70609 vertex of which 11 are kept as prefixes of interest. Removing 70598 places using SCC suffix rule.29 ms
Discarding 70598 places :
Also discarding 71084 output transitions
Drop transitions removed 71084 transitions
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 41 place count 9 transition count 5
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 45 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 6 transition count 4
Applied a total of 46 rules in 94 ms. Remains 6 /70609 variables (removed 70603) and now considering 4/71129 (removed 71125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 6/70609 places, 4/71129 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 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Support contains 2 out of 70609 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 70609/70609 places, 71129/71129 transitions.
Graph (complete) has 65940 edges and 70609 vertex of which 172 are kept as prefixes of interest. Removing 70437 places using SCC suffix rule.41 ms
Discarding 70437 places :
Also discarding 70826 output transitions
Drop transitions removed 70826 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 171 transition count 259
Discarding 128 places :
Symmetric choice reduction at 1 with 128 rule applications. Total rules 172 place count 43 transition count 58
Iterating global reduction 1 with 128 rules applied. Total rules applied 300 place count 43 transition count 58
Applied a total of 300 rules in 111 ms. Remains 43 /70609 variables (removed 70566) and now considering 58/71129 (removed 71071) transitions.
// Phase 1: matrix 58 rows 43 cols
[2023-03-21 04:48:00] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 04:48:00] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-21 04:48:00] [INFO ] Invariant cache hit.
[2023-03-21 04:48:00] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-21 04:48:00] [INFO ] Redundant transitions in 18 ms returned [4, 18, 21, 37, 39, 50, 55]
Found 7 redundant transitions using SMT.
Drop transitions removed 7 transitions
Redundant transitions reduction (with SMT) removed 7 transitions.
// Phase 1: matrix 51 rows 43 cols
[2023-03-21 04:48:00] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 04:48:00] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/70609 places, 51/71129 transitions.
Graph (complete) has 25 edges and 43 vertex of which 36 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Applied a total of 1 rules in 1 ms. Remains 36 /43 variables (removed 7) and now considering 44/51 (removed 7) transitions.
// Phase 1: matrix 44 rows 36 cols
[2023-03-21 04:48:00] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 04:48:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-21 04:48:00] [INFO ] Invariant cache hit.
[2023-03-21 04:48:01] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/70609 places, 44/71129 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 296 ms. Remains : 36/70609 places, 44/71129 transitions.
Computed a total of 36 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 36 transition count 44
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 : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 295 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=147 )
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 6363 steps with 94 reset in 13 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-11 finished in 148337 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)))'
Support contains 1 out of 70610 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Graph (complete) has 65941 edges and 70610 vertex of which 54 are kept as prefixes of interest. Removing 70556 places using SCC suffix rule.47 ms
Discarding 70556 places :
Also discarding 71033 output transitions
Drop transitions removed 71033 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 85
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 54 place count 12 transition count 17
Iterating global reduction 1 with 41 rules applied. Total rules applied 95 place count 12 transition count 17
Applied a total of 95 rules in 117 ms. Remains 12 /70610 variables (removed 70598) and now considering 17/71131 (removed 71114) transitions.
// Phase 1: matrix 17 rows 12 cols
[2023-03-21 04:48:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 04:48:01] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-21 04:48:01] [INFO ] Invariant cache hit.
[2023-03-21 04:48:01] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-21 04:48:01] [INFO ] Redundant transitions in 14 ms returned [5, 9, 15]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 14 rows 12 cols
[2023-03-21 04:48:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 04:48:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/70610 places, 14/71131 transitions.
Graph (complete) has 6 edges and 12 vertex of which 9 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 9 cols
[2023-03-21 04:48:01] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 04:48:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 04:48:01] [INFO ] Invariant cache hit.
[2023-03-21 04:48:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/70610 places, 11/71131 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 9/70610 places, 11/71131 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-13 finished in 396 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((G(p0)||X(p1))))'
Support contains 5 out of 70610 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70610/70610 places, 71131/71131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70609 transition count 71129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70609 transition count 71129
Applied a total of 2 rules in 20966 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:48:27] [INFO ] Invariants computation overflowed in 4193 ms
[2023-03-21 04:48:32] [INFO ] Implicit Places using invariants in 10004 ms returned []
Implicit Place search using SMT only with invariants took 10010 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-21 04:48:36] [INFO ] Invariants computation overflowed in 3886 ms
[2023-03-21 04:48:42] [INFO ] Dead Transitions using invariants and state equation in 9762 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70609/70610 places, 71129/71131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40743 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT s50875 s29965), p1:(OR (LEQ 1 s26640) (LEQ s44563 s10103))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 25580 steps with 3 reset in 10004 ms.
Entered a terminal (fully accepting) state of product in 17237 steps with 2 reset in 8038 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-15 finished in 59120 ms.
All properties solved by simple procedures.
Total runtime 894116 ms.
ITS solved all properties within timeout

BK_STOP 1679374142356

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-S16D2C4A03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ViralEpidemic-PT-S16D2C4A03, 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 r489-tall-167912708001355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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