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-171701123200232.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-S04D1C1A06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701123200232
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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 4.3K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 07:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 07:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 06:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 20M 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-S04D1C1A06-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717223981946

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-S04D1C1A06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-01 06:39:45] [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 06:39:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:39:47] [INFO ] Load time of PNML (sax parser for PT used): 2061 ms
[2024-06-01 06:39:47] [INFO ] Transformed 32767 places.
[2024-06-01 06:39:47] [INFO ] Transformed 49149 transitions.
[2024-06-01 06:39:47] [INFO ] Found NUPN structural information;
[2024-06-01 06:39:47] [INFO ] Parsed PT model containing 32767 places and 49149 transitions and 114681 arcs in 2487 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 4969 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:40:14] [INFO ] Invariants computation overflowed in 21339 ms
[2024-06-01 06:40:21] [INFO ] Implicit Places using invariants in 28546 ms returned []
Implicit Place search using SMT only with invariants took 28587 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:40:46] [INFO ] Invariants computation overflowed in 24703 ms
[2024-06-01 06:40:53] [INFO ] Dead Transitions using invariants and state equation in 31490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65064 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Support contains 30 out of 32767 places after structural reductions.
[2024-06-01 06:40:56] [INFO ] Flatten gal took : 2139 ms
[2024-06-01 06:40:58] [INFO ] Flatten gal took : 1879 ms
[2024-06-01 06:41:01] [INFO ] Input system was already deterministic with 49149 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 3524 ms. (steps per millisecond=2 ) properties (out of 17) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2155 ms. (steps per millisecond=4 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2102 ms. (steps per millisecond=4 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2010 ms. (steps per millisecond=4 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2042 ms. (steps per millisecond=4 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2091 ms. (steps per millisecond=4 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1974 ms. (steps per millisecond=5 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2085 ms. (steps per millisecond=4 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1990 ms. (steps per millisecond=5 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2095 ms. (steps per millisecond=4 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:41:39] [INFO ] Invariants computation overflowed in 15983 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 06:42:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-01 06:42:05] [INFO ] After 25190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 19 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 161 are kept as prefixes of interest. Removing 32606 places using SCC suffix rule.77 ms
Discarding 32606 places :
Also discarding 48733 output transitions
Drop transitions removed 48733 transitions
Drop transitions removed 272 transitions
Reduce isomorphic transitions removed 272 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 319 rules applied. Total rules applied 320 place count 161 transition count 97
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 367 place count 114 transition count 97
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 367 place count 114 transition count 86
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 389 place count 103 transition count 86
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 424 place count 68 transition count 51
Iterating global reduction 2 with 35 rules applied. Total rules applied 459 place count 68 transition count 51
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 2 with 36 rules applied. Total rules applied 495 place count 50 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 496 place count 49 transition count 32
Ensure Unique test removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 504 place count 41 transition count 32
Applied a total of 504 rules in 355 ms. Remains 41 /32767 variables (removed 32726) and now considering 32/49149 (removed 49117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 41/32767 places, 32/49149 transitions.
Finished random walk after 40 steps, including 1 resets, run visited all 9 properties in 4 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
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' '!(X(F(p0)))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2826 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:42:29] [INFO ] Invariants computation overflowed in 20503 ms
[2024-06-01 06:42:35] [INFO ] Implicit Places using invariants in 26863 ms returned []
Implicit Place search using SMT only with invariants took 26869 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:42:58] [INFO ] Invariants computation overflowed in 22866 ms
[2024-06-01 06:43:05] [INFO ] Dead Transitions using invariants and state equation in 29374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59074 ms. Remains : 32767/32767 places, 49149/49149 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 309 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s4919 0) (EQ s1772 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][false, false]]
Product exploration timeout after 15810 steps with 7905 reset in 10002 ms.
Product exploration timeout after 15690 steps with 7845 reset in 10009 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 25 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01 finished in 91175 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(F(p0)))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2167 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:44:02] [INFO ] Invariants computation overflowed in 22669 ms
[2024-06-01 06:44:08] [INFO ] Implicit Places using invariants in 29175 ms returned []
Implicit Place search using SMT only with invariants took 29181 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:44:24] [INFO ] Invariants computation overflowed in 15978 ms
[2024-06-01 06:44:30] [INFO ] Dead Transitions using invariants and state equation in 21935 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53291 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5067 0) (EQ s9100 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][false, false]]
Stuttering criterion allowed to conclude after 517 steps with 0 reset in 121 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02 finished in 53591 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(X(X(F((X(X(G(p1)))&&p0))))))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 4151 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:44:52] [INFO ] Invariants computation overflowed in 17790 ms
[2024-06-01 06:44:58] [INFO ] Implicit Places using invariants in 23665 ms returned []
Implicit Place search using SMT only with invariants took 23667 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:45:16] [INFO ] Invariants computation overflowed in 18085 ms
[2024-06-01 06:45:22] [INFO ] Dead Transitions using invariants and state equation in 24005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51827 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 5}, { cond=p0, acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s18900 0) (EQ s17441 1)), p1:(AND (EQ s21786 0) (EQ s28045 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, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 615 steps with 0 reset in 239 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 finished in 52527 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((G(p0)||G(p1))))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 60 are kept as prefixes of interest. Removing 32707 places using SCC suffix rule.75 ms
Discarding 32707 places :
Also discarding 49025 output transitions
Drop transitions removed 49025 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 113
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 32 place count 38 transition count 56
Iterating global reduction 1 with 21 rules applied. Total rules applied 53 place count 38 transition count 56
Graph (complete) has 23 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 37 transition count 55
Applied a total of 54 rules in 228 ms. Remains 37 /32767 variables (removed 32730) and now considering 55/49149 (removed 49094) transitions.
// Phase 1: matrix 55 rows 37 cols
[2024-06-01 06:45:23] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:45:23] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 06:45:23] [INFO ] Invariant cache hit.
[2024-06-01 06:45:23] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-06-01 06:45:23] [INFO ] Redundant transitions in 36 ms returned [12, 19, 22, 24, 27, 30, 34, 38, 42]
Found 9 redundant transitions using SMT.
Drop transitions removed 9 transitions
Redundant transitions reduction (with SMT) removed 9 transitions.
// Phase 1: matrix 46 rows 37 cols
[2024-06-01 06:45:23] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:45:23] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/32767 places, 46/49149 transitions.
Graph (complete) has 22 edges and 37 vertex of which 28 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Applied a total of 1 rules in 4 ms. Remains 28 /37 variables (removed 9) and now considering 37/46 (removed 9) transitions.
// Phase 1: matrix 37 rows 28 cols
[2024-06-01 06:45:23] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:45:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 06:45:23] [INFO ] Invariant cache hit.
[2024-06-01 06:45:23] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/32767 places, 37/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 625 ms. Remains : 28/32767 places, 37/49149 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 0) (EQ s24 1)), p1:(OR (EQ s24 0) (EQ s12 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4198 reset in 538 ms.
Product exploration explored 100000 steps with 4199 reset in 380 ms.
Computed a total of 28 stabilizing places and 37 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 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 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 230 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 288 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-01 06:45:25] [INFO ] Invariant cache hit.
[2024-06-01 06:45:25] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-06-01 06:45:25] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 338 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 finished in 2760 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((X(p0)||F(p1))))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2448 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:45:42] [INFO ] Invariants computation overflowed in 13752 ms
[2024-06-01 06:45:48] [INFO ] Implicit Places using invariants in 19858 ms returned []
Implicit Place search using SMT only with invariants took 19859 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:46:09] [INFO ] Invariants computation overflowed in 21452 ms
[2024-06-01 06:46:15] [INFO ] Dead Transitions using invariants and state equation in 27264 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49575 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s761 1), p0:(AND (EQ s21044 0) (OR (EQ s25604 0) (EQ s13702 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, null][false, false, false, false]]
Product exploration timeout after 16980 steps with 8490 reset in 10005 ms.
Product exploration timeout after 16590 steps with 8295 reset in 10001 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
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 p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 finished in 80851 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((p0||F(p1)))))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2359 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:47:07] [INFO ] Invariants computation overflowed in 17894 ms
[2024-06-01 06:47:13] [INFO ] Implicit Places using invariants in 23828 ms returned []
Implicit Place search using SMT only with invariants took 23837 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:47:32] [INFO ] Invariants computation overflowed in 19069 ms
[2024-06-01 06:47:37] [INFO ] Dead Transitions using invariants and state equation in 24854 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51052 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s11757 0) (NEQ s11994 1)), p1:(OR (EQ s18546 0) (EQ s8484 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 40090 steps with 64 reset in 10001 ms.
Product exploration timeout after 32850 steps with 51 reset in 10001 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 2586 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1893 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1899 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 38411 steps, run timeout after 18010 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 38411 steps, saw 37504 distinct states, run finished after 18015 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:53:29] [INFO ] Invariants computation overflowed in 20659 ms
[2024-06-01 06:53:54] [INFO ] After 10596ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 06:53:54] [INFO ] After 10661ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-06-01 06:53:54] [INFO ] After 25100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 37 are kept as prefixes of interest. Removing 32730 places using SCC suffix rule.17 ms
Discarding 32730 places :
Also discarding 49056 output transitions
Drop transitions removed 49056 transitions
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 37 transition count 20
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 87 place count 24 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 87 place count 24 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 22 transition count 18
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 14 transition count 10
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 14 transition count 10
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 2 with 6 rules applied. Total rules applied 113 place count 11 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 10 transition count 6
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 8 transition count 6
Applied a total of 116 rules in 79 ms. Remains 8 /32767 variables (removed 32759) and now considering 6/49149 (removed 49143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 8/32767 places, 6/49149 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 374 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 98 are kept as prefixes of interest. Removing 32669 places using SCC suffix rule.33 ms
Discarding 32669 places :
Also discarding 48941 output transitions
Drop transitions removed 48941 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 97 transition count 175
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 70 place count 60 transition count 83
Iterating global reduction 1 with 37 rules applied. Total rules applied 107 place count 60 transition count 83
Graph (complete) has 33 edges and 60 vertex of which 58 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 58 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 58 transition count 80
Applied a total of 109 rules in 172 ms. Remains 58 /32767 variables (removed 32709) and now considering 80/49149 (removed 49069) transitions.
// Phase 1: matrix 80 rows 58 cols
[2024-06-01 06:53:55] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:53:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 06:53:55] [INFO ] Invariant cache hit.
[2024-06-01 06:53:55] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-01 06:53:55] [INFO ] Redundant transitions in 25 ms returned [11, 21, 25, 44, 53, 64]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
// Phase 1: matrix 74 rows 58 cols
[2024-06-01 06:53:55] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:53:55] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/32767 places, 74/49149 transitions.
Graph (complete) has 31 edges and 58 vertex of which 52 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Applied a total of 1 rules in 4 ms. Remains 52 /58 variables (removed 6) and now considering 68/74 (removed 6) transitions.
// Phase 1: matrix 68 rows 52 cols
[2024-06-01 06:53:55] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:53:55] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 06:53:55] [INFO ] Invariant cache hit.
[2024-06-01 06:53:55] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/32767 places, 68/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 606 ms. Remains : 52/32767 places, 68/49149 transitions.
Computed a total of 52 stabilizing places and 68 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 68
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 79 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering criterion allowed to conclude after 8001 steps with 192 reset in 23 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 finished in 430054 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||X(p2)))))))'
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2732 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:54:17] [INFO ] Invariants computation overflowed in 18057 ms
[2024-06-01 06:54:23] [INFO ] Implicit Places using invariants in 24104 ms returned []
Implicit Place search using SMT only with invariants took 24105 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-01 06:54:46] [INFO ] Invariants computation overflowed in 22582 ms
[2024-06-01 06:54:52] [INFO ] Dead Transitions using invariants and state equation in 28649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55492 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s8836 0), p1:(AND (EQ s2713 0) (EQ s5516 1)), p2:(AND (EQ s1196 0) (EQ s20206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 481 steps with 0 reset in 130 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-09 finished in 55920 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(p0)||G(p1)))'
Support contains 3 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 87 are kept as prefixes of interest. Removing 32680 places using SCC suffix rule.25 ms
Discarding 32680 places :
Also discarding 48966 output transitions
Drop transitions removed 48966 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 86 transition count 164
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 50 place count 55 transition count 81
Iterating global reduction 1 with 31 rules applied. Total rules applied 81 place count 55 transition count 81
Graph (complete) has 33 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 54 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 54 transition count 79
Applied a total of 83 rules in 92 ms. Remains 54 /32767 variables (removed 32713) and now considering 79/49149 (removed 49070) transitions.
// Phase 1: matrix 79 rows 54 cols
[2024-06-01 06:54:52] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:54:53] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 06:54:53] [INFO ] Invariant cache hit.
[2024-06-01 06:54:53] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-06-01 06:54:53] [INFO ] Redundant transitions in 49 ms returned [9, 19, 21, 24, 30, 34, 41, 46, 50, 74, 76]
Found 11 redundant transitions using SMT.
Drop transitions removed 11 transitions
Redundant transitions reduction (with SMT) removed 11 transitions.
// Phase 1: matrix 68 rows 54 cols
[2024-06-01 06:54:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:54:53] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/32767 places, 68/49149 transitions.
Graph (complete) has 32 edges and 54 vertex of which 43 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Applied a total of 1 rules in 3 ms. Remains 43 /54 variables (removed 11) and now considering 57/68 (removed 11) transitions.
// Phase 1: matrix 57 rows 43 cols
[2024-06-01 06:54:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:54:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 06:54:53] [INFO ] Invariant cache hit.
[2024-06-01 06:54:53] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/32767 places, 57/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 478 ms. Remains : 43/32767 places, 57/49149 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s23 0) (EQ s41 1)), p0:(EQ s11 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 92 steps with 2 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-13 finished in 686 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(p0))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 61 are kept as prefixes of interest. Removing 32706 places using SCC suffix rule.27 ms
Discarding 32706 places :
Also discarding 49024 output transitions
Drop transitions removed 49024 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 60 transition count 110
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 40 place count 35 transition count 47
Iterating global reduction 1 with 25 rules applied. Total rules applied 65 place count 35 transition count 47
Applied a total of 65 rules in 81 ms. Remains 35 /32767 variables (removed 32732) and now considering 47/49149 (removed 49102) transitions.
// Phase 1: matrix 47 rows 35 cols
[2024-06-01 06:54:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:54:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 06:54:53] [INFO ] Invariant cache hit.
[2024-06-01 06:54:53] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-06-01 06:54:53] [INFO ] Redundant transitions in 22 ms returned [10, 14, 40]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
// Phase 1: matrix 44 rows 35 cols
[2024-06-01 06:54:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:54:53] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/32767 places, 44/49149 transitions.
Graph (complete) has 20 edges and 35 vertex of which 32 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 2 ms. Remains 32 /35 variables (removed 3) and now considering 41/44 (removed 3) transitions.
// Phase 1: matrix 41 rows 32 cols
[2024-06-01 06:54:53] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:54:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 06:54:53] [INFO ] Invariant cache hit.
[2024-06-01 06:54:53] [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 : 32/32767 places, 41/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 365 ms. Remains : 32/32767 places, 41/49149 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s13 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14 finished in 456 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(p0))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 62 are kept as prefixes of interest. Removing 32705 places using SCC suffix rule.30 ms
Discarding 32705 places :
Also discarding 49019 output transitions
Drop transitions removed 49019 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 61 transition count 121
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 34 place count 36 transition count 53
Iterating global reduction 1 with 25 rules applied. Total rules applied 59 place count 36 transition count 53
Applied a total of 59 rules in 85 ms. Remains 36 /32767 variables (removed 32731) and now considering 53/49149 (removed 49096) transitions.
// Phase 1: matrix 53 rows 36 cols
[2024-06-01 06:54:54] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:54:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 06:54:54] [INFO ] Invariant cache hit.
[2024-06-01 06:54:54] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-06-01 06:54:54] [INFO ] Redundant transitions in 26 ms returned [7, 11, 15, 19, 23, 32]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
// Phase 1: matrix 47 rows 36 cols
[2024-06-01 06:54:54] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 06:54:54] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/32767 places, 47/49149 transitions.
Graph (complete) has 21 edges and 36 vertex of which 30 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Applied a total of 1 rules in 1 ms. Remains 30 /36 variables (removed 6) and now considering 41/47 (removed 6) transitions.
// Phase 1: matrix 41 rows 30 cols
[2024-06-01 06:54:54] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 06:54:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 06:54:54] [INFO ] Invariant cache hit.
[2024-06-01 06:54:54] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/32767 places, 41/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 395 ms. Remains : 30/32767 places, 41/49149 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s15 0) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15 finished in 478 ms.
All properties solved by simple procedures.
Total runtime 909180 ms.

BK_STOP 1717224895855

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

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