Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 09:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 19M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717210844816

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S02D1C1A12
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-01 03:00:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-01 03:00:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:00:49] [INFO ] Load time of PNML (sax parser for PT used): 1777 ms
[2024-06-01 03:00:49] [INFO ] Transformed 32765 places.
[2024-06-01 03:00:49] [INFO ] Transformed 40955 transitions.
[2024-06-01 03:00:49] [INFO ] Found NUPN structural information;
[2024-06-01 03:00:49] [INFO ] Parsed PT model containing 32765 places and 40955 transitions and 90101 arcs in 2143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 8068 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:01:26] [INFO ] Invariants computation overflowed in 28223 ms
[2024-06-01 03:01:33] [INFO ] Implicit Places using invariants in 35381 ms returned []
Implicit Place search using SMT only with invariants took 35428 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:01:59] [INFO ] Invariants computation overflowed in 25829 ms
[2024-06-01 03:02:06] [INFO ] Dead Transitions using invariants and state equation in 32557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76067 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Support contains 45 out of 32765 places after structural reductions.
[2024-06-01 03:02:09] [INFO ] Flatten gal took : 1700 ms
[2024-06-01 03:02:10] [INFO ] Flatten gal took : 1385 ms
[2024-06-01 03:02:12] [INFO ] Input system was already deterministic with 40955 transitions.
Support contains 44 out of 32765 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 884 resets, run finished after 3765 ms. (steps per millisecond=2 ) properties (out of 25) seen :4
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 307 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 365 ms. (steps per millisecond=2 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 389 ms. (steps per millisecond=2 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 294 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 284 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 282 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 289 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 285 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 287 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 287 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 296 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 294 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 288 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 288 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 285 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 343 ms. (steps per millisecond=2 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 291 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 284 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 286 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 286 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 292 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:02:43] [INFO ] Invariants computation overflowed in 20043 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-01 03:03:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 03:03:08] [INFO ] After 25243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 358 are kept as prefixes of interest. Removing 32407 places using SCC suffix rule.56 ms
Discarding 32407 places :
Also discarding 40041 output transitions
Drop transitions removed 40041 transitions
Drop transitions removed 585 transitions
Reduce isomorphic transitions removed 585 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 744 rules applied. Total rules applied 745 place count 358 transition count 170
Reduce places removed 159 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 160 rules applied. Total rules applied 905 place count 199 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 906 place count 198 transition count 169
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 906 place count 198 transition count 154
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 936 place count 183 transition count 154
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 973 place count 146 transition count 117
Iterating global reduction 3 with 37 rules applied. Total rules applied 1010 place count 146 transition count 117
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1116 place count 93 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1117 place count 92 transition count 63
Ensure Unique test removed 19 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 1136 place count 73 transition count 63
Applied a total of 1136 rules in 273 ms. Remains 73 /32765 variables (removed 32692) and now considering 63/40955 (removed 40892) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 73/32765 places, 63/40955 transitions.
Finished random walk after 353 steps, including 6 resets, run visited all 21 properties in 19 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p0&&G(F(p1))))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 11705 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:03:37] [INFO ] Invariants computation overflowed in 15876 ms
[2024-06-01 03:03:44] [INFO ] Implicit Places using invariants in 23175 ms returned []
Implicit Place search using SMT only with invariants took 23181 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:04:01] [INFO ] Invariants computation overflowed in 17396 ms
[2024-06-01 03:04:08] [INFO ] Dead Transitions using invariants and state equation in 23880 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58786 ms. Remains : 32765/32765 places, 40955/40955 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 492 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s21477 0) (EQ s20456 1)), p1:(OR (EQ s14821 0) (EQ s643 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 19690 steps with 6836 reset in 10001 ms.
Product exploration timeout after 17680 steps with 6067 reset in 10002 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 191 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 926 resets, run finished after 3679 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 2674 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 2637 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 2627 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 47007 steps, run timeout after 33001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 47007 steps, saw 44973 distinct states, run finished after 33004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:05:44] [INFO ] Invariants computation overflowed in 19271 ms
[2024-06-01 03:06:09] [INFO ] After 9457ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 03:06:09] [INFO ] After 9542ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-01 03:06:09] [INFO ] After 25121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 51 are kept as prefixes of interest. Removing 32714 places using SCC suffix rule.10 ms
Discarding 32714 places :
Also discarding 40821 output transitions
Drop transitions removed 40821 transitions
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 51 transition count 17
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 149 place count 20 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 149 place count 20 transition count 16
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 151 place count 19 transition count 16
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 155 place count 15 transition count 12
Iterating global reduction 2 with 4 rules applied. Total rules applied 159 place count 15 transition count 12
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 169 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 9 transition count 6
Ensure Unique test removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 173 place count 6 transition count 6
Applied a total of 173 rules in 89 ms. Remains 6 /32765 variables (removed 32759) and now considering 6/40955 (removed 40949) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 6/32765 places, 6/40955 transitions.
Finished random walk after 9 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 458 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 6374 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:06:37] [INFO ] Invariants computation overflowed in 19734 ms
[2024-06-01 03:06:43] [INFO ] Implicit Places using invariants in 26032 ms returned []
Implicit Place search using SMT only with invariants took 26034 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:06:59] [INFO ] Invariants computation overflowed in 16269 ms
[2024-06-01 03:07:06] [INFO ] Dead Transitions using invariants and state equation in 22615 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55034 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 971 resets, run finished after 3551 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 2643 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 3156 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 111 resets, run finished after 2777 ms. (steps per millisecond=3 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 51943 steps, run timeout after 36125 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 51943 steps, saw 49641 distinct states, run finished after 36126 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:08:26] [INFO ] Invariants computation overflowed in 20288 ms
[2024-06-01 03:08:51] [INFO ] After 10117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 03:08:51] [INFO ] After 10165ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-01 03:08:51] [INFO ] After 25082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 51 are kept as prefixes of interest. Removing 32714 places using SCC suffix rule.11 ms
Discarding 32714 places :
Also discarding 40821 output transitions
Drop transitions removed 40821 transitions
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 51 transition count 17
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 149 place count 20 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 149 place count 20 transition count 16
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 19 transition count 16
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 155 place count 15 transition count 12
Iterating global reduction 2 with 4 rules applied. Total rules applied 159 place count 15 transition count 12
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 169 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 9 transition count 6
Ensure Unique test removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 173 place count 6 transition count 6
Applied a total of 173 rules in 70 ms. Remains 6 /32765 variables (removed 32759) and now considering 6/40955 (removed 40949) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 6/32765 places, 6/40955 transitions.
Finished random walk after 27 steps, including 4 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 411 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Product exploration timeout after 20580 steps with 7043 reset in 10004 ms.
Product exploration timeout after 18170 steps with 6276 reset in 10004 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 143 are kept as prefixes of interest. Removing 32622 places using SCC suffix rule.81 ms
Discarding 32622 places :
Also discarding 40738 output transitions
Drop transitions removed 40738 transitions
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 104 transition count 138
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 104 transition count 138
Graph (complete) has 61 edges and 104 vertex of which 103 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 0 with 1 rules applied. Total rules applied 80 place count 103 transition count 137
Applied a total of 80 rules in 179 ms. Remains 103 /32765 variables (removed 32662) and now considering 137/40955 (removed 40818) transitions.
[2024-06-01 03:09:13] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 137 rows 103 cols
[2024-06-01 03:09:13] [INFO ] Computed 0 invariants in 2 ms
[2024-06-01 03:09:14] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/32765 places, 137/40955 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 103/32765 places, 137/40955 transitions.
Built C files in :
/tmp/ltsmin12106636959155997941
[2024-06-01 03:09:14] [INFO ] Built C files in 833ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12106636959155997941
Running compilation step : cd /tmp/ltsmin12106636959155997941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12106636959155997941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12106636959155997941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 5170 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:09:44] [INFO ] Invariants computation overflowed in 21179 ms
[2024-06-01 03:09:50] [INFO ] Implicit Places using invariants in 27778 ms returned []
Implicit Place search using SMT only with invariants took 27780 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:10:06] [INFO ] Invariants computation overflowed in 15158 ms
[2024-06-01 03:10:12] [INFO ] Dead Transitions using invariants and state equation in 21244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54206 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Built C files in :
/tmp/ltsmin3547571976846253173
[2024-06-01 03:10:12] [INFO ] Built C files in 399ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3547571976846253173
Running compilation step : cd /tmp/ltsmin3547571976846253173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3547571976846253173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3547571976846253173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-01 03:10:18] [INFO ] Flatten gal took : 1069 ms
[2024-06-01 03:10:19] [INFO ] Flatten gal took : 1045 ms
[2024-06-01 03:10:19] [INFO ] Time to serialize gal into /tmp/LTL11513998685448632247.gal : 302 ms
[2024-06-01 03:10:19] [INFO ] Time to serialize properties into /tmp/LTL9652577876418613606.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11513998685448632247.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9101923042504313467.hoa' '-atoms' '/tmp/LTL9652577876418613606.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2024-06-01 03:10:36] [INFO ] Flatten gal took : 1042 ms
[2024-06-01 03:10:37] [INFO ] Flatten gal took : 1073 ms
[2024-06-01 03:10:37] [INFO ] Time to serialize gal into /tmp/LTL13574069410303056211.gal : 151 ms
[2024-06-01 03:10:37] [INFO ] Time to serialize properties into /tmp/LTL3075418099489617616.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13574069410303056211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3075418099489617616.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-06-01 03:10:54] [INFO ] Flatten gal took : 1143 ms
[2024-06-01 03:10:54] [INFO ] Applying decomposition
[2024-06-01 03:10:55] [INFO ] Flatten gal took : 1149 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14894582912792898102.txt' '-o' '/tmp/graph14894582912792898102.bin' '-w' '/tmp/graph14894582912792898102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14894582912792898102.bin' '-l' '-1' '-v' '-w' '/tmp/graph14894582912792898102.weights' '-q' '0' '-e' '0.001'
[2024-06-01 03:10:59] [INFO ] Decomposing Gal with order
[2024-06-01 03:11:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-01 03:29:21] [INFO ] Removed a total of 34166 redundant transitions.
[2024-06-01 03:29:22] [INFO ] Flatten gal took : 2969 ms
[2024-06-01 03:29:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 22542 labels/synchronizations in 12499 ms.
[2024-06-01 03:29:35] [INFO ] Time to serialize gal into /tmp/LTL9060277476045320761.gal : 378 ms
[2024-06-01 03:29:35] [INFO ] Time to serialize properties into /tmp/LTL7618750118972591901.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9060277476045320761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7618750118972591901.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7059814592046994612
[2024-06-01 03:29:51] [INFO ] Built C files in 326ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7059814592046994612
Running compilation step : cd /tmp/ltsmin7059814592046994612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7059814592046994612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7059814592046994612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 finished in 1604901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)||p0))&&F(p2)))'
Support contains 5 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 6814 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:30:24] [INFO ] Invariants computation overflowed in 23790 ms
[2024-06-01 03:30:31] [INFO ] Implicit Places using invariants in 30182 ms returned []
Implicit Place search using SMT only with invariants took 30187 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:30:50] [INFO ] Invariants computation overflowed in 19201 ms
[2024-06-01 03:30:56] [INFO ] Dead Transitions using invariants and state equation in 25100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62111 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ 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=[p2:(AND (NEQ s26625 0) (NEQ s16234 1)), p0:(OR (EQ s24759 0) (EQ s28854 1)), p1:(EQ s22861 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 3 reset in 22 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-02 finished in 62500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 180 are kept as prefixes of interest. Removing 32585 places using SCC suffix rule.31 ms
Discarding 32585 places :
Also discarding 40681 output transitions
Drop transitions removed 40681 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 129 transition count 172
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 129 transition count 172
Graph (complete) has 75 edges and 129 vertex of which 128 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 0 with 1 rules applied. Total rules applied 102 place count 128 transition count 171
Applied a total of 102 rules in 112 ms. Remains 128 /32765 variables (removed 32637) and now considering 171/40955 (removed 40784) transitions.
// Phase 1: matrix 171 rows 128 cols
[2024-06-01 03:30:56] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 03:30:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 03:30:56] [INFO ] Invariant cache hit.
[2024-06-01 03:30:57] [INFO ] Implicit Places using invariants and state equation in 232 ms returned [0, 2, 10, 18, 25, 27, 29, 31, 35, 39, 43, 45, 58, 62, 66, 68, 72, 74, 84, 97, 101, 105, 109, 111, 123, 125]
Discarding 26 places :
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Implicit Place search using SMT with State Equation took 317 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/32765 places, 150/40955 transitions.
Graph (complete) has 74 edges and 102 vertex of which 80 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 41 place count 60 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 48 place count 60 transition count 101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 57 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 57 transition count 99
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 65 place count 57 transition count 90
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 57 transition count 90
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 57 transition count 88
Applied a total of 69 rules in 22 ms. Remains 57 /102 variables (removed 45) and now considering 88/150 (removed 62) transitions.
// Phase 1: matrix 88 rows 57 cols
[2024-06-01 03:30:57] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 03:30:57] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 03:30:57] [INFO ] Invariant cache hit.
[2024-06-01 03:30:57] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/32765 places, 88/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 574 ms. Remains : 57/32765 places, 88/40955 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s53 1), p1:(OR (EQ s25 0) (EQ s35 1)), p2:(OR (EQ s42 0) (EQ s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-03 finished in 789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 4784 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:31:18] [INFO ] Invariants computation overflowed in 16170 ms
[2024-06-01 03:31:24] [INFO ] Implicit Places using invariants in 22244 ms returned []
Implicit Place search using SMT only with invariants took 22253 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:31:39] [INFO ] Invariants computation overflowed in 15009 ms
[2024-06-01 03:31:45] [INFO ] Dead Transitions using invariants and state equation in 20913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47971 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s21230 0) (EQ s18343 1)), p0:(OR (EQ s14101 0) (EQ s1735 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 33700 steps with 3088 reset in 10002 ms.
Product exploration timeout after 24470 steps with 2247 reset in 10003 ms.
Computed a total of 32765 stabilizing places and 40955 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32765 transition count 40955
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 400 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 954 resets, run finished after 3293 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 2604 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 165 resets, run finished after 2818 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 2621 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 2687 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 198 resets, run finished after 2576 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 71759 steps, run timeout after 48001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 71759 steps, saw 68536 distinct states, run finished after 48002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:33:45] [INFO ] Invariants computation overflowed in 23023 ms
[2024-06-01 03:34:10] [INFO ] After 7456ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2024-06-01 03:34:10] [INFO ] After 7482ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-06-01 03:34:10] [INFO ] After 25051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:1
[2024-06-01 03:34:35] [INFO ] After 7074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 03:34:35] [INFO ] After 7075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-06-01 03:34:35] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 48 are kept as prefixes of interest. Removing 32717 places using SCC suffix rule.17 ms
Discarding 32717 places :
Also discarding 40827 output transitions
Drop transitions removed 40827 transitions
Drop transitions removed 84 transitions
Reduce isomorphic transitions removed 84 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 112 rules applied. Total rules applied 113 place count 48 transition count 16
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 141 place count 20 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 141 place count 20 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 19 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 147 place count 15 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 15 transition count 11
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 161 place count 10 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 9 transition count 5
Ensure Unique test removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 165 place count 6 transition count 5
Applied a total of 165 rules in 64 ms. Remains 6 /32765 variables (removed 32759) and now considering 5/40955 (removed 40950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 6/32765 places, 5/40955 transitions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 302 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), true, (NOT p1)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 132 are kept as prefixes of interest. Removing 32633 places using SCC suffix rule.27 ms
Discarding 32633 places :
Also discarding 40753 output transitions
Drop transitions removed 40753 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 95 transition count 126
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 95 transition count 126
Graph (complete) has 55 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 74 place count 94 transition count 125
Applied a total of 74 rules in 73 ms. Remains 94 /32765 variables (removed 32671) and now considering 125/40955 (removed 40830) transitions.
// Phase 1: matrix 125 rows 94 cols
[2024-06-01 03:34:35] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:34:35] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 03:34:35] [INFO ] Invariant cache hit.
[2024-06-01 03:34:36] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [15, 17, 19, 21, 27, 29, 31, 33, 37, 46, 48, 53, 65, 69, 71, 75, 86, 90, 92]
Discarding 19 places :
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Implicit Place search using SMT with State Equation took 173 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/32765 places, 110/40955 transitions.
Graph (complete) has 54 edges and 75 vertex of which 59 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 41 transition count 75
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 46 place count 41 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 38 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 38 transition count 67
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 38 transition count 60
Applied a total of 61 rules in 6 ms. Remains 38 /75 variables (removed 37) and now considering 60/110 (removed 50) transitions.
// Phase 1: matrix 60 rows 38 cols
[2024-06-01 03:34:36] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 03:34:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 03:34:36] [INFO ] Invariant cache hit.
[2024-06-01 03:34:36] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/32765 places, 60/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 38/32765 places, 60/40955 transitions.
Computed a total of 38 stabilizing places and 60 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 60
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 354 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10001 steps, including 217 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-01 03:34:36] [INFO ] Invariant cache hit.
[2024-06-01 03:34:36] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 03:34:36] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 03:34:36] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-06-01 03:34:36] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 14 factoid took 750 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-05 finished in 220110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !p1)))'
Support contains 3 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 6817 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:35:04] [INFO ] Invariants computation overflowed in 20104 ms
[2024-06-01 03:35:11] [INFO ] Implicit Places using invariants in 26599 ms returned []
Implicit Place search using SMT only with invariants took 26603 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:35:35] [INFO ] Invariants computation overflowed in 24437 ms
[2024-06-01 03:35:42] [INFO ] Dead Transitions using invariants and state equation in 31109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64535 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 92 ms :[p1, p1, true]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s20722 0) (EQ s8297 1)), p0:(EQ s7936 1)], 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 3 steps with 0 reset in 8 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-06 finished in 64721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1 U X(p2)))))'
Support contains 5 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 7203 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:36:10] [INFO ] Invariants computation overflowed in 20909 ms
[2024-06-01 03:36:17] [INFO ] Implicit Places using invariants in 27441 ms returned []
Implicit Place search using SMT only with invariants took 27448 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:36:42] [INFO ] Invariants computation overflowed in 25224 ms
[2024-06-01 03:36:48] [INFO ] Dead Transitions using invariants and state equation in 31574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66232 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s20354 0) (EQ s3110 1)), p0:(AND (EQ s7761 1) (OR (EQ s20354 0) (EQ s3110 1))), p2:(OR (EQ s12161 0) (EQ s8664 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 7 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-07 finished in 66487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 74 are kept as prefixes of interest. Removing 32691 places using SCC suffix rule.30 ms
Discarding 32691 places :
Also discarding 40839 output transitions
Drop transitions removed 40839 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 52 transition count 71
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 52 transition count 71
Graph (complete) has 27 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 44 place count 51 transition count 70
Applied a total of 44 rules in 95 ms. Remains 51 /32765 variables (removed 32714) and now considering 70/40955 (removed 40885) transitions.
// Phase 1: matrix 70 rows 51 cols
[2024-06-01 03:36:48] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 03:36:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 03:36:49] [INFO ] Invariant cache hit.
[2024-06-01 03:36:49] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [0, 6, 10, 20, 30, 32, 34]
Discarding 7 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT with State Equation took 133 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/32765 places, 64/40955 transitions.
Graph (complete) has 26 edges and 44 vertex of which 38 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
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 32 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 32 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 32 transition count 48
Applied a total of 17 rules in 8 ms. Remains 32 /44 variables (removed 12) and now considering 48/64 (removed 16) transitions.
// Phase 1: matrix 48 rows 32 cols
[2024-06-01 03:36:49] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:36:49] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 03:36:49] [INFO ] Invariant cache hit.
[2024-06-01 03:36:49] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/32765 places, 48/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 327 ms. Remains : 32/32765 places, 48/40955 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s28 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 645 steps with 21 reset in 2 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-08 finished in 461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&((p2 U p3)||G(p4)||p1))))'
Support contains 10 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Applied a total of 0 rules in 6178 ms. Remains 32765 /32765 variables (removed 0) and now considering 40955/40955 (removed 0) transitions.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:37:17] [INFO ] Invariants computation overflowed in 22114 ms
[2024-06-01 03:37:24] [INFO ] Implicit Places using invariants in 28906 ms returned []
Implicit Place search using SMT only with invariants took 28908 ms to find 0 implicit places.
// Phase 1: matrix 40955 rows 32765 cols
[2024-06-01 03:37:44] [INFO ] Invariants computation overflowed in 20171 ms
[2024-06-01 03:37:51] [INFO ] Dead Transitions using invariants and state equation in 26896 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61989 ms. Remains : 32765/32765 places, 40955/40955 transitions.
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4))), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1) (AND (NOT p0) p4) (AND (NOT p0) p3)), (NOT p3), (OR (AND p0 p3 (NOT p4)) (AND p0 p1 (NOT p4)) (AND p0 p2 (NOT p4))), (OR (AND p1 p2 (NOT p3) (NOT p4)) (AND p0 p1 (NOT p3) (NOT p4)))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p3 p2 p4), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p3 p2 p4), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p4)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p4), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 p4), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p3 (NOT p0)) (AND p2 (NOT p0)) (AND p4 (NOT p0))), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p4) p0) (AND p3 (NOT p4) p0) (AND p2 (NOT p4) p0)), acceptance={} source=4 dest: 1}, { cond=(OR (AND p1 p4) (AND p3 p4) (AND p2 p4)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3) (NOT p2) (NOT p4) p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3) p2 (NOT p4)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2) p4), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2 p4), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s24445 0) (EQ s7472 1)), p3:(OR (EQ s8294 0) (EQ s19710 1)), p2:(OR (EQ s5854 0) (EQ s14912 1)), p4:(OR (EQ s31112 0) (EQ s24154 1)), p0:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 11 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-10 finished in 62537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (p0||F(p1)))))'
Support contains 3 out of 32765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 124 are kept as prefixes of interest. Removing 32641 places using SCC suffix rule.25 ms
Discarding 32641 places :
Also discarding 40767 output transitions
Drop transitions removed 40767 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 90 transition count 121
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 90 transition count 121
Applied a total of 67 rules in 102 ms. Remains 90 /32765 variables (removed 32675) and now considering 121/40955 (removed 40834) transitions.
// Phase 1: matrix 121 rows 90 cols
[2024-06-01 03:37:52] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 03:37:52] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 03:37:52] [INFO ] Invariant cache hit.
[2024-06-01 03:37:52] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [0, 6, 8, 10, 12, 16, 25, 27, 29, 33, 35, 37, 39, 45, 55, 57, 63, 65, 67, 69, 73, 85, 87]
Discarding 23 places :
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Implicit Place search using SMT with State Equation took 273 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/32765 places, 98/40955 transitions.
Graph (complete) has 54 edges and 67 vertex of which 46 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 41 place count 26 transition count 56
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 54 place count 26 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 25 transition count 42
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 25 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 61 place count 25 transition count 37
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 63 place count 24 transition count 37
Applied a total of 63 rules in 15 ms. Remains 24 /67 variables (removed 43) and now considering 37/98 (removed 61) transitions.
// Phase 1: matrix 37 rows 24 cols
[2024-06-01 03:37:52] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:37:52] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 03:37:52] [INFO ] Invariant cache hit.
[2024-06-01 03:37:52] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/32765 places, 37/40955 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 493 ms. Remains : 24/32765 places, 37/40955 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s22 1), p1:(OR (EQ s14 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4426 reset in 425 ms.
Product exploration explored 100000 steps with 4420 reset in 453 ms.
Computed a total of 24 stabilizing places and 37 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 37
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-13 finished in 1625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p0&&G(F(p1))))))'
Found a Lengthening insensitive property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 4 out of 32765 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32765/32765 places, 40955/40955 transitions.
Graph (complete) has 16382 edges and 32765 vertex of which 143 are kept as prefixes of interest. Removing 32622 places using SCC suffix rule.27 ms
Discarding 32622 places :
Also discarding 40738 output transitions
Drop transitions removed 40738 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 103 transition count 137
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 103 transition count 137
Graph (complete) has 59 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 80 place count 102 transition count 136
Applied a total of 80 rules in 74 ms. Remains 102 /32765 variables (removed 32663) and now considering 136/40955 (removed 40819) transitions.
// Phase 1: matrix 136 rows 102 cols
[2024-06-01 03:37:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:37:53] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 03:37:53] [INFO ] Invariant cache hit.
[2024-06-01 03:37:54] [INFO ] Implicit Places using invariants and state equation in 199 ms returned [0, 2, 4, 6, 8, 10, 12, 18, 31, 33, 35, 41, 43, 45, 54, 58, 62, 66, 68, 72, 82]
Discarding 21 places :
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Implicit Place search using SMT with State Equation took 289 ms to find 21 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 81/32765 places, 117/40955 transitions.
Graph (complete) has 58 edges and 81 vertex of which 63 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 45 transition count 81
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 45 place count 45 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 43 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 43 transition count 71
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 43 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 43 transition count 70
Applied a total of 53 rules in 14 ms. Remains 43 /81 variables (removed 38) and now considering 70/117 (removed 47) transitions.
// Phase 1: matrix 70 rows 43 cols
[2024-06-01 03:37:54] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 03:37:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 03:37:54] [INFO ] Invariant cache hit.
[2024-06-01 03:37:54] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 43/32765 places, 70/40955 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 486 ms. Remains : 43/32765 places, 70/40955 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s39 0) (EQ s27 1)), p1:(OR (EQ s15 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33281 reset in 209 ms.
Product exploration explored 100000 steps with 33446 reset in 228 ms.
Computed a total of 43 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 70
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 204 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 2570 steps, including 49 resets, run visited all 1 properties in 6 ms. (steps per millisecond=428 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 70/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-01 03:37:55] [INFO ] Invariant cache hit.
[2024-06-01 03:37:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 03:37:55] [INFO ] Invariant cache hit.
[2024-06-01 03:37:55] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-01 03:37:55] [INFO ] Invariant cache hit.
[2024-06-01 03:37:55] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 43/43 places, 70/70 transitions.
Computed a total of 43 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 70
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 401 steps, including 7 resets, run visited all 1 properties in 2 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 13034 steps with 360 reset in 35 ms.
Treatment of property ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 finished in 3270 ms.
FORMULA ViralEpidemic-PT-S02D1C1A12-LTLCardinality-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 03:37:58] [INFO ] Flatten gal took : 1374 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 2230627 ms.

BK_STOP 1717213079841

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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