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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 8.4K Feb 25 22:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 21:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 21:03 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.5K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 23:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 29M 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-S03D1C1A08-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S03D1C1A08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679356232092

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-S03D1C1A08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 23:50:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 23:50:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 23:50:35] [INFO ] Load time of PNML (sax parser for PT used): 1348 ms
[2023-03-20 23:50:35] [INFO ] Transformed 49206 places.
[2023-03-20 23:50:35] [INFO ] Transformed 68887 transitions.
[2023-03-20 23:50:35] [INFO ] Parsed PT model containing 49206 places and 68887 transitions and 157456 arcs in 1750 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 338 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:51:07] [INFO ] Invariants computation overflowed in 31002 ms
[2023-03-20 23:51:11] [INFO ] Implicit Places using invariants in 35063 ms returned []
Implicit Place search using SMT only with invariants took 35107 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:51:41] [INFO ] Invariants computation overflowed in 30284 ms
[2023-03-20 23:51:45] [INFO ] Dead Transitions using invariants and state equation in 34383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69865 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Support contains 38 out of 49206 places after structural reductions.
[2023-03-20 23:51:48] [INFO ] Flatten gal took : 2243 ms
[2023-03-20 23:51:50] [INFO ] Flatten gal took : 1777 ms
[2023-03-20 23:51:53] [INFO ] Input system was already deterministic with 68887 transitions.
Support contains 36 out of 49206 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 3883 ms. (steps per millisecond=2 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 245 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=3 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 41042 steps, run timeout after 27011 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 41042 steps, saw 39881 distinct states, run finished after 27015 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:53:00] [INFO ] Invariants computation overflowed in 30732 ms
[2023-03-20 23:53:24] [INFO ] After 23435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 23:53:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 23:53:49] [INFO ] After 25262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 304 are kept as prefixes of interest. Removing 48902 places using SCC suffix rule.83 ms
Discarding 48902 places :
Also discarding 68102 output transitions
Drop transitions removed 68102 transitions
Drop transitions removed 514 transitions
Reduce isomorphic transitions removed 514 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 626 rules applied. Total rules applied 627 place count 304 transition count 159
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 739 place count 192 transition count 159
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 739 place count 192 transition count 142
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 773 place count 175 transition count 142
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 824 place count 124 transition count 91
Iterating global reduction 2 with 51 rules applied. Total rules applied 875 place count 124 transition count 91
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 951 place count 86 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 952 place count 85 transition count 52
Ensure Unique test removed 17 places
Iterating post reduction 2 with 17 rules applied. Total rules applied 969 place count 68 transition count 52
Applied a total of 969 rules in 456 ms. Remains 68 /49206 variables (removed 49138) and now considering 52/68887 (removed 68835) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 68/49206 places, 52/68887 transitions.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 35 are kept as prefixes of interest. Removing 49171 places using SCC suffix rule.72 ms
Discarding 49171 places :
Also discarding 68820 output transitions
Drop transitions removed 68820 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 34 transition count 64
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 23 transition count 34
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 23 transition count 34
Graph (complete) has 12 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 22 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 22 transition count 32
Applied a total of 27 rules in 200 ms. Remains 22 /49206 variables (removed 49184) and now considering 32/68887 (removed 68855) transitions.
// Phase 1: matrix 32 rows 22 cols
[2023-03-20 23:53:50] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 23:53:50] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-20 23:53:50] [INFO ] Invariant cache hit.
[2023-03-20 23:53:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-20 23:53:50] [INFO ] Redundant transitions in 18 ms returned [4, 23, 25]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 29 rows 22 cols
[2023-03-20 23:53:50] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 23:53:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/49206 places, 29/68887 transitions.
Graph (complete) has 12 edges and 22 vertex of which 19 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 19 /22 variables (removed 3) and now considering 26/29 (removed 3) transitions.
// Phase 1: matrix 26 rows 19 cols
[2023-03-20 23:53:50] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 23:53:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 23:53:50] [INFO ] Invariant cache hit.
[2023-03-20 23:53:51] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/49206 places, 26/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 481 ms. Remains : 19/49206 places, 26/68887 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00 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 3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7092 reset in 279 ms.
Product exploration explored 100000 steps with 7101 reset in 148 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 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 p0)]
Incomplete random walk after 10000 steps, including 466 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Probably explored full state space saw : 145308 states, properties seen :0
Probabilistic random walk after 1139778 steps, saw 145308 distinct states, run finished after 774 ms. (steps per millisecond=1472 ) properties seen :0
Explored full state space saw : 145314 states, properties seen :0
Exhaustive walk after 1139832 steps, saw 145314 distinct states, run finished after 588 ms. (steps per millisecond=1938 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00 finished in 2991 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 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 36 are kept as prefixes of interest. Removing 49170 places using SCC suffix rule.37 ms
Discarding 49170 places :
Also discarding 68819 output transitions
Drop transitions removed 68819 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 35 transition count 65
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 24 transition count 35
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 24 transition count 35
Graph (complete) has 13 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 23 transition count 34
Applied a total of 26 rules in 102 ms. Remains 23 /49206 variables (removed 49183) and now considering 34/68887 (removed 68853) transitions.
// Phase 1: matrix 34 rows 23 cols
[2023-03-20 23:53:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 23:53:53] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 23:53:53] [INFO ] Invariant cache hit.
[2023-03-20 23:53:53] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-20 23:53:53] [INFO ] Redundant transitions in 16 ms returned [4, 10, 22, 32]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 30 rows 23 cols
[2023-03-20 23:53:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 23:53:53] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/49206 places, 30/68887 transitions.
Graph (complete) has 12 edges and 23 vertex of which 19 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 2 ms. Remains 19 /23 variables (removed 4) and now considering 26/30 (removed 4) transitions.
// Phase 1: matrix 26 rows 19 cols
[2023-03-20 23:53:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 23:53:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 23:53:53] [INFO ] Invariant cache hit.
[2023-03-20 23:53:53] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/49206 places, 26/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 316 ms. Remains : 19/49206 places, 26/68887 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 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:(GT 3 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7268 reset in 75 ms.
Product exploration explored 100000 steps with 7250 reset in 74 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 469 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Probably explored full state space saw : 136809 states, properties seen :0
Probabilistic random walk after 1071306 steps, saw 136809 distinct states, run finished after 688 ms. (steps per millisecond=1557 ) properties seen :0
Explored full state space saw : 136809 states, properties seen :0
Exhaustive walk after 1071306 steps, saw 136809 distinct states, run finished after 414 ms. (steps per millisecond=2587 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 finished in 2145 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 U (p1||G(p0))))))'
Support contains 4 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 128 are kept as prefixes of interest. Removing 49078 places using SCC suffix rule.44 ms
Discarding 49078 places :
Also discarding 68644 output transitions
Drop transitions removed 68644 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 127 transition count 222
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 63 place count 85 transition count 119
Iterating global reduction 1 with 42 rules applied. Total rules applied 105 place count 85 transition count 119
Graph (complete) has 47 edges and 85 vertex of which 83 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 83 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 83 transition count 116
Applied a total of 107 rules in 121 ms. Remains 83 /49206 variables (removed 49123) and now considering 116/68887 (removed 68771) transitions.
// Phase 1: matrix 116 rows 83 cols
[2023-03-20 23:53:55] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 23:53:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 23:53:55] [INFO ] Invariant cache hit.
[2023-03-20 23:53:55] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-20 23:53:55] [INFO ] Redundant transitions in 24 ms returned [7, 12, 32, 74, 99, 102, 107]
Found 7 redundant transitions using SMT.
Drop transitions removed 7 transitions
Redundant transitions reduction (with SMT) removed 7 transitions.
// Phase 1: matrix 109 rows 83 cols
[2023-03-20 23:53:55] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 23:53:55] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/49206 places, 109/68887 transitions.
Graph (complete) has 45 edges and 83 vertex of which 76 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 3 ms. Remains 76 /83 variables (removed 7) and now considering 102/109 (removed 7) transitions.
// Phase 1: matrix 102 rows 76 cols
[2023-03-20 23:53:55] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 23:53:55] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 23:53:55] [INFO ] Invariant cache hit.
[2023-03-20 23:53:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/49206 places, 102/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 432 ms. Remains : 76/49206 places, 102/68887 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s27 s67) (GT s47 s13)), p0:(GT s47 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 110 steps with 1 reset in 3 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 finished in 562 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))||G(p1)))'
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 180 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:54:25] [INFO ] Invariants computation overflowed in 28786 ms
[2023-03-20 23:54:28] [INFO ] Implicit Places using invariants in 32491 ms returned []
Implicit Place search using SMT only with invariants took 32501 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:54:56] [INFO ] Invariants computation overflowed in 27985 ms
[2023-03-20 23:55:00] [INFO ] Dead Transitions using invariants and state equation in 31711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64403 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ 1 s17278), p0:(GT 2 s15216)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 41160 steps with 258 reset in 10001 ms.
Product exploration timeout after 29240 steps with 194 reset in 10002 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 672 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 2504 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 2155 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 21783 steps, run timeout after 12014 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 21783 steps, saw 21187 distinct states, run finished after 12014 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:56:14] [INFO ] Invariants computation overflowed in 26301 ms
[2023-03-20 23:56:40] [INFO ] After 15527ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 23:56:40] [INFO ] After 15594ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-20 23:56:40] [INFO ] After 25254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 12 are kept as prefixes of interest. Removing 49194 places using SCC suffix rule.17 ms
Discarding 49194 places :
Also discarding 68856 output transitions
Drop transitions removed 68856 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 12 transition count 4
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 35 place count 5 transition count 4
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 3 transition count 2
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 3 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 2 transition count 1
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 1 transition count 1
Applied a total of 41 rules in 77 ms. Remains 1 /49206 variables (removed 49205) and now considering 1/68887 (removed 68886) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1/49206 places, 1/68887 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Probably explored full state space saw : 2 states, properties seen :0
Probabilistic random walk after 3 steps, saw 2 distinct states, run finished after 6 ms. (steps per millisecond=0 ) properties seen :0
Explored full state space saw : 2 states, properties seen :0
Exhaustive walk after 3 steps, saw 2 distinct states, run finished after 1 ms. (steps per millisecond=3 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 16 factoid took 430 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04 finished in 164588 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(!p0))))&&(X(p1) U ((p0&&X(p1))||X(G(p1))))))'
Support contains 3 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 122 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:57:07] [INFO ] Invariants computation overflowed in 26823 ms
[2023-03-20 23:57:11] [INFO ] Implicit Places using invariants in 30478 ms returned []
Implicit Place search using SMT only with invariants took 30480 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:57:42] [INFO ] Invariants computation overflowed in 30998 ms
[2023-03-20 23:57:46] [INFO ] Dead Transitions using invariants and state equation in 35185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65791 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (OR p0 p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s22802), p1:(GT s44947 s27677)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 9 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05 finished in 66194 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 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 37 are kept as prefixes of interest. Removing 49169 places using SCC suffix rule.28 ms
Discarding 49169 places :
Also discarding 68817 output transitions
Drop transitions removed 68817 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 36 transition count 65
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 26 transition count 39
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 26 transition count 39
Graph (complete) has 14 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 25 transition count 38
Applied a total of 26 rules in 77 ms. Remains 25 /49206 variables (removed 49181) and now considering 38/68887 (removed 68849) transitions.
// Phase 1: matrix 38 rows 25 cols
[2023-03-20 23:57:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 23:57:47] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 23:57:47] [INFO ] Invariant cache hit.
[2023-03-20 23:57:47] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-20 23:57:47] [INFO ] Redundant transitions in 17 ms returned [4, 10, 26, 31, 33, 36]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
// Phase 1: matrix 32 rows 25 cols
[2023-03-20 23:57:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 23:57:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/49206 places, 32/68887 transitions.
Graph (complete) has 13 edges and 25 vertex of which 19 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Applied a total of 1 rules in 1 ms. Remains 19 /25 variables (removed 6) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 19 cols
[2023-03-20 23:57:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 23:57:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-20 23:57:47] [INFO ] Invariant cache hit.
[2023-03-20 23:57:47] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/49206 places, 26/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 254 ms. Remains : 19/49206 places, 26/68887 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07 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:(GT 3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5090 reset in 113 ms.
Product exploration explored 100000 steps with 5099 reset in 118 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Probably explored full state space saw : 85292 states, properties seen :0
Probabilistic random walk after 653904 steps, saw 85292 distinct states, run finished after 445 ms. (steps per millisecond=1469 ) properties seen :0
Explored full state space saw : 85292 states, properties seen :0
Exhaustive walk after 653904 steps, saw 85292 distinct states, run finished after 293 ms. (steps per millisecond=2231 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07 finished in 1788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(G(p0))&&F((p1||(p0 U p2)))))))))'
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 120 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:58:16] [INFO ] Invariants computation overflowed in 27553 ms
[2023-03-20 23:58:20] [INFO ] Implicit Places using invariants in 31584 ms returned []
Implicit Place search using SMT only with invariants took 31586 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-20 23:58:47] [INFO ] Invariants computation overflowed in 27161 ms
[2023-03-20 23:58:51] [INFO ] Dead Transitions using invariants and state equation in 30834 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62548 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s9316 s8791), p2:(LEQ 1 s20104), p0:(LEQ s45826 s2953)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 40070 steps with 270 reset in 10001 ms.
Product exploration timeout after 28220 steps with 163 reset in 10001 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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 p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 2567 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 2105 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 2148 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 2130 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 41896 steps, run timeout after 24004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 41896 steps, saw 40711 distinct states, run finished after 24005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:00:26] [INFO ] Invariants computation overflowed in 31738 ms
[2023-03-21 00:00:37] [INFO ] After 10261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 00:01:02] [INFO ] After 13567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 00:01:02] [INFO ] After 13588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-21 00:01:02] [INFO ] After 25069ms 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 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 56 are kept as prefixes of interest. Removing 49150 places using SCC suffix rule.13 ms
Discarding 49150 places :
Also discarding 68742 output transitions
Drop transitions removed 68742 transitions
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 56 transition count 23
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 151 place count 28 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 151 place count 28 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 25 transition count 20
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 18 transition count 13
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 18 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 13 transition count 8
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 11 transition count 8
Applied a total of 182 rules in 70 ms. Remains 11 /49206 variables (removed 49195) and now considering 8/68887 (removed 68879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 11/49206 places, 8/68887 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 231 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 112 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:01:31] [INFO ] Invariants computation overflowed in 28386 ms
[2023-03-21 00:01:35] [INFO ] Implicit Places using invariants in 31943 ms returned []
Implicit Place search using SMT only with invariants took 31945 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:02:02] [INFO ] Invariants computation overflowed in 27704 ms
[2023-03-21 00:02:06] [INFO ] Dead Transitions using invariants and state equation in 31872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63934 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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 p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 3016 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 2498 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 2472 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 2451 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 49033 steps, run timeout after 30013 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 49033 steps, saw 47646 distinct states, run finished after 30014 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:03:28] [INFO ] Invariants computation overflowed in 30009 ms
[2023-03-21 00:03:38] [INFO ] After 10036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 00:04:03] [INFO ] After 12825ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 00:04:03] [INFO ] After 12856ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-21 00:04:03] [INFO ] After 25078ms 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 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 56 are kept as prefixes of interest. Removing 49150 places using SCC suffix rule.16 ms
Discarding 49150 places :
Also discarding 68742 output transitions
Drop transitions removed 68742 transitions
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 56 transition count 23
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 151 place count 28 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 151 place count 28 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 25 transition count 20
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 18 transition count 13
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 18 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 13 transition count 8
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 11 transition count 8
Applied a total of 182 rules in 74 ms. Remains 11 /49206 variables (removed 49195) and now considering 8/68887 (removed 68879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 11/49206 places, 8/68887 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 38200 steps with 252 reset in 10001 ms.
Product exploration timeout after 27910 steps with 196 reset in 10002 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 160 are kept as prefixes of interest. Removing 49046 places using SCC suffix rule.38 ms
Discarding 49046 places :
Also discarding 68586 output transitions
Drop transitions removed 68586 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 160 transition count 281
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 70 place count 111 transition count 159
Iterating global reduction 1 with 49 rules applied. Total rules applied 119 place count 111 transition count 159
Graph (complete) has 69 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 109 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 109 transition count 156
Applied a total of 121 rules in 129 ms. Remains 109 /49206 variables (removed 49097) and now considering 156/68887 (removed 68731) transitions.
[2023-03-21 00:04:25] [INFO ] Redundant transitions in 30 ms returned [18, 29, 36, 40, 47, 61, 70, 73, 78, 88, 95, 138, 142, 144]
Found 14 redundant transitions using SMT.
Drop transitions removed 14 transitions
Redundant transitions reduction (with SMT) removed 14 transitions.
// Phase 1: matrix 142 rows 109 cols
[2023-03-21 00:04:25] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 00:04:25] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/49206 places, 142/68887 transitions.
Graph (complete) has 67 edges and 109 vertex of which 95 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 2 ms. Remains 95 /109 variables (removed 14) and now considering 128/142 (removed 14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/49206 places, 128/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 95/49206 places, 128/68887 transitions.
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 116 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:05:09] [INFO ] Invariants computation overflowed in 44189 ms
[2023-03-21 00:05:13] [INFO ] Implicit Places using invariants in 48363 ms returned []
Implicit Place search using SMT only with invariants took 48366 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:05:49] [INFO ] Invariants computation overflowed in 35788 ms
[2023-03-21 00:05:53] [INFO ] Dead Transitions using invariants and state equation in 39944 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88430 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08 finished in 488047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 192 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:06:32] [INFO ] Invariants computation overflowed in 35456 ms
[2023-03-21 00:06:36] [INFO ] Implicit Places using invariants in 39525 ms returned []
Implicit Place search using SMT only with invariants took 39528 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:07:02] [INFO ] Invariants computation overflowed in 25534 ms
[2023-03-21 00:07:06] [INFO ] Dead Transitions using invariants and state equation in 29647 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69377 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 s4041)], 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 36520 steps with 248 reset in 10003 ms.
Product exploration timeout after 26380 steps with 172 reset in 10004 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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 186 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 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 2639 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 2202 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20918 steps, run timeout after 12009 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 20918 steps, saw 20347 distinct states, run finished after 12009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:08:21] [INFO ] Invariants computation overflowed in 27653 ms
[2023-03-21 00:08:46] [INFO ] After 15440ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 00:08:46] [INFO ] After 15462ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-21 00:08:46] [INFO ] After 25295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 11 are kept as prefixes of interest. Removing 49195 places using SCC suffix rule.18 ms
Discarding 49195 places :
Also discarding 68858 output transitions
Drop transitions removed 68858 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 11 transition count 5
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 31 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 31 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 3 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 3 transition count 3
Applied a total of 35 rules in 79 ms. Remains 3 /49206 variables (removed 49203) and now considering 3/68887 (removed 68884) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 3/49206 places, 3/68887 transitions.
Incomplete random walk after 10000 steps, including 3333 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Probably explored full state space saw : 4 states, properties seen :0
Probabilistic random walk after 7 steps, saw 4 distinct states, run finished after 9 ms. (steps per millisecond=0 ) properties seen :0
Explored full state space saw : 4 states, properties seen :0
Exhaustive walk after 7 steps, saw 4 distinct states, run finished after 1 ms. (steps per millisecond=7 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 6 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-09 finished in 170478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1&&X(p1))||p0))))'
Support contains 8 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 112 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:09:25] [INFO ] Invariants computation overflowed in 37949 ms
[2023-03-21 00:09:29] [INFO ] Implicit Places using invariants in 42000 ms returned []
Implicit Place search using SMT only with invariants took 42001 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:09:55] [INFO ] Invariants computation overflowed in 26224 ms
[2023-03-21 00:09:59] [INFO ] Dead Transitions using invariants and state equation in 30290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72412 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s31973 s45153) (AND (LEQ 1 s36182) (LEQ 3 s20800) (LEQ s12392 s4792))), p1:(LEQ s10482 s35306)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 14190 steps with 7095 reset in 10005 ms.
Product exploration timeout after 12440 steps with 6220 reset in 10008 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) 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.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10 finished in 102839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(F(p1))))))'
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 163 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:11:14] [INFO ] Invariants computation overflowed in 44625 ms
[2023-03-21 00:11:19] [INFO ] Implicit Places using invariants in 48790 ms returned []
Implicit Place search using SMT only with invariants took 48793 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:11:45] [INFO ] Invariants computation overflowed in 26660 ms
[2023-03-21 00:11:49] [INFO ] Dead Transitions using invariants and state equation in 30645 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79607 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GT 2 s6062), p0:(LEQ 3 s48095)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 186 steps with 0 reset in 58 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12 finished in 79937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((X(p0) U p1)||p0))||F(X(F(p0))))))'
Support contains 3 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 116 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:12:20] [INFO ] Invariants computation overflowed in 30822 ms
[2023-03-21 00:12:25] [INFO ] Implicit Places using invariants in 34939 ms returned []
Implicit Place search using SMT only with invariants took 34941 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:12:59] [INFO ] Invariants computation overflowed in 34329 ms
[2023-03-21 00:13:03] [INFO ] Dead Transitions using invariants and state equation in 38444 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73507 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s26238 s46007), p0:(LEQ 1 s1313)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 13760 steps with 6880 reset in 10005 ms.
Product exploration timeout after 12480 steps with 6240 reset in 10004 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
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 (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-13 finished in 103374 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)||(G(p1) U p0)))'
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 119 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:14:01] [INFO ] Invariants computation overflowed in 28182 ms
[2023-03-21 00:14:05] [INFO ] Implicit Places using invariants in 32214 ms returned []
Implicit Place search using SMT only with invariants took 32215 ms to find 0 implicit places.
// Phase 1: matrix 68887 rows 49206 cols
[2023-03-21 00:14:33] [INFO ] Invariants computation overflowed in 28054 ms
[2023-03-21 00:14:37] [INFO ] Dead Transitions using invariants and state equation in 32001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64338 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s37994), p1:(LEQ 3 s23365)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 9 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14 finished in 64644 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||X((G(p1) U (p0&&G(p1))))))))'
Support contains 3 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 101 are kept as prefixes of interest. Removing 49105 places using SCC suffix rule.24 ms
Discarding 49105 places :
Also discarding 68700 output transitions
Drop transitions removed 68700 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 100 transition count 176
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 45 place count 66 transition count 91
Iterating global reduction 1 with 34 rules applied. Total rules applied 79 place count 66 transition count 91
Applied a total of 79 rules in 75 ms. Remains 66 /49206 variables (removed 49140) and now considering 91/68887 (removed 68796) transitions.
// Phase 1: matrix 91 rows 66 cols
[2023-03-21 00:14:38] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 00:14:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-21 00:14:38] [INFO ] Invariant cache hit.
[2023-03-21 00:14:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-21 00:14:38] [INFO ] Redundant transitions in 21 ms returned [12, 16, 22, 41, 82]
Found 5 redundant transitions using SMT.
Drop transitions removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
// Phase 1: matrix 86 rows 66 cols
[2023-03-21 00:14:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 00:14:38] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/49206 places, 86/68887 transitions.
Graph (complete) has 39 edges and 66 vertex of which 61 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 2 ms. Remains 61 /66 variables (removed 5) and now considering 81/86 (removed 5) transitions.
// Phase 1: matrix 81 rows 61 cols
[2023-03-21 00:14:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 00:14:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-21 00:14:38] [INFO ] Invariant cache hit.
[2023-03-21 00:14:38] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/49206 places, 81/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 296 ms. Remains : 61/49206 places, 81/68887 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s54 s34), p1:(LEQ 2 s18)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5273 steps with 162 reset in 17 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-15 finished in 478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(G(p0))&&F((p1||(p0 U p2)))))))))'
Found a Shortening insensitive property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 160 are kept as prefixes of interest. Removing 49046 places using SCC suffix rule.38 ms
Discarding 49046 places :
Also discarding 68586 output transitions
Drop transitions removed 68586 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 159 transition count 280
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 70 place count 110 transition count 158
Iterating global reduction 1 with 49 rules applied. Total rules applied 119 place count 110 transition count 158
Graph (complete) has 66 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 108 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 108 transition count 155
Applied a total of 121 rules in 103 ms. Remains 108 /49206 variables (removed 49098) and now considering 155/68887 (removed 68732) transitions.
// Phase 1: matrix 155 rows 108 cols
[2023-03-21 00:14:38] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 00:14:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-21 00:14:39] [INFO ] Invariant cache hit.
[2023-03-21 00:14:39] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-21 00:14:39] [INFO ] Invariant cache hit.
[2023-03-21 00:14:39] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 108/49206 places, 155/68887 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 269 ms. Remains : 108/49206 places, 155/68887 transitions.
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s50 s36), p2:(LEQ 1 s72), p0:(LEQ s97 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11774 steps with 162 reset in 22 ms.
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08 finished in 686 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-21 00:14:41] [INFO ] Flatten gal took : 1788 ms
[2023-03-21 00:14:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 00:14:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 49206 places, 68887 transitions and 157456 arcs took 173 ms.
Total runtime 1447687 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1496/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08

BK_STOP 1679357961449

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08
ltl formula formula --ltl=/tmp/1496/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 49206 places, 68887 transitions and 157456 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 10.220 real 2.610 user 3.660 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1496/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1496/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1496/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1496/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-S03D1C1A08"
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-S03D1C1A08, 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-167912707901283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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