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-167912704301355.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-S16D2C4A03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912704301355
=====================================================================

--------------------
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 1679258840054

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-S16D2C4A03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 20:47:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 20:47:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 20:47:23] [INFO ] Load time of PNML (sax parser for PT used): 1688 ms
[2023-03-19 20:47:23] [INFO ] Transformed 78643 places.
[2023-03-19 20:47:23] [INFO ] Transformed 144177 transitions.
[2023-03-19 20:47:23] [INFO ] Parsed PT model containing 78643 places and 144177 transitions and 353889 arcs in 2440 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 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 72767 ms. Remains 70610 /78643 variables (removed 8033) and now considering 71131/144177 (removed 73046) transitions.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-19 20:48:42] [INFO ] Invariants computation overflowed in 5148 ms
[2023-03-19 20:48:47] [INFO ] Implicit Places using invariants in 10536 ms returned []
Implicit Place search using SMT only with invariants took 10565 ms to find 0 implicit places.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-19 20:48:53] [INFO ] Invariants computation overflowed in 5172 ms
[2023-03-19 20:48:58] [INFO ] Dead Transitions using invariants and state equation in 10333 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 93685 ms. Remains : 70610/78643 places, 71131/144177 transitions.
Support contains 45 out of 70610 places after structural reductions.
[2023-03-19 20:49:01] [INFO ] Flatten gal took : 2386 ms
[2023-03-19 20:49:03] [INFO ] Flatten gal took : 2093 ms
[2023-03-19 20:49:07] [INFO ] Input system was already deterministic with 71131 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4735 ms. (steps per millisecond=2 ) properties (out of 26) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=5 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-19 20:49:18] [INFO ] Invariants computation overflowed in 4486 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-19 20:49:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 20:49:43] [INFO ] After 25225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 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 111 are kept as prefixes of interest. Removing 70499 places using SCC suffix rule.63 ms
Discarding 70499 places :
Also discarding 70622 output transitions
Drop transitions removed 70622 transitions
Drop transitions removed 422 transitions
Reduce isomorphic transitions removed 422 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 426 rules applied. Total rules applied 427 place count 111 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 431 place count 107 transition count 83
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 431 place count 107 transition count 60
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 477 place count 84 transition count 60
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 2 with 18 rules applied. Total rules applied 495 place count 75 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 496 place count 74 transition count 50
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 497 place count 73 transition count 50
Applied a total of 497 rules in 228 ms. Remains 73 /70610 variables (removed 70537) and now considering 50/71131 (removed 71081) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 73/70610 places, 50/71131 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 50 rows 73 cols
[2023-03-19 20:49:44] [INFO ] Computed 23 place invariants in 0 ms
[2023-03-19 20:49:44] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 3 ms returned sat
[2023-03-19 20:49:44] [INFO ] After 75ms 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 23647 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:50:12] [INFO ] Invariants computation overflowed in 4563 ms
[2023-03-19 20:50:18] [INFO ] Implicit Places using invariants in 9902 ms returned []
Implicit Place search using SMT only with invariants took 9903 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:50:21] [INFO ] Invariants computation overflowed in 3685 ms
[2023-03-19 20:50:27] [INFO ] Dead Transitions using invariants and state equation in 8894 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 42468 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 348 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 20450 steps with 10225 reset in 10003 ms.
Product exploration timeout after 19820 steps with 9910 reset in 10003 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 193 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 80634 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 15324 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:51:24] [INFO ] Invariants computation overflowed in 3707 ms
[2023-03-19 20:51:29] [INFO ] Implicit Places using invariants in 8749 ms returned []
Implicit Place search using SMT only with invariants took 8761 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:51:33] [INFO ] Invariants computation overflowed in 4333 ms
[2023-03-19 20:51:38] [INFO ] Dead Transitions using invariants and state equation in 9464 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 33561 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 78 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 4824 steps with 0 reset in 2452 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-03 finished in 36219 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 15461 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:52:00] [INFO ] Invariants computation overflowed in 3456 ms
[2023-03-19 20:52:05] [INFO ] Implicit Places using invariants in 8420 ms returned []
Implicit Place search using SMT only with invariants took 8422 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:52:08] [INFO ] Invariants computation overflowed in 3619 ms
[2023-03-19 20:52:13] [INFO ] Dead Transitions using invariants and state equation in 8568 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 32458 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 93 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]]
Entered a terminal (fully accepting) state of product in 9422 steps with 1 reset in 4086 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-06 finished in 36760 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 17687 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:52:40] [INFO ] Invariants computation overflowed in 4252 ms
[2023-03-19 20:52:45] [INFO ] Implicit Places using invariants in 9278 ms returned []
Implicit Place search using SMT only with invariants took 9279 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:52:49] [INFO ] Invariants computation overflowed in 3836 ms
[2023-03-19 20:52:53] [INFO ] Dead Transitions using invariants and state equation in 8746 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 35716 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 255 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 27960 steps with 3009 reset in 10002 ms.
Entered a terminal (fully accepting) state of product in 21694 steps with 5224 reset in 6580 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-07 finished in 52687 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 9065 ms. Remains 70610 /70610 variables (removed 0) and now considering 71131/71131 (removed 0) transitions.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-19 20:53:24] [INFO ] Invariants computation overflowed in 4268 ms
[2023-03-19 20:53:28] [INFO ] Implicit Places using invariants in 9007 ms returned []
Implicit Place search using SMT only with invariants took 9009 ms to find 0 implicit places.
// Phase 1: matrix 71131 rows 70610 cols
[2023-03-19 20:53:33] [INFO ] Invariants computation overflowed in 4217 ms
[2023-03-19 20:53:38] [INFO ] Dead Transitions using invariants and state equation in 9234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27311 ms. Remains : 70610/70610 places, 71131/71131 transitions.
Stuttering acceptance computed with spot in 96 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 27545 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.56 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 127 ms. Remains 20 /70610 variables (removed 70590) and now considering 30/71131 (removed 71101) transitions.
// Phase 1: matrix 30 rows 20 cols
[2023-03-19 20:53:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:53:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 20:53:38] [INFO ] Invariant cache hit.
[2023-03-19 20:53:38] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-19 20:53:38] [INFO ] Redundant transitions in 13 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-19 20:53:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:53:38] [INFO ] Dead Transitions using invariants and state equation in 22 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 4 ms. Remains 15 /20 variables (removed 5) and now considering 20/25 (removed 5) transitions.
// Phase 1: matrix 20 rows 15 cols
[2023-03-19 20:53:38] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 20:53:38] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-19 20:53:38] [INFO ] Invariant cache hit.
[2023-03-19 20:53:38] [INFO ] Implicit Places using invariants and state equation in 26 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 : 15/70610 places, 20/71131 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 308 ms. Remains : 15/70610 places, 20/71131 transitions.
Stuttering acceptance computed with spot in 42 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 27 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-09 finished in 416 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 16564 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:53:59] [INFO ] Invariants computation overflowed in 4052 ms
[2023-03-19 20:54:04] [INFO ] Implicit Places using invariants in 9000 ms returned []
Implicit Place search using SMT only with invariants took 9001 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:54:08] [INFO ] Invariants computation overflowed in 3808 ms
[2023-03-19 20:54:13] [INFO ] Dead Transitions using invariants and state equation in 8778 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 34345 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 122 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 25000 steps with 3 reset in 10003 ms.
Product exploration timeout after 19780 steps with 2 reset in 10005 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 238 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 41 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5107 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 607 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 89588 steps, run timeout after 15018 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 89588 steps, saw 88717 distinct states, run finished after 15019 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:55:15] [INFO ] Invariants computation overflowed in 3917 ms
[2023-03-19 20:55:31] [INFO ] After 15771ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:55:56] [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 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.20 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 96 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 97 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 : [(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 241 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 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 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.50 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 125 ms. Remains 43 /70609 variables (removed 70566) and now considering 58/71129 (removed 71071) transitions.
// Phase 1: matrix 58 rows 43 cols
[2023-03-19 20:55:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:55:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 20:55:57] [INFO ] Invariant cache hit.
[2023-03-19 20:55:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-19 20:55:57] [INFO ] Redundant transitions in 16 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-19 20:55:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:55:57] [INFO ] Dead Transitions using invariants and state equation in 30 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 0 ms. Remains 36 /43 variables (removed 7) and now considering 44/51 (removed 7) transitions.
// Phase 1: matrix 44 rows 36 cols
[2023-03-19 20:55:57] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 20:55:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 20:55:57] [INFO ] Invariant cache hit.
[2023-03-19 20:55:57] [INFO ] Implicit Places using invariants and state equation in 33 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 314 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 142 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 49 ms :[(NOT p1)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
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 180 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 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 17334 steps with 256 reset in 28 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-11 finished in 138907 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.39 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 121 ms. Remains 12 /70610 variables (removed 70598) and now considering 17/71131 (removed 71114) transitions.
// Phase 1: matrix 17 rows 12 cols
[2023-03-19 20:55:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:55:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 20:55:57] [INFO ] Invariant cache hit.
[2023-03-19 20:55:57] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-19 20:55:57] [INFO ] Redundant transitions in 11 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-19 20:55:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:55:57] [INFO ] Dead Transitions using invariants and state equation in 22 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 1 ms. Remains 9 /12 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 9 cols
[2023-03-19 20:55:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:55:57] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-19 20:55:57] [INFO ] Invariant cache hit.
[2023-03-19 20:55:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 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 238 ms. Remains : 9/70610 places, 11/71131 transitions.
Stuttering acceptance computed with spot in 66 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 18 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 351 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 18269 ms. Remains 70609 /70610 variables (removed 1) and now considering 71129/71131 (removed 2) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:56:20] [INFO ] Invariants computation overflowed in 3638 ms
[2023-03-19 20:56:25] [INFO ] Implicit Places using invariants in 8768 ms returned []
Implicit Place search using SMT only with invariants took 8771 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:56:28] [INFO ] Invariants computation overflowed in 3464 ms
[2023-03-19 20:56:33] [INFO ] Dead Transitions using invariants and state equation in 8436 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 35479 ms. Remains : 70609/70610 places, 71129/71131 transitions.
Stuttering acceptance computed with spot in 159 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 21000 steps with 2 reset in 10005 ms.
Product exploration timeout after 23070 steps with 2 reset in 10003 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 (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), true, (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 622 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4961 ms. (steps per millisecond=2 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 639 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:57:22] [INFO ] Invariants computation overflowed in 3593 ms
[2023-03-19 20:57:39] [INFO ] After 17089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 20:58:04] [INFO ] After 5618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 20:58:04] [INFO ] After 5682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-19 20:58:04] [INFO ] After 25112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 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 25 are kept as prefixes of interest. Removing 70584 places using SCC suffix rule.18 ms
Discarding 70584 places :
Also discarding 71020 output transitions
Drop transitions removed 71020 transitions
Drop transitions removed 89 transitions
Reduce isomorphic transitions removed 89 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 92 rules applied. Total rules applied 93 place count 25 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 96 place count 22 transition count 17
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 96 place count 22 transition count 12
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 106 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 108 place count 16 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 15 transition count 10
Applied a total of 109 rules in 78 ms. Remains 15 /70609 variables (removed 70594) and now considering 10/71129 (removed 71119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 15/70609 places, 10/71129 transitions.
Finished random walk after 24 steps, including 2 resets, run visited all 3 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), true, (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 749 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 5 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 7259 ms. Remains 70609 /70609 variables (removed 0) and now considering 71129/71129 (removed 0) transitions.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:58:16] [INFO ] Invariants computation overflowed in 3910 ms
[2023-03-19 20:58:21] [INFO ] Implicit Places using invariants in 8723 ms returned []
Implicit Place search using SMT only with invariants took 8724 ms to find 0 implicit places.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:58:25] [INFO ] Invariants computation overflowed in 3615 ms
[2023-03-19 20:58:30] [INFO ] Dead Transitions using invariants and state equation in 8565 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24554 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 : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), true, (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 429 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4544 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 71129 rows 70609 cols
[2023-03-19 20:58:58] [INFO ] Invariants computation overflowed in 3419 ms
[2023-03-19 20:59:15] [INFO ] After 17225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 20:59:40] [INFO ] After 5625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 20:59:40] [INFO ] After 5652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-19 20:59:40] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 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 25 are kept as prefixes of interest. Removing 70584 places using SCC suffix rule.19 ms
Discarding 70584 places :
Also discarding 71020 output transitions
Drop transitions removed 71020 transitions
Drop transitions removed 89 transitions
Reduce isomorphic transitions removed 89 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 92 rules applied. Total rules applied 93 place count 25 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 96 place count 22 transition count 17
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 96 place count 22 transition count 12
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 106 place count 17 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 108 place count 16 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 15 transition count 10
Applied a total of 109 rules in 78 ms. Remains 15 /70609 variables (removed 70594) and now considering 10/71129 (removed 71119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 15/70609 places, 10/71129 transitions.
Finished random walk after 114 steps, including 10 resets, run visited all 3 properties in 1 ms. (steps per millisecond=114 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), true, (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F p0), (F (AND (NOT p1) p0)), (F (NOT p1)), (F (AND p1 p0)), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 12 factoid took 493 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 21000 steps with 2 reset in 10005 ms.
Entered a terminal (fully accepting) state of product in 18633 steps with 2 reset in 9182 ms.
FORMULA ViralEpidemic-PT-S16D2C4A03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A03-LTLCardinality-15 finished in 242785 ms.
All properties solved by simple procedures.
Total runtime 759336 ms.
ITS solved all properties within timeout

BK_STOP 1679259602136

--------------------
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="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-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 r487-tall-167912704301355"
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 ;