Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 13 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 00:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 539K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716958057878

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 04:47:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 04:47:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:47:39] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-29 04:47:39] [INFO ] Transformed 1903 places.
[2024-05-29 04:47:39] [INFO ] Transformed 1403 transitions.
[2024-05-29 04:47:39] [INFO ] Found NUPN structural information;
[2024-05-29 04:47:39] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-100A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 197 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:47:50] [INFO ] Computed 901 invariants in 23 ms
[2024-05-29 04:47:52] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2024-05-29 04:47:52] [INFO ] Invariant cache hit.
[2024-05-29 04:47:54] [INFO ] Implicit Places using invariants and state equation in 2896 ms returned []
Implicit Place search using SMT with State Equation took 14800 ms to find 0 implicit places.
[2024-05-29 04:47:54] [INFO ] Invariant cache hit.
[2024-05-29 04:47:56] [INFO ] Dead Transitions using invariants and state equation in 1190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16191 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Support contains 69 out of 1903 places after structural reductions.
[2024-05-29 04:47:56] [INFO ] Flatten gal took : 291 ms
[2024-05-29 04:47:56] [INFO ] Flatten gal took : 177 ms
[2024-05-29 04:47:57] [INFO ] Input system was already deterministic with 1402 transitions.
Support contains 65 out of 1903 places (down from 69) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 35) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2024-05-29 04:47:58] [INFO ] Invariant cache hit.
[2024-05-29 04:47:59] [INFO ] [Real]Absence check using 901 positive place invariants in 168 ms returned sat
[2024-05-29 04:48:04] [INFO ] After 6654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2024-05-29 04:48:08] [INFO ] [Nat]Absence check using 901 positive place invariants in 169 ms returned sat
[2024-05-29 04:48:26] [INFO ] After 17720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2024-05-29 04:48:36] [INFO ] Deduced a trap composed of 3 places in 6818 ms of which 5437 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:48:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:48:36] [INFO ] After 31833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:29
Parikh walk visited 6 properties in 9931 ms.
Support contains 41 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 35 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 191 times.
Drop transitions removed 191 transitions
Iterating global reduction 0 with 191 rules applied. Total rules applied 195 place count 1901 transition count 1400
Applied a total of 195 rules in 642 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 643 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 82960 steps, run timeout after 3003 ms. (steps per millisecond=27 ) properties seen :{1=1, 2=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 13=1, 15=1, 16=1, 17=1, 18=1, 21=1}
Probabilistic random walk after 82960 steps, saw 81556 distinct states, run finished after 3004 ms. (steps per millisecond=27 ) properties seen :16
Running SMT prover for 7 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:48:50] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 04:48:51] [INFO ] [Real]Absence check using 901 positive place invariants in 170 ms returned sat
[2024-05-29 04:48:53] [INFO ] After 2337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 04:48:53] [INFO ] [Nat]Absence check using 901 positive place invariants in 160 ms returned sat
[2024-05-29 04:48:55] [INFO ] After 1553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 04:48:55] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-29 04:48:57] [INFO ] After 1517ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-29 04:48:58] [INFO ] After 2644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 946 ms.
[2024-05-29 04:48:59] [INFO ] After 6010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 2010 ms.
Support contains 11 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1901 transition count 1400
Applied a total of 8 rules in 146 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 102379 steps, run timeout after 3003 ms. (steps per millisecond=34 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 6=1}
Probabilistic random walk after 102379 steps, saw 100876 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :6
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:49:05] [INFO ] Computed 901 invariants in 12 ms
[2024-05-29 04:49:06] [INFO ] [Real]Absence check using 901 positive place invariants in 166 ms returned sat
[2024-05-29 04:49:07] [INFO ] After 1368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:49:07] [INFO ] [Nat]Absence check using 901 positive place invariants in 167 ms returned sat
[2024-05-29 04:49:09] [INFO ] After 2197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:49:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 04:49:10] [INFO ] After 476ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:49:10] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-29 04:49:10] [INFO ] After 3423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 209 ms.
Support contains 3 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 69 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 148399 steps, run timeout after 3002 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148399 steps, saw 146493 distinct states, run finished after 3003 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:49:14] [INFO ] Invariant cache hit.
[2024-05-29 04:49:14] [INFO ] [Real]Absence check using 901 positive place invariants in 164 ms returned sat
[2024-05-29 04:49:15] [INFO ] After 1322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:49:15] [INFO ] [Nat]Absence check using 901 positive place invariants in 169 ms returned sat
[2024-05-29 04:49:17] [INFO ] After 1249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:49:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 04:49:17] [INFO ] After 632ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:49:17] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-29 04:49:18] [INFO ] After 2624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 214 ms.
Support contains 3 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 69 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 61 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 04:49:18] [INFO ] Invariant cache hit.
[2024-05-29 04:49:20] [INFO ] Implicit Places using invariants in 1673 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1679 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 71 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:49:20] [INFO ] Computed 899 invariants in 5 ms
[2024-05-29 04:49:21] [INFO ] Implicit Places using invariants in 1579 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1581 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 205 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:49:21] [INFO ] Computed 898 invariants in 9 ms
[2024-05-29 04:49:23] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2024-05-29 04:49:23] [INFO ] Invariant cache hit.
[2024-05-29 04:49:24] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:49:27] [INFO ] Implicit Places using invariants and state equation in 4903 ms returned []
Implicit Place search using SMT with State Equation took 6047 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9644 ms. Remains : 1896/1901 places, 1398/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 147641 steps, run timeout after 3003 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147641 steps, saw 145755 distinct states, run finished after 3003 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:49:31] [INFO ] Invariant cache hit.
[2024-05-29 04:49:31] [INFO ] [Real]Absence check using 898 positive place invariants in 165 ms returned sat
[2024-05-29 04:49:32] [INFO ] After 1256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:49:32] [INFO ] [Nat]Absence check using 898 positive place invariants in 164 ms returned sat
[2024-05-29 04:49:34] [INFO ] After 1559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:49:34] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:49:34] [INFO ] After 532ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:49:35] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-29 04:49:35] [INFO ] After 2802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 168 ms.
Support contains 3 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 71 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 143 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 04:49:35] [INFO ] Invariant cache hit.
[2024-05-29 04:49:36] [INFO ] Implicit Places using invariants in 1136 ms returned []
[2024-05-29 04:49:36] [INFO ] Invariant cache hit.
[2024-05-29 04:49:37] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:49:41] [INFO ] Implicit Places using invariants and state equation in 4808 ms returned []
Implicit Place search using SMT with State Equation took 5950 ms to find 0 implicit places.
[2024-05-29 04:49:41] [INFO ] Redundant transitions in 95 ms returned []
[2024-05-29 04:49:41] [INFO ] Invariant cache hit.
[2024-05-29 04:49:42] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7143 ms. Remains : 1896/1896 places, 1398/1398 transitions.
FORMULA ShieldIIPt-PT-100A-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-100A-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-100A-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 65 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:49:47] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 04:49:48] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2024-05-29 04:49:48] [INFO ] Invariant cache hit.
[2024-05-29 04:49:51] [INFO ] Implicit Places using invariants and state equation in 2744 ms returned []
Implicit Place search using SMT with State Equation took 4196 ms to find 0 implicit places.
[2024-05-29 04:49:51] [INFO ] Invariant cache hit.
[2024-05-29 04:49:52] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5552 ms. Remains : 1903/1903 places, 1402/1402 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-00 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:(EQ s413 0), p0:(OR (EQ s120 0) (EQ s129 0))], 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 6471 ms.
Product exploration explored 100000 steps with 50000 reset in 6545 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 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 : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-00 finished in 18928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(p2)&&X(X(G(p3)))&&p1))))'
Support contains 8 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 56 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:50:06] [INFO ] Invariant cache hit.
[2024-05-29 04:50:07] [INFO ] Implicit Places using invariants in 1411 ms returned []
[2024-05-29 04:50:07] [INFO ] Invariant cache hit.
[2024-05-29 04:50:10] [INFO ] Implicit Places using invariants and state equation in 2866 ms returned []
Implicit Place search using SMT with State Equation took 4289 ms to find 0 implicit places.
[2024-05-29 04:50:10] [INFO ] Invariant cache hit.
[2024-05-29 04:50:11] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5583 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s1152 1) (EQ s1177 1)), p1:(AND (EQ s183 1) (EQ s208 1)), p2:(AND (EQ s806 1) (EQ s817 1)), p3:(OR (EQ s1718 0) (EQ s1729 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1473 ms.
Stack based approach found an accepted trace after 335 steps with 0 reset with depth 336 and stack size 336 in 14 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-01 finished in 7383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (p1&&X(G((p1||X(G(p2))))))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 60 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:50:13] [INFO ] Invariant cache hit.
[2024-05-29 04:50:15] [INFO ] Implicit Places using invariants in 1339 ms returned []
[2024-05-29 04:50:15] [INFO ] Invariant cache hit.
[2024-05-29 04:50:17] [INFO ] Implicit Places using invariants and state equation in 2869 ms returned []
Implicit Place search using SMT with State Equation took 4210 ms to find 0 implicit places.
[2024-05-29 04:50:17] [INFO ] Invariant cache hit.
[2024-05-29 04:50:19] [INFO ] Dead Transitions using invariants and state equation in 1240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5515 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={1} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={1} source=6 dest: 3}, { cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s1840 1), p0:(EQ s892 1), p2:(NEQ s624 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1444 ms.
Product exploration explored 100000 steps with 0 reset in 1888 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 163 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 04:50:24] [INFO ] Invariant cache hit.
[2024-05-29 04:50:25] [INFO ] [Real]Absence check using 901 positive place invariants in 163 ms returned sat
[2024-05-29 04:50:26] [INFO ] After 1817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 04:50:26] [INFO ] [Nat]Absence check using 901 positive place invariants in 171 ms returned sat
[2024-05-29 04:50:28] [INFO ] After 1049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 04:50:28] [INFO ] After 1647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 376 ms.
[2024-05-29 04:50:29] [INFO ] After 2826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 213 ms.
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1901 transition count 1400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 203 place count 1900 transition count 1399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 205 place count 1898 transition count 1399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 205 place count 1898 transition count 1398
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 207 place count 1897 transition count 1398
Applied a total of 207 rules in 306 ms. Remains 1897 /1903 variables (removed 6) and now considering 1398/1402 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 1897/1903 places, 1398/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Finished probabilistic random walk after 53588 steps, run visited all 6 properties in 1564 ms. (steps per millisecond=34 )
Probabilistic random walk after 53588 steps, saw 52399 distinct states, run finished after 1566 ms. (steps per millisecond=34 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p0), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 15 factoid took 565 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 58 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:50:33] [INFO ] Invariant cache hit.
[2024-05-29 04:50:34] [INFO ] Implicit Places using invariants in 1437 ms returned []
[2024-05-29 04:50:34] [INFO ] Invariant cache hit.
[2024-05-29 04:50:37] [INFO ] Implicit Places using invariants and state equation in 2688 ms returned []
Implicit Place search using SMT with State Equation took 4129 ms to find 0 implicit places.
[2024-05-29 04:50:37] [INFO ] Invariant cache hit.
[2024-05-29 04:50:38] [INFO ] Dead Transitions using invariants and state equation in 1239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5427 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 155 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 04:50:40] [INFO ] Invariant cache hit.
[2024-05-29 04:50:40] [INFO ] [Real]Absence check using 901 positive place invariants in 170 ms returned sat
[2024-05-29 04:50:42] [INFO ] After 1841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 04:50:42] [INFO ] [Nat]Absence check using 901 positive place invariants in 168 ms returned sat
[2024-05-29 04:50:43] [INFO ] After 1087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 04:50:44] [INFO ] After 1688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 367 ms.
[2024-05-29 04:50:44] [INFO ] After 2863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 287 ms.
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1901 transition count 1400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 203 place count 1900 transition count 1399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 205 place count 1898 transition count 1399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 205 place count 1898 transition count 1398
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 207 place count 1897 transition count 1398
Applied a total of 207 rules in 279 ms. Remains 1897 /1903 variables (removed 6) and now considering 1398/1402 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 1897/1903 places, 1398/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Finished probabilistic random walk after 53588 steps, run visited all 6 properties in 1620 ms. (steps per millisecond=33 )
Probabilistic random walk after 53588 steps, saw 52399 distinct states, run finished after 1622 ms. (steps per millisecond=33 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p0), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 15 factoid took 574 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1495 ms.
Product exploration explored 100000 steps with 0 reset in 1897 ms.
Applying partial POR strategy [false, true, true, false, true, false, false]
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 344 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:50:53] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:50:53] [INFO ] Computed 901 invariants in 4 ms
[2024-05-29 04:50:55] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1601 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin7850292815060729627
[2024-05-29 04:50:55] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7850292815060729627
Running compilation step : cd /tmp/ltsmin7850292815060729627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7850292815060729627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7850292815060729627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 51 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:50:58] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 04:50:59] [INFO ] Implicit Places using invariants in 1339 ms returned []
[2024-05-29 04:50:59] [INFO ] Invariant cache hit.
[2024-05-29 04:51:02] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned []
Implicit Place search using SMT with State Equation took 4193 ms to find 0 implicit places.
[2024-05-29 04:51:02] [INFO ] Invariant cache hit.
[2024-05-29 04:51:03] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5482 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin6385766520666738491
[2024-05-29 04:51:03] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6385766520666738491
Running compilation step : cd /tmp/ltsmin6385766520666738491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2770 ms.
Running link step : cd /tmp/ltsmin6385766520666738491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6385766520666738491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3754736917248468057.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:51:18] [INFO ] Flatten gal took : 107 ms
[2024-05-29 04:51:19] [INFO ] Flatten gal took : 107 ms
[2024-05-29 04:51:19] [INFO ] Time to serialize gal into /tmp/LTL2555515699195838092.gal : 14 ms
[2024-05-29 04:51:19] [INFO ] Time to serialize properties into /tmp/LTL13368765776365331612.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2555515699195838092.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14605893134983540218.hoa' '-atoms' '/tmp/LTL13368765776365331612.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13368765776365331612.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14605893134983540218.hoa
Detected timeout of ITS tools.
[2024-05-29 04:51:34] [INFO ] Flatten gal took : 100 ms
[2024-05-29 04:51:34] [INFO ] Flatten gal took : 97 ms
[2024-05-29 04:51:34] [INFO ] Time to serialize gal into /tmp/LTL7380869845012036232.gal : 24 ms
[2024-05-29 04:51:34] [INFO ] Time to serialize properties into /tmp/LTL12665473916732091815.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7380869845012036232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12665473916732091815.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("(p892==1)")))U(("(p1840==0)")&&(X(G(("(p1840==0)")||(X(G("(p624==0)")))))))))
Formula 0 simplified : FG!"(p892==1)" R (!"(p1840==0)" | XF(!"(p1840==0)" & XF!"(p624==0)"))
Detected timeout of ITS tools.
[2024-05-29 04:51:49] [INFO ] Flatten gal took : 102 ms
[2024-05-29 04:51:49] [INFO ] Applying decomposition
[2024-05-29 04:51:49] [INFO ] Flatten gal took : 95 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph882961074421279184.txt' '-o' '/tmp/graph882961074421279184.bin' '-w' '/tmp/graph882961074421279184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph882961074421279184.bin' '-l' '-1' '-v' '-w' '/tmp/graph882961074421279184.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:51:49] [INFO ] Decomposing Gal with order
[2024-05-29 04:51:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:51:50] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 04:51:50] [INFO ] Flatten gal took : 143 ms
[2024-05-29 04:51:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 182 ms.
[2024-05-29 04:51:50] [INFO ] Time to serialize gal into /tmp/LTL8246157019804224595.gal : 42 ms
[2024-05-29 04:51:50] [INFO ] Time to serialize properties into /tmp/LTL3172292544913724093.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8246157019804224595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3172292544913724093.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i20.i1.i2.u375.p892==1)")))U(("(i40.i0.i1.u774.p1840==0)")&&(X(G(("(i40.i0.i1.u774.p1840==0)")||(X(G("(i14.i1.i1.u262.p624==...167
Formula 0 simplified : FG!"(i20.i1.i2.u375.p892==1)" R (!"(i40.i0.i1.u774.p1840==0)" | XF(!"(i40.i0.i1.u774.p1840==0)" & XF!"(i14.i1.i1.u262.p624==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
260 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.8824,74616,1,0,110034,621,6464,235630,122,3660,173345
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLFireability-02 finished in 100041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(p1)&&p0))))))'
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 41 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:51:53] [INFO ] Invariant cache hit.
[2024-05-29 04:51:55] [INFO ] Implicit Places using invariants in 1348 ms returned []
[2024-05-29 04:51:55] [INFO ] Invariant cache hit.
[2024-05-29 04:51:57] [INFO ] Implicit Places using invariants and state equation in 2853 ms returned []
Implicit Place search using SMT with State Equation took 4203 ms to find 0 implicit places.
[2024-05-29 04:51:57] [INFO ] Invariant cache hit.
[2024-05-29 04:51:59] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5471 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s690 1) (EQ s699 1) (EQ s1515 1) (EQ s1530 1)), p1:(OR (EQ s670 0) (EQ s681 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-03 finished in 5706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 112 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:51:59] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 04:52:01] [INFO ] Implicit Places using invariants in 1450 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1452 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 66 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:52:01] [INFO ] Computed 899 invariants in 10 ms
[2024-05-29 04:52:02] [INFO ] Implicit Places using invariants in 1382 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1384 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 110 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:52:02] [INFO ] Computed 898 invariants in 4 ms
[2024-05-29 04:52:04] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2024-05-29 04:52:04] [INFO ] Invariant cache hit.
[2024-05-29 04:52:06] [INFO ] Implicit Places using invariants and state equation in 2836 ms returned []
Implicit Place search using SMT with State Equation took 4291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7415 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s1353 1) (NEQ s1366 1))], 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 1415 ms.
Product exploration explored 100000 steps with 0 reset in 1855 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21271 steps, run visited all 1 properties in 414 ms. (steps per millisecond=51 )
Probabilistic random walk after 21271 steps, saw 20664 distinct states, run finished after 415 ms. (steps per millisecond=51 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 57 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 04:52:11] [INFO ] Invariant cache hit.
[2024-05-29 04:52:12] [INFO ] Implicit Places using invariants in 1415 ms returned []
[2024-05-29 04:52:12] [INFO ] Invariant cache hit.
[2024-05-29 04:52:15] [INFO ] Implicit Places using invariants and state equation in 2806 ms returned []
Implicit Place search using SMT with State Equation took 4223 ms to find 0 implicit places.
[2024-05-29 04:52:15] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 04:52:15] [INFO ] Invariant cache hit.
[2024-05-29 04:52:16] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5442 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21271 steps, run visited all 1 properties in 414 ms. (steps per millisecond=51 )
Probabilistic random walk after 21271 steps, saw 20664 distinct states, run finished after 416 ms. (steps per millisecond=51 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1394 ms.
Product exploration explored 100000 steps with 0 reset in 1864 ms.
Built C files in :
/tmp/ltsmin8932461768076780207
[2024-05-29 04:52:20] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2024-05-29 04:52:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:52:20] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2024-05-29 04:52:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:52:21] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2024-05-29 04:52:21] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:52:21] [INFO ] Built C files in 369ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8932461768076780207
Running compilation step : cd /tmp/ltsmin8932461768076780207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8932461768076780207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8932461768076780207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 81 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 04:52:24] [INFO ] Invariant cache hit.
[2024-05-29 04:52:25] [INFO ] Implicit Places using invariants in 1465 ms returned []
[2024-05-29 04:52:25] [INFO ] Invariant cache hit.
[2024-05-29 04:52:28] [INFO ] Implicit Places using invariants and state equation in 2661 ms returned []
Implicit Place search using SMT with State Equation took 4128 ms to find 0 implicit places.
[2024-05-29 04:52:28] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-29 04:52:28] [INFO ] Invariant cache hit.
[2024-05-29 04:52:29] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5333 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin8300841271447479574
[2024-05-29 04:52:29] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2024-05-29 04:52:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:52:29] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2024-05-29 04:52:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:52:30] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2024-05-29 04:52:30] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:52:30] [INFO ] Built C files in 355ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8300841271447479574
Running compilation step : cd /tmp/ltsmin8300841271447479574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8300841271447479574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8300841271447479574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 04:52:33] [INFO ] Flatten gal took : 92 ms
[2024-05-29 04:52:33] [INFO ] Flatten gal took : 91 ms
[2024-05-29 04:52:33] [INFO ] Time to serialize gal into /tmp/LTL4049634353390983074.gal : 7 ms
[2024-05-29 04:52:33] [INFO ] Time to serialize properties into /tmp/LTL689574878752992004.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4049634353390983074.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6784879504346744939.hoa' '-atoms' '/tmp/LTL689574878752992004.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL689574878752992004.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6784879504346744939.hoa
Detected timeout of ITS tools.
[2024-05-29 04:52:48] [INFO ] Flatten gal took : 88 ms
[2024-05-29 04:52:48] [INFO ] Flatten gal took : 90 ms
[2024-05-29 04:52:48] [INFO ] Time to serialize gal into /tmp/LTL8628011326460969592.gal : 12 ms
[2024-05-29 04:52:48] [INFO ] Time to serialize properties into /tmp/LTL9333173710265537853.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8628011326460969592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9333173710265537853.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p1353==0)||(p1366==0))"))))
Formula 0 simplified : GF!"((p1353==0)||(p1366==0))"
Detected timeout of ITS tools.
[2024-05-29 04:53:03] [INFO ] Flatten gal took : 85 ms
[2024-05-29 04:53:03] [INFO ] Applying decomposition
[2024-05-29 04:53:03] [INFO ] Flatten gal took : 87 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5564507303546563126.txt' '-o' '/tmp/graph5564507303546563126.bin' '-w' '/tmp/graph5564507303546563126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5564507303546563126.bin' '-l' '-1' '-v' '-w' '/tmp/graph5564507303546563126.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:53:03] [INFO ] Decomposing Gal with order
[2024-05-29 04:53:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:53:04] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 04:53:04] [INFO ] Flatten gal took : 75 ms
[2024-05-29 04:53:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 150 ms.
[2024-05-29 04:53:04] [INFO ] Time to serialize gal into /tmp/LTL17865508810087587932.gal : 22 ms
[2024-05-29 04:53:04] [INFO ] Time to serialize properties into /tmp/LTL9075641412453794372.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17865508810087587932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9075641412453794372.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i30.i0.i1.u569.p1353==0)||(i30.i0.i3.u574.p1366==0))"))))
Formula 0 simplified : GF!"((i30.i0.i1.u569.p1353==0)||(i30.i0.i3.u574.p1366==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17417420339133436586
[2024-05-29 04:53:19] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17417420339133436586
Running compilation step : cd /tmp/ltsmin17417420339133436586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2797 ms.
Running link step : cd /tmp/ltsmin17417420339133436586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17417420339133436586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-LTLFireability-04 finished in 95022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((X(p2)&&p1))||G(F(p3))))))'
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 44 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:53:34] [INFO ] Computed 901 invariants in 7 ms
[2024-05-29 04:53:35] [INFO ] Implicit Places using invariants in 1426 ms returned []
[2024-05-29 04:53:35] [INFO ] Invariant cache hit.
[2024-05-29 04:53:38] [INFO ] Implicit Places using invariants and state equation in 2806 ms returned []
Implicit Place search using SMT with State Equation took 4233 ms to find 0 implicit places.
[2024-05-29 04:53:38] [INFO ] Invariant cache hit.
[2024-05-29 04:53:39] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5478 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s1513 1) (EQ s1538 1)), p1:(AND (EQ s155 1) (EQ s172 1)), p3:(AND (EQ s155 1) (EQ s172 1)), p2:(AND (EQ s1343 1) (EQ s1349 1) (EQ s1351 1))], 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 0 reset in 1443 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-07 finished in 7054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&(G((F(p2)&&p1))||F(p3)))))))'
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 46 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:53:41] [INFO ] Invariant cache hit.
[2024-05-29 04:53:42] [INFO ] Implicit Places using invariants in 1403 ms returned []
[2024-05-29 04:53:42] [INFO ] Invariant cache hit.
[2024-05-29 04:53:45] [INFO ] Implicit Places using invariants and state equation in 2730 ms returned []
Implicit Place search using SMT with State Equation took 4134 ms to find 0 implicit places.
[2024-05-29 04:53:45] [INFO ] Invariant cache hit.
[2024-05-29 04:53:46] [INFO ] Dead Transitions using invariants and state equation in 1223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5404 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s252 0) (EQ s263 0)), p1:(AND (EQ s1096 1) (EQ s1102 1) (EQ s1104 1)), p3:(OR (EQ s1618 0) (EQ s1635 0)), p2:(AND (EQ s1096 1) (EQ s1102 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 3851 ms.
Product exploration explored 100000 steps with 25000 reset in 4185 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 8 states, 13 edges and 4 AP (stutter sensitive) to 8 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 04:53:56] [INFO ] Invariant cache hit.
[2024-05-29 04:53:57] [INFO ] [Real]Absence check using 901 positive place invariants in 169 ms returned sat
[2024-05-29 04:53:58] [INFO ] After 1838ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-29 04:53:59] [INFO ] [Nat]Absence check using 901 positive place invariants in 173 ms returned sat
[2024-05-29 04:54:00] [INFO ] After 1809ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-29 04:54:02] [INFO ] After 3220ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 435 ms.
[2024-05-29 04:54:02] [INFO ] After 4289ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3154 ms.
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1901 transition count 1400
Applied a total of 202 rules in 150 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 114896 steps, run timeout after 3003 ms. (steps per millisecond=38 ) properties seen :{0=1}
Probabilistic random walk after 114896 steps, saw 113286 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:54:09] [INFO ] Computed 901 invariants in 4 ms
[2024-05-29 04:54:10] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:54:10] [INFO ] [Nat]Absence check using 901 positive place invariants in 170 ms returned sat
[2024-05-29 04:54:11] [INFO ] After 1111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:54:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 04:54:12] [INFO ] After 1087ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:54:13] [INFO ] After 1363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 169 ms.
[2024-05-29 04:54:13] [INFO ] After 3231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 614 ms.
Support contains 7 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 46 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 108405 steps, run timeout after 3003 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108405 steps, saw 106871 distinct states, run finished after 3004 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 04:54:17] [INFO ] Invariant cache hit.
[2024-05-29 04:54:17] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:54:18] [INFO ] [Nat]Absence check using 901 positive place invariants in 166 ms returned sat
[2024-05-29 04:54:19] [INFO ] After 1511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:54:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 04:54:20] [INFO ] After 947ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:54:21] [INFO ] After 1240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 217 ms.
[2024-05-29 04:54:21] [INFO ] After 3562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 420 ms.
Support contains 7 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 55 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 57 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 04:54:21] [INFO ] Invariant cache hit.
[2024-05-29 04:54:23] [INFO ] Implicit Places using invariants in 1487 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1490 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 58 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:54:23] [INFO ] Computed 899 invariants in 5 ms
[2024-05-29 04:54:25] [INFO ] Implicit Places using invariants in 1527 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1528 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 135 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:54:25] [INFO ] Computed 898 invariants in 14 ms
[2024-05-29 04:54:26] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2024-05-29 04:54:26] [INFO ] Invariant cache hit.
[2024-05-29 04:54:27] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:54:31] [INFO ] Implicit Places using invariants and state equation in 5089 ms returned []
Implicit Place search using SMT with State Equation took 6244 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9514 ms. Remains : 1896/1901 places, 1398/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 122777 steps, run timeout after 3003 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122777 steps, saw 121094 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 04:54:34] [INFO ] Invariant cache hit.
[2024-05-29 04:54:35] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:54:35] [INFO ] [Nat]Absence check using 898 positive place invariants in 163 ms returned sat
[2024-05-29 04:54:37] [INFO ] After 2042ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:54:37] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:54:38] [INFO ] After 745ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:54:38] [INFO ] After 1238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 415 ms.
[2024-05-29 04:54:39] [INFO ] After 4180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 347 ms.
Support contains 7 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 65 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 51 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 04:54:39] [INFO ] Invariant cache hit.
[2024-05-29 04:54:40] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2024-05-29 04:54:40] [INFO ] Invariant cache hit.
[2024-05-29 04:54:41] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:54:45] [INFO ] Implicit Places using invariants and state equation in 4785 ms returned []
Implicit Place search using SMT with State Equation took 5909 ms to find 0 implicit places.
[2024-05-29 04:54:45] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 04:54:45] [INFO ] Invariant cache hit.
[2024-05-29 04:54:46] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6948 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 1896 transition count 1398
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 1896 transition count 1300
Applied a total of 196 rules in 155 ms. Remains 1896 /1896 variables (removed 0) and now considering 1300/1398 (removed 98) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1300 rows 1896 cols
[2024-05-29 04:54:46] [INFO ] Computed 898 invariants in 4 ms
[2024-05-29 04:54:47] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:54:47] [INFO ] [Nat]Absence check using 898 positive place invariants in 161 ms returned sat
[2024-05-29 04:54:49] [INFO ] After 1894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:54:49] [INFO ] After 2138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-29 04:54:49] [INFO ] After 2780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), true, (G (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (NOT p0)), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 263 ms. Reduced automaton from 8 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 63 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:54:50] [INFO ] Computed 901 invariants in 9 ms
[2024-05-29 04:54:52] [INFO ] Implicit Places using invariants in 1461 ms returned []
[2024-05-29 04:54:52] [INFO ] Invariant cache hit.
[2024-05-29 04:54:54] [INFO ] Implicit Places using invariants and state equation in 2717 ms returned []
Implicit Place search using SMT with State Equation took 4178 ms to find 0 implicit places.
[2024-05-29 04:54:54] [INFO ] Invariant cache hit.
[2024-05-29 04:54:56] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5523 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 04:54:57] [INFO ] Invariant cache hit.
[2024-05-29 04:54:57] [INFO ] [Real]Absence check using 901 positive place invariants in 165 ms returned sat
[2024-05-29 04:54:58] [INFO ] After 1705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 04:54:59] [INFO ] [Nat]Absence check using 901 positive place invariants in 163 ms returned sat
[2024-05-29 04:55:01] [INFO ] After 1600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 04:55:01] [INFO ] After 2587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 442 ms.
[2024-05-29 04:55:02] [INFO ] After 3628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 708 ms.
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1901 transition count 1400
Applied a total of 202 rules in 155 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 123091 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{1=1}
Probabilistic random walk after 123091 steps, saw 121391 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:55:06] [INFO ] Computed 901 invariants in 6 ms
[2024-05-29 04:55:07] [INFO ] [Real]Absence check using 901 positive place invariants in 176 ms returned sat
[2024-05-29 04:55:08] [INFO ] After 1446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:55:08] [INFO ] [Nat]Absence check using 901 positive place invariants in 164 ms returned sat
[2024-05-29 04:55:10] [INFO ] After 1166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:55:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 04:55:10] [INFO ] After 613ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:55:10] [INFO ] After 875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2024-05-29 04:55:11] [INFO ] After 2793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 382 ms.
Support contains 7 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 49 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 125367 steps, run timeout after 3002 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125367 steps, saw 123645 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 04:55:15] [INFO ] Invariant cache hit.
[2024-05-29 04:55:15] [INFO ] [Real]Absence check using 901 positive place invariants in 170 ms returned sat
[2024-05-29 04:55:16] [INFO ] After 1371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:55:16] [INFO ] [Nat]Absence check using 901 positive place invariants in 166 ms returned sat
[2024-05-29 04:55:18] [INFO ] After 1404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:55:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-29 04:55:19] [INFO ] After 820ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:55:19] [INFO ] After 1074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 182 ms.
[2024-05-29 04:55:19] [INFO ] After 3222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 501 ms.
Support contains 7 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 49 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 49 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 04:55:20] [INFO ] Invariant cache hit.
[2024-05-29 04:55:21] [INFO ] Implicit Places using invariants in 1688 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1691 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 59 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:55:21] [INFO ] Computed 899 invariants in 4 ms
[2024-05-29 04:55:23] [INFO ] Implicit Places using invariants in 1674 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1676 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 95 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:55:23] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 04:55:24] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2024-05-29 04:55:24] [INFO ] Invariant cache hit.
[2024-05-29 04:55:25] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:55:29] [INFO ] Implicit Places using invariants and state equation in 4822 ms returned []
Implicit Place search using SMT with State Equation took 5871 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9441 ms. Remains : 1896/1901 places, 1398/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 128522 steps, run timeout after 3002 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128522 steps, saw 126785 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 04:55:33] [INFO ] Invariant cache hit.
[2024-05-29 04:55:33] [INFO ] [Real]Absence check using 898 positive place invariants in 182 ms returned sat
[2024-05-29 04:55:34] [INFO ] After 1283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:55:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 156 ms returned sat
[2024-05-29 04:55:36] [INFO ] After 1707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:55:36] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:55:37] [INFO ] After 742ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 04:55:37] [INFO ] After 1112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 286 ms.
[2024-05-29 04:55:37] [INFO ] After 3521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 398 ms.
Support contains 7 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 61 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 47 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 04:55:38] [INFO ] Invariant cache hit.
[2024-05-29 04:55:39] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2024-05-29 04:55:39] [INFO ] Invariant cache hit.
[2024-05-29 04:55:40] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 04:55:44] [INFO ] Implicit Places using invariants and state equation in 5180 ms returned []
Implicit Place search using SMT with State Equation took 6286 ms to find 0 implicit places.
[2024-05-29 04:55:44] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-29 04:55:44] [INFO ] Invariant cache hit.
[2024-05-29 04:55:45] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7343 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 1896 transition count 1398
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 1896 transition count 1300
Applied a total of 196 rules in 152 ms. Remains 1896 /1896 variables (removed 0) and now considering 1300/1398 (removed 98) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1300 rows 1896 cols
[2024-05-29 04:55:45] [INFO ] Computed 898 invariants in 8 ms
[2024-05-29 04:55:46] [INFO ] [Real]Absence check using 898 positive place invariants in 164 ms returned sat
[2024-05-29 04:55:46] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 04:55:46] [INFO ] [Nat]Absence check using 898 positive place invariants in 169 ms returned sat
[2024-05-29 04:55:48] [INFO ] After 1626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 04:55:48] [INFO ] After 1881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-29 04:55:48] [INFO ] After 2533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p3 (NOT p1) p0), true]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p3))), (F (NOT p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p3)))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 25000 reset in 3883 ms.
Product exploration explored 100000 steps with 25000 reset in 4195 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 119 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:55:58] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:55:58] [INFO ] Computed 901 invariants in 7 ms
[2024-05-29 04:55:59] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1397 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin1589225703353764746
[2024-05-29 04:55:59] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1589225703353764746
Running compilation step : cd /tmp/ltsmin1589225703353764746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2803 ms.
Running link step : cd /tmp/ltsmin1589225703353764746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1589225703353764746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9734227348575579891.hoa' '--buchi-type=spotba'
LTSmin run took 1298 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-100A-LTLFireability-08 finished in 142180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&X(!p2))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 47 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:56:03] [INFO ] Computed 901 invariants in 6 ms
[2024-05-29 04:56:05] [INFO ] Implicit Places using invariants in 1455 ms returned []
[2024-05-29 04:56:05] [INFO ] Invariant cache hit.
[2024-05-29 04:56:08] [INFO ] Implicit Places using invariants and state equation in 2884 ms returned []
Implicit Place search using SMT with State Equation took 4339 ms to find 0 implicit places.
[2024-05-29 04:56:08] [INFO ] Invariant cache hit.
[2024-05-29 04:56:09] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5633 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 117 ms :[p2, true, (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s1650 1), p0:(AND (EQ s1773 1) (EQ s1782 1)), p2:(AND (EQ s1737 1) (EQ s1748 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 ShieldIIPt-PT-100A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-10 finished in 5772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G(p0)))&&G((p0 U X(p1))))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 113 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 04:56:09] [INFO ] Computed 901 invariants in 6 ms
[2024-05-29 04:56:11] [INFO ] Implicit Places using invariants in 1433 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1435 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 68 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 04:56:11] [INFO ] Computed 899 invariants in 5 ms
[2024-05-29 04:56:12] [INFO ] Implicit Places using invariants in 1416 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1417 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 99 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 04:56:12] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 04:56:14] [INFO ] Implicit Places using invariants in 1420 ms returned []
[2024-05-29 04:56:14] [INFO ] Invariant cache hit.
[2024-05-29 04:56:16] [INFO ] Implicit Places using invariants and state equation in 2637 ms returned []
Implicit Place search using SMT with State Equation took 4059 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7192 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0, 1} source=1 dest: 5}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 6}, { cond=true, acceptance={1} source=1 dest: 7}, { cond=p0, acceptance={0, 1} source=1 dest: 8}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p1), acceptance={1} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 2}, { cond=true, acceptance={1} source=3 dest: 3}, { cond=p0, acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}, { cond=(NOT p0), acceptance={0, 1} source=5 dest: 5}, { cond=(NOT p0), acceptance={0, 1} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 7}, { cond=(NOT p0), acceptance={1} source=5 dest: 7}, { cond=p0, acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=7 dest: 2}, { cond=(NOT p0), acceptance={1} source=7 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 2}]], initial=0, aps=[p0:(AND (EQ s137 1) (EQ s150 1)), p1:(AND (EQ s248 1) (EQ s137 1) (EQ s150 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1427 ms.
Stack based approach found an accepted trace after 285 steps with 0 reset with depth 286 and stack size 286 in 6 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-11 finished in 8991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((p0 U p1) U !p2))||(G(p1) U p0))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 50 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 04:56:18] [INFO ] Computed 901 invariants in 3 ms
[2024-05-29 04:56:19] [INFO ] Implicit Places using invariants in 1424 ms returned []
[2024-05-29 04:56:19] [INFO ] Invariant cache hit.
[2024-05-29 04:56:22] [INFO ] Implicit Places using invariants and state equation in 2825 ms returned []
Implicit Place search using SMT with State Equation took 4251 ms to find 0 implicit places.
[2024-05-29 04:56:22] [INFO ] Invariant cache hit.
[2024-05-29 04:56:24] [INFO ] Dead Transitions using invariants and state equation in 1228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5532 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s155 1) (EQ s172 1)), p1:(EQ s1572 1), p2:(AND (EQ s1002 1) (EQ s1017 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4726 ms.
Product exploration explored 100000 steps with 33333 reset in 4982 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-12 finished in 15549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(F(p1))))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 43 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 04:56:34] [INFO ] Invariant cache hit.
[2024-05-29 04:56:35] [INFO ] Implicit Places using invariants in 1424 ms returned []
[2024-05-29 04:56:35] [INFO ] Invariant cache hit.
[2024-05-29 04:56:38] [INFO ] Implicit Places using invariants and state equation in 2853 ms returned []
Implicit Place search using SMT with State Equation took 4279 ms to find 0 implicit places.
[2024-05-29 04:56:38] [INFO ] Invariant cache hit.
[2024-05-29 04:56:39] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5570 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (EQ s63 1) (EQ s72 1)), p1:(AND (EQ s1647 1) (EQ s1653 1) (EQ s1655 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-15 finished in 5800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-29 04:56:39] [INFO ] Flatten gal took : 86 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10677954870287445153
[2024-05-29 04:56:40] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2024-05-29 04:56:40] [INFO ] Applying decomposition
[2024-05-29 04:56:40] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:56:40] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2024-05-29 04:56:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:56:40] [INFO ] Flatten gal took : 87 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11295119857208694911.txt' '-o' '/tmp/graph11295119857208694911.bin' '-w' '/tmp/graph11295119857208694911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11295119857208694911.bin' '-l' '-1' '-v' '-w' '/tmp/graph11295119857208694911.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:56:40] [INFO ] Decomposing Gal with order
[2024-05-29 04:56:40] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2024-05-29 04:56:40] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:56:40] [INFO ] Built C files in 357ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10677954870287445153
Running compilation step : cd /tmp/ltsmin10677954870287445153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 04:56:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:56:40] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 04:56:40] [INFO ] Flatten gal took : 81 ms
[2024-05-29 04:56:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 56 ms.
[2024-05-29 04:56:40] [INFO ] Time to serialize gal into /tmp/LTLFireability14109694345982966270.gal : 37 ms
[2024-05-29 04:56:40] [INFO ] Time to serialize properties into /tmp/LTLFireability1211549381282068609.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14109694345982966270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1211549381282068609.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((i30.i0.i1.u569.p1353!=1)||(i30.i0.i1.u574.p1366!=1))"))))
Formula 0 simplified : GF!"((i30.i0.i1.u569.p1353!=1)||(i30.i0.i1.u574.p1366!=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 5294 ms.
Running link step : cd /tmp/ltsmin10677954870287445153;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin10677954870287445153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 183724 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 730060 ms.

BK_STOP 1716958790590

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-100A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788800213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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