Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536600595.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Peterson-COL-7, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536600595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 9.1K Feb 25 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 22:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 47K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679036553395

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-7
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-17 07:02:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 07:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 07:02:37] [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.
[2023-03-17 07:02:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 07:02:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1059 ms
[2023-03-17 07:02:38] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2023-03-17 07:02:38] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 10 ms.
[2023-03-17 07:02:38] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-COL-7-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 15 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
Incomplete random walk after 10002 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 29) seen :28
Finished Best-First random walk after 151 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=50 )
[2023-03-17 07:02:38] [INFO ] Flatten gal took : 33 ms
[2023-03-17 07:02:38] [INFO ] Flatten gal took : 6 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.
[2023-03-17 07:02:39] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 126 ms.
[2023-03-17 07:02:39] [INFO ] Unfolded 15 HLPN properties in 12 ms.
Deduced a syphon composed of 56 places in 42 ms
Reduce places removed 56 places and 112 transitions.
Support contains 1920 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.
[2023-03-17 07:02:39] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 07:02:39] [INFO ] Computed 31 place invariants in 58 ms
[2023-03-17 07:02:40] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2023-03-17 07:02:40] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:02:40] [INFO ] Invariant cache hit.
[2023-03-17 07:02:41] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2023-03-17 07:02:41] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:02:41] [INFO ] Invariant cache hit.
[2023-03-17 07:02:45] [INFO ] Dead Transitions using invariants and state equation in 4166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6072 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1920 out of 1992 places after structural reductions.
[2023-03-17 07:02:45] [INFO ] Flatten gal took : 288 ms
[2023-03-17 07:02:46] [INFO ] Flatten gal took : 248 ms
[2023-03-17 07:02:46] [INFO ] Input system was already deterministic with 3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 733 ms. (steps per millisecond=13 ) properties (out of 28) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 07:02:48] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:02:48] [INFO ] Invariant cache hit.
[2023-03-17 07:02:49] [INFO ] [Real]Absence check using 23 positive place invariants in 80 ms returned sat
[2023-03-17 07:02:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 55 ms returned sat
[2023-03-17 07:02:57] [INFO ] After 9025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 07:02:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 53 ms returned sat
[2023-03-17 07:02:58] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 32 ms returned sat
[2023-03-17 07:03:04] [INFO ] After 6192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 07:03:04] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:03:10] [INFO ] After 5808ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 07:03:14] [INFO ] Deduced a trap composed of 56 places in 1917 ms of which 12 ms to minimize.
[2023-03-17 07:03:17] [INFO ] Deduced a trap composed of 97 places in 2000 ms of which 3 ms to minimize.
[2023-03-17 07:03:19] [INFO ] Deduced a trap composed of 54 places in 1946 ms of which 3 ms to minimize.
[2023-03-17 07:03:21] [INFO ] Deduced a trap composed of 42 places in 2055 ms of which 2 ms to minimize.
[2023-03-17 07:03:23] [INFO ] Deduced a trap composed of 258 places in 1677 ms of which 3 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 07:03:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 07:03:23] [INFO ] After 25871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 75 ms.
Support contains 456 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2208
Deduced a syphon composed of 104 places in 7 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 1776 place count 1104 transition count 2208
Applied a total of 1776 rules in 508 ms. Remains 1104 /1992 variables (removed 888) and now considering 2208/3096 (removed 888) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 509 ms. Remains : 1104/1992 places, 2208/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 07:03:24] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2023-03-17 07:03:24] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-17 07:03:24] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2023-03-17 07:03:24] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 21 ms returned sat
[2023-03-17 07:03:26] [INFO ] After 2419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 07:03:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-17 07:03:27] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-17 07:03:29] [INFO ] After 2040ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 07:03:29] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:03:31] [INFO ] After 1935ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 07:03:32] [INFO ] Deduced a trap composed of 139 places in 1122 ms of which 2 ms to minimize.
[2023-03-17 07:03:33] [INFO ] Deduced a trap composed of 117 places in 884 ms of which 2 ms to minimize.
[2023-03-17 07:03:34] [INFO ] Deduced a trap composed of 80 places in 908 ms of which 2 ms to minimize.
[2023-03-17 07:03:35] [INFO ] Deduced a trap composed of 117 places in 904 ms of which 2 ms to minimize.
[2023-03-17 07:03:36] [INFO ] Deduced a trap composed of 90 places in 941 ms of which 2 ms to minimize.
[2023-03-17 07:03:37] [INFO ] Deduced a trap composed of 147 places in 1104 ms of which 2 ms to minimize.
[2023-03-17 07:03:38] [INFO ] Deduced a trap composed of 126 places in 945 ms of which 1 ms to minimize.
[2023-03-17 07:03:39] [INFO ] Deduced a trap composed of 61 places in 810 ms of which 2 ms to minimize.
[2023-03-17 07:03:40] [INFO ] Deduced a trap composed of 54 places in 807 ms of which 2 ms to minimize.
[2023-03-17 07:03:41] [INFO ] Deduced a trap composed of 43 places in 909 ms of which 1 ms to minimize.
[2023-03-17 07:03:42] [INFO ] Deduced a trap composed of 33 places in 920 ms of which 1 ms to minimize.
[2023-03-17 07:03:43] [INFO ] Deduced a trap composed of 115 places in 1080 ms of which 2 ms to minimize.
[2023-03-17 07:03:44] [INFO ] Deduced a trap composed of 21 places in 1127 ms of which 2 ms to minimize.
[2023-03-17 07:03:45] [INFO ] Deduced a trap composed of 144 places in 893 ms of which 2 ms to minimize.
[2023-03-17 07:03:46] [INFO ] Deduced a trap composed of 218 places in 925 ms of which 1 ms to minimize.
[2023-03-17 07:03:47] [INFO ] Deduced a trap composed of 156 places in 931 ms of which 1 ms to minimize.
[2023-03-17 07:03:49] [INFO ] Deduced a trap composed of 167 places in 1045 ms of which 2 ms to minimize.
[2023-03-17 07:03:49] [INFO ] Deduced a trap composed of 210 places in 582 ms of which 1 ms to minimize.
[2023-03-17 07:03:50] [INFO ] Deduced a trap composed of 97 places in 789 ms of which 2 ms to minimize.
[2023-03-17 07:03:51] [INFO ] Deduced a trap composed of 137 places in 1069 ms of which 2 ms to minimize.
[2023-03-17 07:03:52] [INFO ] Deduced a trap composed of 193 places in 750 ms of which 1 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 07:03:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 07:03:52] [INFO ] After 25701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 23 ms.
Support contains 456 out of 1104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 101 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 1104/1104 places, 2208/2208 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 163377 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163377 steps, saw 61113 distinct states, run finished after 3004 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 07:03:56] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-17 07:03:56] [INFO ] Invariant cache hit.
[2023-03-17 07:03:56] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-17 07:03:56] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-17 07:03:59] [INFO ] After 2758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 07:03:59] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-17 07:03:59] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-17 07:04:01] [INFO ] After 2032ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 07:04:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:04:02] [INFO ] After 1555ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 07:04:03] [INFO ] Deduced a trap composed of 161 places in 799 ms of which 1 ms to minimize.
[2023-03-17 07:04:04] [INFO ] Deduced a trap composed of 143 places in 782 ms of which 1 ms to minimize.
[2023-03-17 07:04:05] [INFO ] Deduced a trap composed of 186 places in 729 ms of which 1 ms to minimize.
[2023-03-17 07:04:06] [INFO ] Deduced a trap composed of 211 places in 743 ms of which 1 ms to minimize.
[2023-03-17 07:04:07] [INFO ] Deduced a trap composed of 192 places in 733 ms of which 1 ms to minimize.
[2023-03-17 07:04:08] [INFO ] Deduced a trap composed of 238 places in 925 ms of which 1 ms to minimize.
[2023-03-17 07:04:09] [INFO ] Deduced a trap composed of 198 places in 831 ms of which 1 ms to minimize.
[2023-03-17 07:04:10] [INFO ] Deduced a trap composed of 174 places in 795 ms of which 2 ms to minimize.
[2023-03-17 07:04:11] [INFO ] Deduced a trap composed of 207 places in 817 ms of which 1 ms to minimize.
[2023-03-17 07:04:11] [INFO ] Deduced a trap composed of 132 places in 668 ms of which 2 ms to minimize.
[2023-03-17 07:04:12] [INFO ] Deduced a trap composed of 119 places in 935 ms of which 2 ms to minimize.
[2023-03-17 07:04:13] [INFO ] Deduced a trap composed of 161 places in 874 ms of which 1 ms to minimize.
[2023-03-17 07:04:14] [INFO ] Deduced a trap composed of 155 places in 920 ms of which 2 ms to minimize.
[2023-03-17 07:04:15] [INFO ] Deduced a trap composed of 186 places in 673 ms of which 2 ms to minimize.
[2023-03-17 07:04:16] [INFO ] Deduced a trap composed of 131 places in 910 ms of which 2 ms to minimize.
[2023-03-17 07:04:17] [INFO ] Deduced a trap composed of 156 places in 1094 ms of which 2 ms to minimize.
[2023-03-17 07:04:18] [INFO ] Deduced a trap composed of 203 places in 1034 ms of which 3 ms to minimize.
[2023-03-17 07:04:20] [INFO ] Deduced a trap composed of 159 places in 1033 ms of which 1 ms to minimize.
[2023-03-17 07:04:21] [INFO ] Deduced a trap composed of 51 places in 794 ms of which 1 ms to minimize.
[2023-03-17 07:04:21] [INFO ] Deduced a trap composed of 105 places in 850 ms of which 2 ms to minimize.
[2023-03-17 07:04:23] [INFO ] Deduced a trap composed of 24 places in 1036 ms of which 1 ms to minimize.
[2023-03-17 07:04:23] [INFO ] Deduced a trap composed of 23 places in 765 ms of which 2 ms to minimize.
[2023-03-17 07:04:25] [INFO ] Deduced a trap composed of 140 places in 989 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 07:04:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 07:04:25] [INFO ] After 26028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 11 ms.
Support contains 456 out of 1104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 60 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1104/1104 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 51 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2023-03-17 07:04:25] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-17 07:04:25] [INFO ] Invariant cache hit.
[2023-03-17 07:04:26] [INFO ] Implicit Places using invariants in 830 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 838 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1096/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 68 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 962 ms. Remains : 1096/1104 places, 2208/2208 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 170136 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170136 steps, saw 61854 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 07:04:29] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-17 07:04:29] [INFO ] Computed 23 place invariants in 14 ms
[2023-03-17 07:04:30] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-17 07:04:32] [INFO ] After 2178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 07:04:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-17 07:04:34] [INFO ] After 1997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 07:04:34] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:04:36] [INFO ] After 1829ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 07:04:37] [INFO ] Deduced a trap composed of 134 places in 929 ms of which 1 ms to minimize.
[2023-03-17 07:04:38] [INFO ] Deduced a trap composed of 39 places in 932 ms of which 3 ms to minimize.
[2023-03-17 07:04:39] [INFO ] Deduced a trap composed of 13 places in 929 ms of which 1 ms to minimize.
[2023-03-17 07:04:40] [INFO ] Deduced a trap composed of 50 places in 985 ms of which 1 ms to minimize.
[2023-03-17 07:04:41] [INFO ] Deduced a trap composed of 48 places in 1064 ms of which 1 ms to minimize.
[2023-03-17 07:04:42] [INFO ] Deduced a trap composed of 57 places in 1153 ms of which 1 ms to minimize.
[2023-03-17 07:04:44] [INFO ] Deduced a trap composed of 123 places in 1134 ms of which 2 ms to minimize.
[2023-03-17 07:04:45] [INFO ] Deduced a trap composed of 39 places in 1064 ms of which 7 ms to minimize.
[2023-03-17 07:04:46] [INFO ] Deduced a trap composed of 13 places in 956 ms of which 1 ms to minimize.
[2023-03-17 07:04:47] [INFO ] Deduced a trap composed of 13 places in 948 ms of which 1 ms to minimize.
[2023-03-17 07:04:48] [INFO ] Deduced a trap composed of 15 places in 993 ms of which 2 ms to minimize.
[2023-03-17 07:04:49] [INFO ] Deduced a trap composed of 17 places in 1149 ms of which 2 ms to minimize.
[2023-03-17 07:04:51] [INFO ] Deduced a trap composed of 40 places in 1215 ms of which 1 ms to minimize.
[2023-03-17 07:04:52] [INFO ] Deduced a trap composed of 38 places in 936 ms of which 1 ms to minimize.
[2023-03-17 07:04:53] [INFO ] Deduced a trap composed of 101 places in 1018 ms of which 2 ms to minimize.
[2023-03-17 07:04:54] [INFO ] Deduced a trap composed of 138 places in 1024 ms of which 1 ms to minimize.
[2023-03-17 07:04:55] [INFO ] Deduced a trap composed of 17 places in 824 ms of which 1 ms to minimize.
[2023-03-17 07:04:56] [INFO ] Deduced a trap composed of 51 places in 869 ms of which 2 ms to minimize.
[2023-03-17 07:04:57] [INFO ] Deduced a trap composed of 24 places in 823 ms of which 1 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 07:04:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 07:04:57] [INFO ] After 25092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 22 ms.
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 39 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 37 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2023-03-17 07:04:57] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-17 07:04:57] [INFO ] Invariant cache hit.
[2023-03-17 07:04:57] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-17 07:04:57] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-17 07:04:57] [INFO ] Invariant cache hit.
[2023-03-17 07:04:59] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:05:06] [INFO ] Implicit Places using invariants and state equation in 9012 ms returned []
Implicit Place search using SMT with State Equation took 9786 ms to find 0 implicit places.
[2023-03-17 07:05:07] [INFO ] Redundant transitions in 219 ms returned []
[2023-03-17 07:05:07] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-17 07:05:07] [INFO ] Invariant cache hit.
[2023-03-17 07:05:09] [INFO ] Dead Transitions using invariants and state equation in 2212 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12275 ms. Remains : 1096/1096 places, 2208/2208 transitions.
FORMULA Peterson-COL-7-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 512 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 49 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 07:05:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 07:05:10] [INFO ] Computed 31 place invariants in 27 ms
[2023-03-17 07:05:10] [INFO ] Implicit Places using invariants in 898 ms returned []
[2023-03-17 07:05:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:05:10] [INFO ] Invariant cache hit.
[2023-03-17 07:05:11] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:05:13] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 3269 ms to find 0 implicit places.
[2023-03-17 07:05:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:05:13] [INFO ] Invariant cache hit.
[2023-03-17 07:05:16] [INFO ] Dead Transitions using invariants and state equation in 3610 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6932 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s720 s721 s722 s723 s724 s725 s726 s727 s728 s729 s730 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3242 ms.
Product exploration explored 100000 steps with 50000 reset in 2729 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)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-7-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLCardinality-00 finished in 13463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 456 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 46 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 07:05:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:05:23] [INFO ] Invariant cache hit.
[2023-03-17 07:05:24] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2023-03-17 07:05:24] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:05:24] [INFO ] Invariant cache hit.
[2023-03-17 07:05:26] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:05:44] [INFO ] Implicit Places using invariants and state equation in 20180 ms returned []
Implicit Place search using SMT with State Equation took 21311 ms to find 0 implicit places.
[2023-03-17 07:05:44] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:05:44] [INFO ] Invariant cache hit.
[2023-03-17 07:05:47] [INFO ] Dead Transitions using invariants and state equation in 2736 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24095 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7) (ADD s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s720 s721 s722 s723 s724 s725 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5522 reset in 1538 ms.
Stack based approach found an accepted trace after 22336 steps with 1238 reset with depth 8 and stack size 8 in 345 ms.
FORMULA Peterson-COL-7-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-01 finished in 26088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 448 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 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2200
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Applied a total of 1792 rules in 187 ms. Remains 1096 /1992 variables (removed 896) and now considering 2200/3096 (removed 896) transitions.
[2023-03-17 07:05:49] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1096 cols
[2023-03-17 07:05:49] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-17 07:05:50] [INFO ] Implicit Places using invariants in 708 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 722 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1088/1992 places, 2200/3096 transitions.
Applied a total of 0 rules in 80 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 991 ms. Remains : 1088/1992 places, 2200/3096 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 37 reset in 1077 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 1 ms.
FORMULA Peterson-COL-7-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-02 finished in 2317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X(G(p2))&&p1)))))'
Support contains 120 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 89 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 07:05:51] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 07:05:51] [INFO ] Computed 31 place invariants in 32 ms
[2023-03-17 07:05:53] [INFO ] Implicit Places using invariants in 1195 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1199 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 82 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 1372 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ 3 (ADD s688 s689 s690 s691 s692 s693 s694 s695)), p1:(AND (GT 3 (ADD s688 s689 s690 s691 s692 s693 s694 s695)) (GT 1 (ADD s632 s633 s634 s635 s636...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1022 ms.
Stack based approach found an accepted trace after 805 steps with 0 reset with depth 806 and stack size 804 in 8 ms.
FORMULA Peterson-COL-7-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-03 finished in 2683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
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 72 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 07:05:54] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:05:54] [INFO ] Invariant cache hit.
[2023-03-17 07:05:55] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-17 07:05:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:05:55] [INFO ] Invariant cache hit.
[2023-03-17 07:05:56] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:06:00] [INFO ] Implicit Places using invariants and state equation in 5260 ms returned []
Implicit Place search using SMT with State Equation took 5995 ms to find 0 implicit places.
[2023-03-17 07:06:00] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:06:00] [INFO ] Invariant cache hit.
[2023-03-17 07:06:03] [INFO ] Dead Transitions using invariants and state equation in 2928 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8997 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s1152 s1153 s1154 s1155 s1156 s1157 s1158 s1159 s1160 s1161 s1162 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1170 s1171 s1172 s1173 s1174 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 566 reset in 1083 ms.
Stack based approach found an accepted trace after 315 steps with 0 reset with depth 316 and stack size 316 in 4 ms.
FORMULA Peterson-COL-7-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-04 finished in 10352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1)||G(p2)))))'
Support contains 912 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 56 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 07:06:04] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:06:04] [INFO ] Invariant cache hit.
[2023-03-17 07:06:05] [INFO ] Implicit Places using invariants in 791 ms returned []
[2023-03-17 07:06:05] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:06:05] [INFO ] Invariant cache hit.
[2023-03-17 07:06:07] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:06:13] [INFO ] Implicit Places using invariants and state equation in 7369 ms returned []
Implicit Place search using SMT with State Equation took 8184 ms to find 0 implicit places.
[2023-03-17 07:06:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:06:13] [INFO ] Invariant cache hit.
[2023-03-17 07:06:16] [INFO ] Dead Transitions using invariants and state equation in 3189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11437 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (LEQ (ADD s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s...], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 825 steps with 0 reset in 31 ms.
FORMULA Peterson-COL-7-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLCardinality-05 finished in 11756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 896 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1992 transition count 3089
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1985 transition count 3089
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 14 place count 1985 transition count 3033
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 126 place count 1929 transition count 3033
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 224 place count 1880 transition count 2984
Applied a total of 224 rules in 212 ms. Remains 1880 /1992 variables (removed 112) and now considering 2984/3096 (removed 112) transitions.
[2023-03-17 07:06:16] [INFO ] Flow matrix only has 2648 transitions (discarded 336 similar events)
// Phase 1: matrix 2648 rows 1880 cols
[2023-03-17 07:06:16] [INFO ] Computed 31 place invariants in 28 ms
[2023-03-17 07:06:18] [INFO ] Implicit Places using invariants in 1295 ms returned []
[2023-03-17 07:06:18] [INFO ] Flow matrix only has 2648 transitions (discarded 336 similar events)
[2023-03-17 07:06:18] [INFO ] Invariant cache hit.
[2023-03-17 07:06:19] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 2479 ms to find 0 implicit places.
[2023-03-17 07:06:19] [INFO ] Redundant transitions in 352 ms returned []
[2023-03-17 07:06:19] [INFO ] Flow matrix only has 2648 transitions (discarded 336 similar events)
[2023-03-17 07:06:19] [INFO ] Invariant cache hit.
[2023-03-17 07:06:23] [INFO ] Dead Transitions using invariants and state equation in 3616 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1880/1992 places, 2984/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6671 ms. Remains : 1880/1992 places, 2984/3096 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170...], 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 5067 ms.
Stack based approach found an accepted trace after 609 steps with 0 reset with depth 610 and stack size 610 in 29 ms.
FORMULA Peterson-COL-7-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-06 finished in 11839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 840 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 784 place count 1600 transition count 2704
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 784 place count 1600 transition count 2592
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 1008 place count 1488 transition count 2592
Applied a total of 1008 rules in 168 ms. Remains 1488 /1992 variables (removed 504) and now considering 2592/3096 (removed 504) transitions.
[2023-03-17 07:06:28] [INFO ] Flow matrix only has 2256 transitions (discarded 336 similar events)
// Phase 1: matrix 2256 rows 1488 cols
[2023-03-17 07:06:28] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-17 07:06:29] [INFO ] Implicit Places using invariants in 545 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 549 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1480/1992 places, 2592/3096 transitions.
Applied a total of 0 rules in 36 ms. Remains 1480 /1480 variables (removed 0) and now considering 2592/2592 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 754 ms. Remains : 1480/1992 places, 2592/3096 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 7 (ADD s1032 s1033 s1034 s1035 s1036 s1037 s1038 s1039 s1040 s1041 s1042 s1043 s1044 s1045 s1046 s1047 s1048 s1049 s1050 s1051 s1052 s1053 s1054 s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2979 reset in 1311 ms.
Stack based approach found an accepted trace after 140 steps with 3 reset with depth 46 and stack size 46 in 2 ms.
FORMULA Peterson-COL-7-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-07 finished in 2168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 1992 transition count 2648
Reduce places removed 448 places and 0 transitions.
Iterating post reduction 1 with 448 rules applied. Total rules applied 896 place count 1544 transition count 2648
Applied a total of 896 rules in 128 ms. Remains 1544 /1992 variables (removed 448) and now considering 2648/3096 (removed 448) transitions.
[2023-03-17 07:06:30] [INFO ] Flow matrix only has 2312 transitions (discarded 336 similar events)
// Phase 1: matrix 2312 rows 1544 cols
[2023-03-17 07:06:30] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-17 07:06:31] [INFO ] Implicit Places using invariants in 972 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 981 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1536/1992 places, 2648/3096 transitions.
Applied a total of 0 rules in 70 ms. Remains 1536 /1536 variables (removed 0) and now considering 2648/2648 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1179 ms. Remains : 1536/1992 places, 2648/3096 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s688 s689 s690 s691 s692 s693 s694 s695) (ADD s632 s633 s634 s635 s636 s637 s638 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 ...], 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 2303 ms.
Stack based approach found an accepted trace after 482 steps with 0 reset with depth 483 and stack size 478 in 10 ms.
FORMULA Peterson-COL-7-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-08 finished in 3681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(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 40 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 07:06:34] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 07:06:34] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-17 07:06:35] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2023-03-17 07:06:35] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:06:35] [INFO ] Invariant cache hit.
[2023-03-17 07:06:36] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:06:37] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned []
Implicit Place search using SMT with State Equation took 3380 ms to find 0 implicit places.
[2023-03-17 07:06:37] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:06:37] [INFO ] Invariant cache hit.
[2023-03-17 07:06:40] [INFO ] Dead Transitions using invariants and state equation in 2822 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6253 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ (ADD s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2641 ms.
Product exploration explored 100000 steps with 50000 reset in 2511 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-7-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLCardinality-09 finished in 11736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 560 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 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2256
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1680 place count 1152 transition count 2256
Applied a total of 1680 rules in 130 ms. Remains 1152 /1992 variables (removed 840) and now considering 2256/3096 (removed 840) transitions.
[2023-03-17 07:06:46] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2023-03-17 07:06:46] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-17 07:06:46] [INFO ] Implicit Places using invariants in 758 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 766 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1144/1992 places, 2256/3096 transitions.
Applied a total of 0 rules in 39 ms. Remains 1144 /1144 variables (removed 0) and now considering 2256/2256 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 935 ms. Remains : 1144/1992 places, 2256/3096 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s696 s697 s698 s699 s700 s701 s702 s703 s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s720 s721 s722 s723 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5905 reset in 2026 ms.
Stack based approach found an accepted trace after 220 steps with 12 reset with depth 11 and stack size 11 in 6 ms.
FORMULA Peterson-COL-7-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLCardinality-10 finished in 3103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 504 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 46 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 07:06:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 07:06:49] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-17 07:06:50] [INFO ] Implicit Places using invariants in 1072 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1077 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 51 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 1174 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 2 (ADD s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155...], 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][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-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLCardinality-11 finished in 1350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(p1)||F(p2))))'
Support contains 560 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 40 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 07:06:50] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:06:50] [INFO ] Invariant cache hit.
[2023-03-17 07:06:51] [INFO ] Implicit Places using invariants in 992 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 995 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 40 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 1076 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(LEQ (ADD s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2876 ms.
Product exploration explored 100000 steps with 50000 reset in 2660 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 p2 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1 (NOT p2))))
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-7-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLCardinality-12 finished in 6942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&X((p2 U p0)))))'
Support contains 968 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 28 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 07:06:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:06:57] [INFO ] Invariant cache hit.
[2023-03-17 07:06:58] [INFO ] Implicit Places using invariants in 968 ms returned []
[2023-03-17 07:06:58] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:06:58] [INFO ] Invariant cache hit.
[2023-03-17 07:06:59] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 07:07:13] [INFO ] Implicit Places using invariants and state equation in 14829 ms returned []
Implicit Place search using SMT with State Equation took 15818 ms to find 0 implicit places.
[2023-03-17 07:07:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 07:07:13] [INFO ] Invariant cache hit.
[2023-03-17 07:07:16] [INFO ] Dead Transitions using invariants and state equation in 3130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18980 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : Peterson-COL-7-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s696 s697 s698 s699 s700 s701 s702 s703) (ADD s0 s1 s2 s3 s4 s5 s6 s7)), p1:(LEQ (ADD s1544 s1545 s1546 s1547 s1548 s1549 s1550 s1551 s1552 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2693 ms.
Product exploration explored 100000 steps with 50000 reset in 2382 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 p1 (NOT p2)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 12 factoid took 251 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-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-7-LTLCardinality-14 finished in 24639 ms.
All properties solved by simple procedures.
Total runtime 284944 ms.

BK_STOP 1679036843007

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Peterson-COL-7, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536600595"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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