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.r285-smll-171654422100153.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 Peterson-COL-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422100153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.3K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 03:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 03:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 04:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 47K 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 Peterson-COL-7-LTLFireability-00
FORMULA_NAME Peterson-COL-7-LTLFireability-01
FORMULA_NAME Peterson-COL-7-LTLFireability-02
FORMULA_NAME Peterson-COL-7-LTLFireability-03
FORMULA_NAME Peterson-COL-7-LTLFireability-04
FORMULA_NAME Peterson-COL-7-LTLFireability-05
FORMULA_NAME Peterson-COL-7-LTLFireability-06
FORMULA_NAME Peterson-COL-7-LTLFireability-07
FORMULA_NAME Peterson-COL-7-LTLFireability-08
FORMULA_NAME Peterson-COL-7-LTLFireability-09
FORMULA_NAME Peterson-COL-7-LTLFireability-10
FORMULA_NAME Peterson-COL-7-LTLFireability-11
FORMULA_NAME Peterson-COL-7-LTLFireability-12
FORMULA_NAME Peterson-COL-7-LTLFireability-13
FORMULA_NAME Peterson-COL-7-LTLFireability-14
FORMULA_NAME Peterson-COL-7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716896357269

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=Peterson-COL-7
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-28 11:39:21] [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-28 11:39:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:39:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 11:39:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 11:39:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1251 ms
[2024-05-28 11:39:22] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 46 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 11:39:22] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 9 ms.
[2024-05-28 11:39:22] [INFO ] Skeletonized 14 HLPN properties in 3 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-COL-7-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 676 steps, including 0 resets, run visited all 10 properties in 42 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-28 11:39:23] [INFO ] Flatten gal took : 30 ms
[2024-05-28 11:39:23] [INFO ] Flatten gal took : 5 ms
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 11:39:23] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 136 ms.
[2024-05-28 11:39:23] [INFO ] Unfolded 14 HLPN properties in 18 ms.
Deduced a syphon composed of 56 places in 40 ms
Reduce places removed 56 places and 112 transitions.
Support contains 1936 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 44 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:39:24] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-05-28 11:39:24] [INFO ] Computed 31 invariants in 59 ms
[2024-05-28 11:39:25] [INFO ] Implicit Places using invariants in 798 ms returned []
[2024-05-28 11:39:25] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:39:25] [INFO ] Invariant cache hit.
[2024-05-28 11:39:25] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-28 11:39:25] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2024-05-28 11:39:25] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:39:25] [INFO ] Invariant cache hit.
[2024-05-28 11:39:30] [INFO ] Dead Transitions using invariants and state equation in 4208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6018 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1936 out of 1992 places after structural reductions.
[2024-05-28 11:39:30] [INFO ] Flatten gal took : 385 ms
[2024-05-28 11:39:31] [INFO ] Flatten gal took : 270 ms
[2024-05-28 11:39:32] [INFO ] Input system was already deterministic with 3096 transitions.
Support contains 1928 out of 1992 places (down from 1936) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 961 ms. (steps per millisecond=10 ) properties (out of 20) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-28 11:39:34] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:39:34] [INFO ] Invariant cache hit.
[2024-05-28 11:39:35] [INFO ] [Real]Absence check using 23 positive place invariants in 50 ms returned sat
[2024-05-28 11:39:35] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 25 ms returned sat
[2024-05-28 11:39:37] [INFO ] After 2729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 11:39:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2024-05-28 11:39:38] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 23 ms returned sat
[2024-05-28 11:39:43] [INFO ] After 4812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-28 11:39:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-28 11:39:47] [INFO ] After 3505ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-28 11:39:49] [INFO ] Deduced a trap composed of 309 places in 2102 ms of which 7 ms to minimize.
[2024-05-28 11:39:50] [INFO ] Deduced a trap composed of 74 places in 1378 ms of which 3 ms to minimize.
[2024-05-28 11:39:52] [INFO ] Deduced a trap composed of 271 places in 1549 ms of which 2 ms to minimize.
[2024-05-28 11:39:54] [INFO ] Deduced a trap composed of 21 places in 1399 ms of which 2 ms to minimize.
[2024-05-28 11:39:55] [INFO ] Deduced a trap composed of 63 places in 1623 ms of which 2 ms to minimize.
[2024-05-28 11:39:57] [INFO ] Deduced a trap composed of 40 places in 1958 ms of which 2 ms to minimize.
[2024-05-28 11:39:59] [INFO ] Deduced a trap composed of 22 places in 1752 ms of which 2 ms to minimize.
[2024-05-28 11:40:01] [INFO ] Deduced a trap composed of 91 places in 1770 ms of which 2 ms to minimize.
[2024-05-28 11:40:03] [INFO ] Deduced a trap composed of 202 places in 1460 ms of which 2 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
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-28 11:40:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 11:40:03] [INFO ] After 25497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 46 ms.
Support contains 184 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 882 transitions
Trivial Post-agglo rules discarded 882 transitions
Performed 882 trivial Post agglomeration. Transition count delta: 882
Iterating post reduction 0 with 882 rules applied. Total rules applied 882 place count 1992 transition count 2214
Reduce places removed 882 places and 0 transitions.
Iterating post reduction 1 with 882 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Performed 407 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 407 Pre rules applied. Total rules applied 1764 place count 1110 transition count 1807
Deduced a syphon composed of 407 places in 3 ms
Reduce places removed 407 places and 0 transitions.
Iterating global reduction 2 with 814 rules applied. Total rules applied 2578 place count 703 transition count 1807
Applied a total of 2578 rules in 336 ms. Remains 703 /1992 variables (removed 1289) and now considering 1807/3096 (removed 1289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 703/1992 places, 1807/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 285660 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 285660 steps, saw 75536 distinct states, run finished after 3002 ms. (steps per millisecond=95 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-28 11:40:07] [INFO ] Flow matrix only has 1471 transitions (discarded 336 similar events)
// Phase 1: matrix 1471 rows 703 cols
[2024-05-28 11:40:07] [INFO ] Computed 31 invariants in 10 ms
[2024-05-28 11:40:07] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2024-05-28 11:40:07] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2024-05-28 11:40:07] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 11:40:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2024-05-28 11:40:08] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 15 ms returned sat
[2024-05-28 11:40:09] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 11:40:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-28 11:40:09] [INFO ] After 198ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 11:40:09] [INFO ] Deduced a trap composed of 36 places in 449 ms of which 1 ms to minimize.
[2024-05-28 11:40:10] [INFO ] Deduced a trap composed of 78 places in 726 ms of which 1 ms to minimize.
[2024-05-28 11:40:11] [INFO ] Deduced a trap composed of 29 places in 719 ms of which 1 ms to minimize.
[2024-05-28 11:40:12] [INFO ] Deduced a trap composed of 29 places in 661 ms of which 1 ms to minimize.
[2024-05-28 11:40:13] [INFO ] Deduced a trap composed of 41 places in 715 ms of which 1 ms to minimize.
[2024-05-28 11:40:13] [INFO ] Deduced a trap composed of 41 places in 499 ms of which 0 ms to minimize.
[2024-05-28 11:40:14] [INFO ] Deduced a trap composed of 88 places in 686 ms of which 2 ms to minimize.
[2024-05-28 11:40:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5146 ms
[2024-05-28 11:40:14] [INFO ] After 5477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-28 11:40:14] [INFO ] After 6729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 72 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1807/1807 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 703 transition count 1759
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 655 transition count 1759
Applied a total of 96 rules in 153 ms. Remains 655 /703 variables (removed 48) and now considering 1759/1807 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 655/703 places, 1759/1807 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291789 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291789 steps, saw 47986 distinct states, run finished after 3003 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 11:40:18] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
// Phase 1: matrix 1423 rows 655 cols
[2024-05-28 11:40:18] [INFO ] Computed 31 invariants in 16 ms
[2024-05-28 11:40:18] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2024-05-28 11:40:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-28 11:40:18] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 11:40:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2024-05-28 11:40:18] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 15 ms returned sat
[2024-05-28 11:40:19] [INFO ] After 859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 11:40:19] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-28 11:40:19] [INFO ] After 256ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 11:40:19] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 161 ms.
[2024-05-28 11:40:19] [INFO ] After 1726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 72 out of 655 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 655/655 places, 1759/1759 transitions.
Applied a total of 0 rules in 95 ms. Remains 655 /655 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 655/655 places, 1759/1759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 655/655 places, 1759/1759 transitions.
Applied a total of 0 rules in 91 ms. Remains 655 /655 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
[2024-05-28 11:40:20] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2024-05-28 11:40:20] [INFO ] Invariant cache hit.
[2024-05-28 11:40:21] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-28 11:40:21] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2024-05-28 11:40:21] [INFO ] Invariant cache hit.
[2024-05-28 11:40:21] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-28 11:40:25] [INFO ] Implicit Places using invariants and state equation in 4866 ms returned []
Implicit Place search using SMT with State Equation took 5757 ms to find 0 implicit places.
[2024-05-28 11:40:26] [INFO ] Redundant transitions in 149 ms returned []
[2024-05-28 11:40:26] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2024-05-28 11:40:26] [INFO ] Invariant cache hit.
[2024-05-28 11:40:27] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7889 ms. Remains : 655/655 places, 1759/1759 transitions.
Graph (trivial) has 1239 edges and 655 vertex of which 448 / 655 are part of one of the 56 SCC in 6 ms
Free SCC test removed 392 places
Drop transitions removed 784 transitions
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 1120 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 256 transition count 681
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 0 with 49 rules applied. Total rules applied 64 place count 256 transition count 632
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 0 with 57 rules applied. Total rules applied 121 place count 256 transition count 632
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 127 place count 256 transition count 626
Applied a total of 127 rules in 73 ms. Remains 256 /655 variables (removed 399) and now considering 626/1759 (removed 1133) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 626 rows 256 cols
[2024-05-28 11:40:28] [INFO ] Computed 31 invariants in 3 ms
[2024-05-28 11:40:28] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2024-05-28 11:40:28] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-28 11:40:28] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 11:40:28] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2024-05-28 11:40:28] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-28 11:40:28] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 11:40:28] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-28 11:40:28] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Peterson-COL-7-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 U (!p1||G(p2))))))'
Support contains 616 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 441 Post agglomeration using F-continuation condition.Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 441 place count 1992 transition count 2655
Reduce places removed 441 places and 0 transitions.
Iterating post reduction 1 with 441 rules applied. Total rules applied 882 place count 1551 transition count 2655
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 882 place count 1551 transition count 2599
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 994 place count 1495 transition count 2599
Applied a total of 994 rules in 291 ms. Remains 1495 /1992 variables (removed 497) and now considering 2599/3096 (removed 497) transitions.
[2024-05-28 11:40:29] [INFO ] Flow matrix only has 2263 transitions (discarded 336 similar events)
// Phase 1: matrix 2263 rows 1495 cols
[2024-05-28 11:40:29] [INFO ] Computed 31 invariants in 15 ms
[2024-05-28 11:40:30] [INFO ] Implicit Places using invariants in 772 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 778 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1487/1992 places, 2599/3096 transitions.
Applied a total of 0 rules in 95 ms. Remains 1487 /1487 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1167 ms. Remains : 1487/1992 places, 2599/3096 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 421 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Peterson-COL-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p2 p0), acceptance={1} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p2 p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p2 p0), acceptance={1} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (OR (GEQ s205 1) (GEQ s335 1) (GEQ s465 1) (GEQ s530 1) (GEQ s270 1) (GEQ s140 1) (GEQ s400 1) (GEQ s481 1) (GEQ s221 1) (GEQ s351 1) (GEQ s54...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 66670 steps with 1738 reset in 10002 ms.
Stack based approach found an accepted trace after 16207 steps with 424 reset with depth 8 and stack size 8 in 2444 ms.
FORMULA Peterson-COL-7-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-00 finished in 14182 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((F(G(p1))&&p0)))'
Support contains 112 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1800
Deduced a syphon composed of 400 places in 2 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 2592 place count 696 transition count 1800
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2704 place count 640 transition count 1744
Applied a total of 2704 rules in 152 ms. Remains 640 /1992 variables (removed 1352) and now considering 1744/3096 (removed 1352) transitions.
[2024-05-28 11:40:43] [INFO ] Flow matrix only has 1408 transitions (discarded 336 similar events)
// Phase 1: matrix 1408 rows 640 cols
[2024-05-28 11:40:43] [INFO ] Computed 31 invariants in 10 ms
[2024-05-28 11:40:44] [INFO ] Implicit Places using invariants in 753 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 757 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 632/1992 places, 1744/3096 transitions.
Applied a total of 0 rules in 50 ms. Remains 632 /632 variables (removed 0) and now considering 1744/1744 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 961 ms. Remains : 632/1992 places, 1744/3096 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s31 1) (LT s80 1)) (OR (LT s32 1) (LT s94 1)) (OR (LT s64 1) (LT s120 1)) (OR (LT s48 1) (LT s107 1)) (OR (LT s62 1) (LT s108 1)) (OR (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 5113 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 8 ms.
FORMULA Peterson-COL-7-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-01 finished in 6284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X((X(G(p2))||p1))))))'
Support contains 568 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 82 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:40:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-05-28 11:40:49] [INFO ] Computed 31 invariants in 36 ms
[2024-05-28 11:40:50] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-28 11:40:50] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:40:50] [INFO ] Invariant cache hit.
[2024-05-28 11:40:51] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2024-05-28 11:40:51] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:40:51] [INFO ] Invariant cache hit.
[2024-05-28 11:40:54] [INFO ] Dead Transitions using invariants and state equation in 3830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5219 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-7-LTLFireability-02 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: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (AND (GEQ s10 1) (GEQ s1187 1)) (AND (GEQ s8 1) (GEQ s1334 1)) (AND (GEQ s12 1) (GEQ s1497 1)) (AND (GEQ s16 1) (GEQ s1204 1)) (AND (GEQ s18 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-02 finished in 5508 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)||X(p1)))'
Support contains 72 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 76 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:40:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:40:55] [INFO ] Invariant cache hit.
[2024-05-28 11:40:56] [INFO ] Implicit Places using invariants in 1364 ms returned []
[2024-05-28 11:40:56] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:40:56] [INFO ] Invariant cache hit.
[2024-05-28 11:40:57] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-28 11:40:58] [INFO ] Implicit Places using invariants and state equation in 2278 ms returned []
Implicit Place search using SMT with State Equation took 3645 ms to find 0 implicit places.
[2024-05-28 11:40:58] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:40:58] [INFO ] Invariant cache hit.
[2024-05-28 11:41:02] [INFO ] Dead Transitions using invariants and state equation in 3686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7409 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s1895 1) (GEQ s1767 1) (GEQ s1639 1) (GEQ s1887 1) (GEQ s1759 1) (GEQ s1631 1) (GEQ s1879 1) (GEQ s1751 1) (GEQ s1623 1) (GEQ s1871 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 728 ms.
Stack based approach found an accepted trace after 866 steps with 0 reset with depth 867 and stack size 867 in 7 ms.
FORMULA Peterson-COL-7-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-03 finished in 8291 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&&F(p1)))&&X(X(G(!p1)))))'
Support contains 168 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 76 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:41:03] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:03] [INFO ] Invariant cache hit.
[2024-05-28 11:41:04] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2024-05-28 11:41:04] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:04] [INFO ] Invariant cache hit.
[2024-05-28 11:41:05] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2024-05-28 11:41:05] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:05] [INFO ] Invariant cache hit.
[2024-05-28 11:41:08] [INFO ] Dead Transitions using invariants and state equation in 2667 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4946 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, true, p1, p1, true, true]
Running random walk in product with property : Peterson-COL-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (AND (GEQ s133 1) (GEQ s170 1)) (AND (GEQ s87 1) (GEQ s143 1)) (AND (GEQ s130 1) (GEQ s177 1)) (AND (GEQ s131 1) (GEQ s191 1)) (AND (GEQ s124 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-04 finished in 5179 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 (F(p1) U X(p2)))))'
Support contains 840 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 38 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:41:08] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:08] [INFO ] Invariant cache hit.
[2024-05-28 11:41:09] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-05-28 11:41:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:09] [INFO ] Invariant cache hit.
[2024-05-28 11:41:10] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
[2024-05-28 11:41:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:10] [INFO ] Invariant cache hit.
[2024-05-28 11:41:14] [INFO ] Dead Transitions using invariants and state equation in 3518 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5282 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s649 1) (GEQ s650 1) (GEQ s648 1) (GEQ s651 1) (GEQ s654 1) (GEQ s655 1) (GEQ s652 1) (GEQ s641 1) (GEQ s640 1) (GEQ s643 1) (GEQ s642 1) (GEQ...], 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 7410 reset in 2933 ms.
Stack based approach found an accepted trace after 35868 steps with 2660 reset with depth 11 and stack size 11 in 1150 ms.
FORMULA Peterson-COL-7-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-06 finished in 9608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(((F(G(!p1)) U p2) U (p3&&(F(G(!p1)) U p2))))||p0)))'
Support contains 568 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 99 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:41:18] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:18] [INFO ] Invariant cache hit.
[2024-05-28 11:41:19] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-28 11:41:19] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:19] [INFO ] Invariant cache hit.
[2024-05-28 11:41:19] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-28 11:41:20] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
[2024-05-28 11:41:20] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:20] [INFO ] Invariant cache hit.
[2024-05-28 11:41:23] [INFO ] Dead Transitions using invariants and state equation in 3469 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5203 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p3)), p1, (NOT p2)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s133 1) (GEQ s170 1)) (AND (GEQ s87 1) (GEQ s143 1)) (AND (GEQ s130 1) (GEQ s177 1)) (AND (GEQ s131 1) (GEQ s191 1)) (AND (GEQ s124 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5086 ms.
Stack based approach found an accepted trace after 1547 steps with 0 reset with depth 1548 and stack size 1548 in 78 ms.
FORMULA Peterson-COL-7-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-07 finished in 10597 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((X(X((!p1 U (G(!p1)||(!p1&&G(!p2))))))&&p0))))'
Support contains 848 out of 1992 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 35 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:41:28] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:28] [INFO ] Invariant cache hit.
[2024-05-28 11:41:29] [INFO ] Implicit Places using invariants in 479 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 483 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 45 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 565 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (LT s253 1) (LT s383 1) (LT s513 1) (LT s578 1) (LT s318 1) (LT s188 1) (LT s448 1) (LT s529 1) (LT s269 1) (LT s399 1) (LT s594 1) (LT s334 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-7-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-08 finished in 795 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(((p0 U p1) U (G((p0 U p1))||(!p2&&(p0 U p1))))) U (X(G((p0 U p1)))||(!p3&&X(((p0 U p1) U (G((p0 U p1))||(!p2&&(p0 U p1)))))))))))'
Support contains 1000 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 29 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:41:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:29] [INFO ] Invariant cache hit.
[2024-05-28 11:41:30] [INFO ] Implicit Places using invariants in 1037 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1040 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 25 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1097 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s253 1) (GEQ s383 1) (GEQ s513 1) (GEQ s578 1) (GEQ s318 1) (GEQ s188 1) (GEQ s448 1) (GEQ s529 1) (GEQ s269 1) (GEQ s399 1) (GEQ s594 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-7-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-09 finished in 1408 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 392 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1992 transition count 2935
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1831 transition count 2935
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 322 place count 1831 transition count 2536
Deduced a syphon composed of 399 places in 2 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1120 place count 1432 transition count 2536
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1232 place count 1376 transition count 2480
Applied a total of 1232 rules in 216 ms. Remains 1376 /1992 variables (removed 616) and now considering 2480/3096 (removed 616) transitions.
[2024-05-28 11:41:31] [INFO ] Flow matrix only has 2144 transitions (discarded 336 similar events)
// Phase 1: matrix 2144 rows 1376 cols
[2024-05-28 11:41:31] [INFO ] Computed 31 invariants in 11 ms
[2024-05-28 11:41:32] [INFO ] Implicit Places using invariants in 941 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 945 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1368/1992 places, 2480/3096 transitions.
Applied a total of 0 rules in 55 ms. Remains 1368 /1368 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1218 ms. Remains : 1368/1992 places, 2480/3096 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s600 1) (GEQ s372 1) (GEQ s429 1) (GEQ s258 1) (GEQ s315 1) (GEQ s472 1) (GEQ s529 1) (GEQ s329 1) (GEQ s443 1) (GEQ s586 1) (GEQ s386 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1982 ms.
Stack based approach found an accepted trace after 1523 steps with 0 reset with depth 1524 and stack size 1524 in 27 ms.
FORMULA Peterson-COL-7-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-10 finished in 3287 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&&F(p1)))||X(F(!p2))))'
Support contains 144 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 71 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:41:34] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-05-28 11:41:34] [INFO ] Computed 31 invariants in 12 ms
[2024-05-28 11:41:35] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-05-28 11:41:35] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:35] [INFO ] Invariant cache hit.
[2024-05-28 11:41:36] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2024-05-28 11:41:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:36] [INFO ] Invariant cache hit.
[2024-05-28 11:41:39] [INFO ] Dead Transitions using invariants and state equation in 3402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5378 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : Peterson-COL-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s10 1)) (AND (GEQ s4 1) (GEQ s16 1)) (AND (GEQ s5 1) (GEQ s18 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3590 ms.
Product exploration explored 100000 steps with 50000 reset in 3477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 30 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-7-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLFireability-13 finished in 12653 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 (p1 U G(p2))))'
Support contains 72 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 882 transitions
Trivial Post-agglo rules discarded 882 transitions
Performed 882 trivial Post agglomeration. Transition count delta: 882
Iterating post reduction 0 with 882 rules applied. Total rules applied 882 place count 1992 transition count 2214
Reduce places removed 882 places and 0 transitions.
Iterating post reduction 1 with 882 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Performed 455 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 455 Pre rules applied. Total rules applied 1764 place count 1110 transition count 1759
Deduced a syphon composed of 455 places in 1 ms
Reduce places removed 455 places and 0 transitions.
Iterating global reduction 2 with 910 rules applied. Total rules applied 2674 place count 655 transition count 1759
Applied a total of 2674 rules in 154 ms. Remains 655 /1992 variables (removed 1337) and now considering 1759/3096 (removed 1337) transitions.
[2024-05-28 11:41:47] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
// Phase 1: matrix 1423 rows 655 cols
[2024-05-28 11:41:47] [INFO ] Computed 31 invariants in 4 ms
[2024-05-28 11:41:48] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-28 11:41:48] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2024-05-28 11:41:48] [INFO ] Invariant cache hit.
[2024-05-28 11:41:48] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-28 11:41:53] [INFO ] Implicit Places using invariants and state equation in 4940 ms returned []
Implicit Place search using SMT with State Equation took 5872 ms to find 0 implicit places.
[2024-05-28 11:41:53] [INFO ] Redundant transitions in 111 ms returned []
[2024-05-28 11:41:53] [INFO ] Flow matrix only has 1423 transitions (discarded 336 similar events)
[2024-05-28 11:41:53] [INFO ] Invariant cache hit.
[2024-05-28 11:41:55] [INFO ] Dead Transitions using invariants and state equation in 1819 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 655/1992 places, 1759/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7964 ms. Remains : 655/1992 places, 1759/3096 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s6 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s10 1)) (AND (GEQ s4 1) (GEQ s16 1)) (AND (GEQ s5 1) (GEQ s18 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-7-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-14 finished in 8169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1) U p2)||p0)))'
Support contains 464 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 70 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-05-28 11:41:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-05-28 11:41:55] [INFO ] Computed 31 invariants in 14 ms
[2024-05-28 11:41:56] [INFO ] Implicit Places using invariants in 1119 ms returned []
[2024-05-28 11:41:56] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:56] [INFO ] Invariant cache hit.
[2024-05-28 11:41:57] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-05-28 11:41:59] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned []
Implicit Place search using SMT with State Equation took 3743 ms to find 0 implicit places.
[2024-05-28 11:41:59] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-05-28 11:41:59] [INFO ] Invariant cache hit.
[2024-05-28 11:42:02] [INFO ] Dead Transitions using invariants and state equation in 3488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7304 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-COL-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (GEQ s1106 1) (GEQ s846 1) (GEQ s911 1) (GEQ s716 1) (GEQ s781 1) (GEQ s960 1) (GEQ s1025 1) (GEQ s797 1) (GEQ s927 1) (GEQ s1090 1) (GEQ s862 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]]
Product exploration explored 100000 steps with 50000 reset in 2859 ms.
Product exploration explored 100000 steps with 50000 reset in 2502 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-7-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLFireability-15 finished in 12960 ms.
All properties solved by simple procedures.
Total runtime 166954 ms.

BK_STOP 1716896529237

--------------------
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="Peterson-COL-7"
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 Peterson-COL-7, 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 r285-smll-171654422100153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-7.tgz
mv Peterson-COL-7 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 ;