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.r175-smll-171636279900088.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 Echo-PT-d05r03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636279900088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 04:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 04:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M May 18 16:42 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 Echo-PT-d05r03-LTLFireability-00
FORMULA_NAME Echo-PT-d05r03-LTLFireability-01
FORMULA_NAME Echo-PT-d05r03-LTLFireability-02
FORMULA_NAME Echo-PT-d05r03-LTLFireability-03
FORMULA_NAME Echo-PT-d05r03-LTLFireability-04
FORMULA_NAME Echo-PT-d05r03-LTLFireability-05
FORMULA_NAME Echo-PT-d05r03-LTLFireability-06
FORMULA_NAME Echo-PT-d05r03-LTLFireability-07
FORMULA_NAME Echo-PT-d05r03-LTLFireability-08
FORMULA_NAME Echo-PT-d05r03-LTLFireability-09
FORMULA_NAME Echo-PT-d05r03-LTLFireability-10
FORMULA_NAME Echo-PT-d05r03-LTLFireability-11
FORMULA_NAME Echo-PT-d05r03-LTLFireability-12
FORMULA_NAME Echo-PT-d05r03-LTLFireability-13
FORMULA_NAME Echo-PT-d05r03-LTLFireability-14
FORMULA_NAME Echo-PT-d05r03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716537064831

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d05r03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 07:51:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 07:51:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:51:09] [INFO ] Load time of PNML (sax parser for PT used): 693 ms
[2024-05-24 07:51:09] [INFO ] Transformed 3717 places.
[2024-05-24 07:51:09] [INFO ] Transformed 3222 transitions.
[2024-05-24 07:51:09] [INFO ] Found NUPN structural information;
[2024-05-24 07:51:09] [INFO ] Parsed PT model containing 3717 places and 3222 transitions and 28404 arcs in 957 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Echo-PT-d05r03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d05r03-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 116 out of 3717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3717/3717 places, 3222/3222 transitions.
Reduce places removed 243 places and 0 transitions.
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 3474 transition count 3222
Applied a total of 243 rules in 524 ms. Remains 3474 /3717 variables (removed 243) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:51:22] [INFO ] Invariants computation overflowed in 12740 ms
[2024-05-24 07:51:24] [INFO ] Implicit Places using invariants in 14086 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:51:36] [INFO ] Invariants computation overflowed in 12215 ms
[2024-05-24 07:51:38] [INFO ] Implicit Places using invariants and state equation in 13811 ms returned []
Implicit Place search using SMT with State Equation took 27946 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:51:50] [INFO ] Invariants computation overflowed in 12543 ms
[2024-05-24 07:51:51] [INFO ] Dead Transitions using invariants and state equation in 13268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3474/3717 places, 3222/3222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41751 ms. Remains : 3474/3717 places, 3222/3222 transitions.
Support contains 116 out of 3474 places after structural reductions.
[2024-05-24 07:51:52] [INFO ] Flatten gal took : 642 ms
[2024-05-24 07:51:52] [INFO ] Flatten gal took : 414 ms
[2024-05-24 07:51:53] [INFO ] Input system was already deterministic with 3222 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 1114 ms. (steps per millisecond=8 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:52:08] [INFO ] Invariants computation overflowed in 13202 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:634)
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-05-24 07:52:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 07:52:33] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 3474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3455 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.50 ms
Discarding 19 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 3455 transition count 3213
Applied a total of 9 rules in 686 ms. Remains 3455 /3474 variables (removed 19) and now considering 3213/3222 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 3455/3474 places, 3213/3222 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 985 ms. (steps per millisecond=10 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3213 rows 3455 cols
[2024-05-24 07:52:50] [INFO ] Invariants computation overflowed in 14504 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:634)
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-05-24 07:53:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 07:53:15] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 3455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3455/3455 places, 3213/3213 transitions.
Graph (complete) has 15694 edges and 3455 vertex of which 3454 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3454 transition count 3212
Applied a total of 2 rules in 437 ms. Remains 3454 /3455 variables (removed 1) and now considering 3212/3213 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 3454/3455 places, 3212/3213 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3212 rows 3454 cols
[2024-05-24 07:53:30] [INFO ] Invariants computation overflowed in 13862 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:634)
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-05-24 07:53:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 07:53:55] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 3454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3454/3454 places, 3212/3212 transitions.
Applied a total of 0 rules in 229 ms. Remains 3454 /3454 variables (removed 0) and now considering 3212/3212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 3454/3454 places, 3212/3212 transitions.
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
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(p0) U (p1||X(!p2))))'
Support contains 18 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 258 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:54:09] [INFO ] Invariants computation overflowed in 12936 ms
[2024-05-24 07:54:10] [INFO ] Implicit Places using invariants in 13805 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:54:22] [INFO ] Invariants computation overflowed in 12263 ms
[2024-05-24 07:54:23] [INFO ] Implicit Places using invariants and state equation in 13382 ms returned []
Implicit Place search using SMT with State Equation took 27190 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:54:36] [INFO ] Invariants computation overflowed in 12412 ms
[2024-05-24 07:54:36] [INFO ] Dead Transitions using invariants and state equation in 13313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40766 ms. Remains : 3474/3474 places, 3222/3222 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 376 ms :[(AND (NOT p1) p2), p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s253 1) (EQ s254 1) (EQ s255 1) (EQ s256 1) (EQ s258 1) (EQ s259 1) (EQ s260 1) (EQ s261 1) (EQ s1910 1)), p0:(AND (EQ s1074 1) (EQ s2928 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]]
Product exploration explored 100000 steps with 50000 reset in 3174 ms.
Product exploration explored 100000 steps with 50000 reset in 2646 ms.
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 26 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d05r03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-01 finished in 50162 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)||(X(F((p0||X(F(p2)))))&&p1))))'
Support contains 4 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 156 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:54:59] [INFO ] Invariants computation overflowed in 12963 ms
[2024-05-24 07:55:00] [INFO ] Implicit Places using invariants in 13791 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:55:12] [INFO ] Invariants computation overflowed in 12390 ms
[2024-05-24 07:55:13] [INFO ] Implicit Places using invariants and state equation in 13656 ms returned []
Implicit Place search using SMT with State Equation took 27451 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:55:26] [INFO ] Invariants computation overflowed in 12423 ms
[2024-05-24 07:55:26] [INFO ] Dead Transitions using invariants and state equation in 13156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40765 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1474 1) (EQ s2580 1)), p0:(AND (EQ s614 1) (EQ s2802 1)), p2:(OR (EQ s1474 0) (EQ s2580 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 486 steps with 0 reset in 33 ms.
FORMULA Echo-PT-d05r03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-02 finished in 41010 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(G(p0))))'
Support contains 2 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 259 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:55:39] [INFO ] Invariants computation overflowed in 12018 ms
[2024-05-24 07:55:40] [INFO ] Implicit Places using invariants in 12666 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:55:51] [INFO ] Invariants computation overflowed in 11751 ms
[2024-05-24 07:55:52] [INFO ] Implicit Places using invariants and state equation in 12813 ms returned []
Implicit Place search using SMT with State Equation took 25482 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:56:05] [INFO ] Invariants computation overflowed in 12067 ms
[2024-05-24 07:56:05] [INFO ] Dead Transitions using invariants and state equation in 12698 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38442 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s334 1) (NEQ s2754 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 6 ms.
FORMULA Echo-PT-d05r03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-04 finished in 38597 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' '!((p0 U (X(p1)&&(!p2||F(p3)))))'
Support contains 19 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 149 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:56:18] [INFO ] Invariants computation overflowed in 12368 ms
[2024-05-24 07:56:19] [INFO ] Implicit Places using invariants in 13181 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:56:31] [INFO ] Invariants computation overflowed in 12420 ms
[2024-05-24 07:56:32] [INFO ] Implicit Places using invariants and state equation in 13593 ms returned []
Implicit Place search using SMT with State Equation took 26777 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:56:44] [INFO ] Invariants computation overflowed in 12089 ms
[2024-05-24 07:56:45] [INFO ] Dead Transitions using invariants and state equation in 12906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39834 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p1) (AND p2 (NOT p3))), (NOT p1), (NOT p3), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), true, (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 2}], [{ cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (NOT (AND (EQ s778 1) (EQ s2830 1))) (AND (EQ s77 1) (EQ s78 1) (EQ s79 1) (EQ s80 1) (EQ s82 1) (EQ s83 1) (EQ s84 1) (EQ s85 1) (EQ s1717 1))), p...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 144 steps with 0 reset in 8 ms.
FORMULA Echo-PT-d05r03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-05 finished in 40208 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((X(G(X(X(p0))))||X(F(!(p0 U p1)))))))'
Support contains 4 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.17 ms
Discarding 11 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 321 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 07:56:58] [INFO ] Invariants computation overflowed in 12216 ms
[2024-05-24 07:56:59] [INFO ] Implicit Places using invariants in 13032 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 07:57:11] [INFO ] Invariants computation overflowed in 12081 ms
[2024-05-24 07:57:12] [INFO ] Implicit Places using invariants and state equation in 13365 ms returned []
Implicit Place search using SMT with State Equation took 26400 ms to find 0 implicit places.
[2024-05-24 07:57:13] [INFO ] Redundant transitions in 256 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 07:57:25] [INFO ] Invariants computation overflowed in 12024 ms
[2024-05-24 07:57:25] [INFO ] Dead Transitions using invariants and state equation in 12663 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39650 ms. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s247 1) (EQ s2730 1)), p1:(AND (EQ s2690 1) (EQ s3432 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 259 reset in 4556 ms.
Product exploration explored 100000 steps with 253 reset in 4659 ms.
Computed a total of 3462 stabilizing places and 3220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3462 transition count 3220
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) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d05r03-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-07 finished in 51481 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((X((G(p1)||p0))||F(p2)))))'
Support contains 9 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.20 ms
Discarding 11 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 380 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 07:57:50] [INFO ] Invariants computation overflowed in 12260 ms
[2024-05-24 07:57:51] [INFO ] Implicit Places using invariants in 13104 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 07:58:03] [INFO ] Invariants computation overflowed in 12143 ms
[2024-05-24 07:58:04] [INFO ] Implicit Places using invariants and state equation in 13421 ms returned []
Implicit Place search using SMT with State Equation took 26527 ms to find 0 implicit places.
[2024-05-24 07:58:04] [INFO ] Redundant transitions in 230 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 07:58:17] [INFO ] Invariants computation overflowed in 12672 ms
[2024-05-24 07:58:17] [INFO ] Dead Transitions using invariants and state equation in 13306 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40455 ms. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s341 1) (EQ s2745 1)), p2:(AND (EQ s926 1) (EQ s2200 1) (EQ s2211 1) (EQ s2233 1) (EQ s2244 1) (EQ s2255 1) (EQ s2266 1)), p0:(OR (EQ s341 0) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 221 reset in 4435 ms.
Product exploration explored 100000 steps with 222 reset in 4684 ms.
Computed a total of 3462 stabilizing places and 3220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3462 transition count 3220
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 22 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d05r03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-08 finished in 52329 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) U p1))'
Support contains 8 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.10 ms
Discarding 11 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 211 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 07:58:41] [INFO ] Invariants computation overflowed in 11781 ms
[2024-05-24 07:58:42] [INFO ] Implicit Places using invariants in 12441 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 07:58:54] [INFO ] Invariants computation overflowed in 12100 ms
[2024-05-24 07:58:55] [INFO ] Implicit Places using invariants and state equation in 13185 ms returned []
Implicit Place search using SMT with State Equation took 25628 ms to find 0 implicit places.
[2024-05-24 07:58:55] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 07:59:07] [INFO ] Invariants computation overflowed in 11656 ms
[2024-05-24 07:59:08] [INFO ] Dead Transitions using invariants and state equation in 12481 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38461 ms. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, p0]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s843 1) (EQ s845 1) (EQ s846 1) (EQ s847 1) (EQ s848 1) (EQ s2557 1)), p0:(AND (EQ s293 1) (EQ s2736 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1518 steps with 3 reset in 64 ms.
FORMULA Echo-PT-d05r03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-10 finished in 38633 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' '!((p0 U X((G((X(p2)&&p1)) U p2))))'
Support contains 4 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 153 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:59:21] [INFO ] Invariants computation overflowed in 12817 ms
[2024-05-24 07:59:22] [INFO ] Implicit Places using invariants in 13656 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:59:35] [INFO ] Invariants computation overflowed in 13324 ms
[2024-05-24 07:59:36] [INFO ] Implicit Places using invariants and state equation in 14660 ms returned []
Implicit Place search using SMT with State Equation took 28327 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 07:59:49] [INFO ] Invariants computation overflowed in 12447 ms
[2024-05-24 07:59:50] [INFO ] Dead Transitions using invariants and state equation in 13119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41600 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s30 1) (EQ s2710 1)), p2:(AND (EQ s790 1) (EQ s2832 1)), p1:(AND (EQ s790 1) (EQ s2832 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d05r03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-11 finished in 41812 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))||G(p1)||(X(G(p2)) U p3)))'
Support contains 16 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 161 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 08:00:02] [INFO ] Invariants computation overflowed in 12328 ms
[2024-05-24 08:00:03] [INFO ] Implicit Places using invariants in 13066 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 08:00:16] [INFO ] Invariants computation overflowed in 12596 ms
[2024-05-24 08:00:17] [INFO ] Implicit Places using invariants and state equation in 13887 ms returned []
Implicit Place search using SMT with State Equation took 26955 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 08:00:29] [INFO ] Invariants computation overflowed in 12443 ms
[2024-05-24 08:00:30] [INFO ] Dead Transitions using invariants and state equation in 13252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40371 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 647 ms :[true, (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 11}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 12}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 8}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=9 dest: 1}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=9 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p3 p1 p2), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND p1 p0), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=11 dest: 1}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=11 dest: 3}, { cond=(AND p3 p0 p2), acceptance={} source=11 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p3) p0 p2), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=12 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=12 dest: 3}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={} source=12 dest: 4}, { cond=(AND p3 p1 p0 p2), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=12 dest: 7}, { cond=(AND p3 p1 (NOT p0) p2), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=12 dest: 9}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p3) p1 p0 p2), acceptance={} source=12 dest: 12}]], initial=2, aps=[p2:(AND (EQ s2644 1) (EQ s3091 1)), p3:(AND (EQ s1002 1) (EQ s2851 1) (EQ s2852 1) (EQ s2853 1) (EQ s2854 1) (EQ s2856 1) (EQ s2857 1)), p1:(OR (EQ s2644 ...], 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, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6574 steps with 13 reset in 480 ms.
FORMULA Echo-PT-d05r03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-12 finished in 41543 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(G((F(X(p0))||X(p1)))))&&X(p1)))'
Support contains 16 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 258 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 08:00:44] [INFO ] Invariants computation overflowed in 12719 ms
[2024-05-24 08:00:45] [INFO ] Implicit Places using invariants in 13392 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 08:00:57] [INFO ] Invariants computation overflowed in 12158 ms
[2024-05-24 08:00:58] [INFO ] Implicit Places using invariants and state equation in 13451 ms returned []
Implicit Place search using SMT with State Equation took 26846 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2024-05-24 08:01:11] [INFO ] Invariants computation overflowed in 12528 ms
[2024-05-24 08:01:12] [INFO ] Dead Transitions using invariants and state equation in 13381 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40485 ms. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s133 0) (EQ s135 0) (EQ s136 0) (EQ s137 0) (EQ s138 0) (EQ s139 0) (EQ s140 0) (EQ s1775 0)), p0:(OR (EQ s1450 0) (EQ s3298 0) (EQ s3299 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 205 reset in 4174 ms.
Product exploration explored 100000 steps with 205 reset in 4983 ms.
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
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), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d05r03-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-13 finished in 52740 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(p1))))'
Support contains 14 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.9 ms
Discarding 11 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 276 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 08:01:37] [INFO ] Invariants computation overflowed in 12180 ms
[2024-05-24 08:01:37] [INFO ] Implicit Places using invariants in 13035 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 08:01:50] [INFO ] Invariants computation overflowed in 12163 ms
[2024-05-24 08:01:51] [INFO ] Implicit Places using invariants and state equation in 13287 ms returned []
Implicit Place search using SMT with State Equation took 26324 ms to find 0 implicit places.
[2024-05-24 08:01:51] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 08:02:03] [INFO ] Invariants computation overflowed in 12085 ms
[2024-05-24 08:02:04] [INFO ] Dead Transitions using invariants and state equation in 12912 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39655 ms. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-14 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: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1621 1) (EQ s3456 1) (EQ s3457 1) (EQ s3458 1) (EQ s3459 1) (EQ s3460 1) (EQ s3461 1) (EQ s991 1) (EQ s2839 1) (EQ s2840 1) (EQ s2841 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 484 steps with 0 reset in 30 ms.
FORMULA Echo-PT-d05r03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-14 finished in 39852 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)))'
Support contains 10 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.12 ms
Discarding 11 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 307 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 08:02:17] [INFO ] Invariants computation overflowed in 12711 ms
[2024-05-24 08:02:18] [INFO ] Implicit Places using invariants in 13352 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 08:02:29] [INFO ] Invariants computation overflowed in 11659 ms
[2024-05-24 08:02:30] [INFO ] Implicit Places using invariants and state equation in 12904 ms returned []
Implicit Place search using SMT with State Equation took 26257 ms to find 0 implicit places.
[2024-05-24 08:02:31] [INFO ] Redundant transitions in 129 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2024-05-24 08:02:43] [INFO ] Invariants computation overflowed in 12458 ms
[2024-05-24 08:02:44] [INFO ] Dead Transitions using invariants and state equation in 13302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40009 ms. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s1 1) (EQ s2 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s1632 1) (OR (EQ s2604 0) (EQ s2910 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 484 steps with 0 reset in 21 ms.
FORMULA Echo-PT-d05r03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-15 finished in 40091 ms.
All properties solved by simple procedures.
Total runtime 696157 ms.

BK_STOP 1716537765734

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Echo-PT-d05r03"
export BK_EXAMINATION="LTLFireability"
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 Echo-PT-d05r03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636279900088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d05r03.tgz
mv Echo-PT-d05r03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;