Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 7.1K Feb 25 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Feb 25 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 5 18:22 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 DoubleLock-PT-p1s2-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678552077762

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s2
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 16:28:01] [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]
[2023-03-11 16:28:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:28:02] [INFO ] Load time of PNML (sax parser for PT used): 820 ms
[2023-03-11 16:28:02] [INFO ] Transformed 570 places.
[2023-03-11 16:28:02] [INFO ] Transformed 7600 transitions.
[2023-03-11 16:28:02] [INFO ] Parsed PT model containing 570 places and 7600 transitions and 30784 arcs in 1034 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 132 places in 26 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 7344/7344 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 434 transition count 7344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 433 transition count 7216
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 433 transition count 7216
Applied a total of 6 rules in 207 ms. Remains 433 /438 variables (removed 5) and now considering 7216/7344 (removed 128) transitions.
[2023-03-11 16:28:03] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2023-03-11 16:28:03] [INFO ] Computed 2 place invariants in 120 ms
[2023-03-11 16:28:04] [INFO ] Implicit Places using invariants in 1585 ms returned []
[2023-03-11 16:28:04] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:28:04] [INFO ] Invariant cache hit.
[2023-03-11 16:28:07] [INFO ] Implicit Places using invariants and state equation in 2268 ms returned []
Implicit Place search using SMT with State Equation took 3900 ms to find 0 implicit places.
[2023-03-11 16:28:07] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:28:07] [INFO ] Invariant cache hit.
[2023-03-11 16:28:13] [INFO ] Dead Transitions using invariants and state equation in 6375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/438 places, 7216/7344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10491 ms. Remains : 433/438 places, 7216/7344 transitions.
Support contains 67 out of 433 places after structural reductions.
[2023-03-11 16:28:14] [INFO ] Flatten gal took : 688 ms
[2023-03-11 16:28:14] [INFO ] Flatten gal took : 312 ms
[2023-03-11 16:28:15] [INFO ] Input system was already deterministic with 7216 transitions.
Incomplete random walk after 10003 steps, including 88 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 43) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-11 16:28:16] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:28:16] [INFO ] Invariant cache hit.
[2023-03-11 16:28:17] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 16:28:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 16:28:35] [INFO ] After 18489ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:27
[2023-03-11 16:28:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 16:28:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-11 16:29:00] [INFO ] After 24261ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :25
[2023-03-11 16:29:00] [INFO ] State equation strengthened by 400 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 16:29:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 16:29:00] [INFO ] After 25071ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:27
Fused 30 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 905 ms.
Support contains 44 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 433 transition count 7158
Applied a total of 58 rules in 607 ms. Remains 433 /433 variables (removed 0) and now considering 7158/7216 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 ms. Remains : 433/433 places, 7158/7216 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 76258 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76258 steps, saw 59709 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 25 properties.
[2023-03-11 16:29:05] [INFO ] Flow matrix only has 4817 transitions (discarded 2341 similar events)
// Phase 1: matrix 4817 rows 433 cols
[2023-03-11 16:29:05] [INFO ] Computed 2 place invariants in 123 ms
[2023-03-11 16:29:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:29:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-11 16:29:12] [INFO ] After 6143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-11 16:29:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 16:29:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:29:37] [INFO ] After 24504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-11 16:29:37] [INFO ] State equation strengthened by 400 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 16:29:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 16:29:37] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:25
Fused 25 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 401 ms.
Support contains 40 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7158/7158 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 7157
Applied a total of 1 rules in 266 ms. Remains 433 /433 variables (removed 0) and now considering 7157/7158 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 433/433 places, 7157/7158 transitions.
Incomplete random walk after 10009 steps, including 88 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 68375 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68375 steps, saw 53491 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 24 properties.
[2023-03-11 16:29:41] [INFO ] Flow matrix only has 4816 transitions (discarded 2341 similar events)
// Phase 1: matrix 4816 rows 433 cols
[2023-03-11 16:29:41] [INFO ] Computed 2 place invariants in 45 ms
[2023-03-11 16:29:41] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 16:29:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:29:48] [INFO ] After 7051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-11 16:29:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 16:29:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:30:13] [INFO ] After 24510ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2023-03-11 16:30:13] [INFO ] State equation strengthened by 400 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 16:30:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 16:30:13] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 1279 ms.
Support contains 39 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7157/7157 transitions.
Applied a total of 0 rules in 232 ms. Remains 433 /433 variables (removed 0) and now considering 7157/7157 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 433/433 places, 7157/7157 transitions.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA DoubleLock-PT-p1s2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 2176 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0||F(!p0)) U (G((!p0||F(!p0)))||(((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))&&(!p0||F(!p0))))))))'
Support contains 2 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 948 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:30:16] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2023-03-11 16:30:16] [INFO ] Computed 2 place invariants in 38 ms
[2023-03-11 16:30:17] [INFO ] Implicit Places using invariants in 1152 ms returned []
[2023-03-11 16:30:17] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:30:17] [INFO ] Invariant cache hit.
[2023-03-11 16:30:20] [INFO ] Implicit Places using invariants and state equation in 2329 ms returned []
Implicit Place search using SMT with State Equation took 3489 ms to find 0 implicit places.
[2023-03-11 16:30:21] [INFO ] Redundant transitions in 1309 ms returned []
[2023-03-11 16:30:21] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:30:21] [INFO ] Invariant cache hit.
[2023-03-11 16:30:24] [INFO ] Dead Transitions using invariants and state equation in 3234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9000 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 235 ms :[p0, p0]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s125 1) (GEQ s428 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1282 reset in 1577 ms.
Product exploration explored 100000 steps with 1281 reset in 1371 ms.
Computed a total of 10 stabilizing places and 2176 stable transitions
Computed a total of 10 stabilizing places and 2176 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Incomplete random walk after 10002 steps, including 83 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122718 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122718 steps, saw 95799 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 16:30:31] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:30:31] [INFO ] Invariant cache hit.
[2023-03-11 16:30:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 16:30:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 16:30:38] [INFO ] After 7176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:30:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:30:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 16:30:44] [INFO ] After 5630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:30:44] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:30:53] [INFO ] After 9152ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-11 16:30:53] [INFO ] After 14891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 433 transition count 7088
Applied a total of 128 rules in 247 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7216 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 433/433 places, 7088/7216 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 114334 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114334 steps, saw 89562 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 16:30:56] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-11 16:30:56] [INFO ] Computed 3 place invariants in 29 ms
[2023-03-11 16:30:56] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-11 16:31:01] [INFO ] After 4409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:31:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-11 16:31:06] [INFO ] After 4705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:31:06] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:31:15] [INFO ] After 9157ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-11 16:31:15] [INFO ] After 13970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 35 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 219 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 433/433 places, 7088/7088 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 245 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
[2023-03-11 16:31:15] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
[2023-03-11 16:31:15] [INFO ] Invariant cache hit.
[2023-03-11 16:31:17] [INFO ] Implicit Places using invariants in 1385 ms returned []
[2023-03-11 16:31:17] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
[2023-03-11 16:31:17] [INFO ] Invariant cache hit.
[2023-03-11 16:31:19] [INFO ] Implicit Places using invariants and state equation in 2348 ms returned []
Implicit Place search using SMT with State Equation took 3736 ms to find 0 implicit places.
[2023-03-11 16:31:20] [INFO ] Redundant transitions in 969 ms returned []
[2023-03-11 16:31:20] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
[2023-03-11 16:31:20] [INFO ] Invariant cache hit.
[2023-03-11 16:31:25] [INFO ] Dead Transitions using invariants and state equation in 4614 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9576 ms. Remains : 433/433 places, 7088/7088 transitions.
Ensure Unique test removed 2341 transitions
Reduce isomorphic transitions removed 2341 transitions.
Iterating post reduction 0 with 2341 rules applied. Total rules applied 2341 place count 433 transition count 4747
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 2341 place count 433 transition count 4736
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2363 place count 422 transition count 4736
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 2369 place count 419 transition count 4733
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2370 place count 418 transition count 4605
Iterating global reduction 1 with 1 rules applied. Total rules applied 2371 place count 418 transition count 4605
Applied a total of 2371 rules in 263 ms. Remains 418 /433 variables (removed 15) and now considering 4605/7088 (removed 2483) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4605 rows 418 cols
[2023-03-11 16:31:25] [INFO ] Computed 3 place invariants in 36 ms
[2023-03-11 16:31:25] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-11 16:31:28] [INFO ] After 3384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:31:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-11 16:31:31] [INFO ] After 2643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:31:31] [INFO ] After 2856ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-11 16:31:31] [INFO ] After 3055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[p0, p0]
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Support contains 2 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 352 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:31:32] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2023-03-11 16:31:32] [INFO ] Computed 2 place invariants in 76 ms
[2023-03-11 16:31:33] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-11 16:31:33] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:31:33] [INFO ] Invariant cache hit.
[2023-03-11 16:31:34] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:31:36] [INFO ] Implicit Places using invariants and state equation in 3448 ms returned []
Implicit Place search using SMT with State Equation took 4253 ms to find 0 implicit places.
[2023-03-11 16:31:38] [INFO ] Redundant transitions in 1290 ms returned []
[2023-03-11 16:31:38] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:31:38] [INFO ] Invariant cache hit.
[2023-03-11 16:31:41] [INFO ] Dead Transitions using invariants and state equation in 3779 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9684 ms. Remains : 433/433 places, 7216/7216 transitions.
Computed a total of 10 stabilizing places and 2176 stable transitions
Computed a total of 10 stabilizing places and 2176 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 126671 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126671 steps, saw 98742 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 16:31:45] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:31:45] [INFO ] Invariant cache hit.
[2023-03-11 16:31:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:31:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:31:52] [INFO ] After 6938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:31:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:31:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:31:58] [INFO ] After 6119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:31:58] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:32:07] [INFO ] After 9163ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-11 16:32:07] [INFO ] After 15389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 433 transition count 7088
Applied a total of 128 rules in 251 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7216 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 433/433 places, 7088/7216 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Finished Best-First random walk after 5273 steps, including 5 resets, run visited all 1 properties in 12 ms. (steps per millisecond=439 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Product exploration explored 100000 steps with 1252 reset in 1129 ms.
Product exploration explored 100000 steps with 1271 reset in 970 ms.
Built C files in :
/tmp/ltsmin17090420265298541646
[2023-03-11 16:32:10] [INFO ] Too many transitions (7216) to apply POR reductions. Disabling POR matrices.
[2023-03-11 16:32:10] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17090420265298541646
Running compilation step : cd /tmp/ltsmin17090420265298541646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17090420265298541646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17090420265298541646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 201 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:32:14] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:32:14] [INFO ] Invariant cache hit.
[2023-03-11 16:32:15] [INFO ] Implicit Places using invariants in 935 ms returned []
[2023-03-11 16:32:15] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:32:15] [INFO ] Invariant cache hit.
[2023-03-11 16:32:17] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 3044 ms to find 0 implicit places.
[2023-03-11 16:32:18] [INFO ] Redundant transitions in 939 ms returned []
[2023-03-11 16:32:18] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:32:18] [INFO ] Invariant cache hit.
[2023-03-11 16:32:21] [INFO ] Dead Transitions using invariants and state equation in 3578 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7771 ms. Remains : 433/433 places, 7216/7216 transitions.
Built C files in :
/tmp/ltsmin18114378371112488043
[2023-03-11 16:32:21] [INFO ] Too many transitions (7216) to apply POR reductions. Disabling POR matrices.
[2023-03-11 16:32:21] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18114378371112488043
Running compilation step : cd /tmp/ltsmin18114378371112488043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18114378371112488043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18114378371112488043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-11 16:32:25] [INFO ] Flatten gal took : 278 ms
[2023-03-11 16:32:25] [INFO ] Flatten gal took : 245 ms
[2023-03-11 16:32:25] [INFO ] Time to serialize gal into /tmp/LTL3678841368619533145.gal : 77 ms
[2023-03-11 16:32:26] [INFO ] Time to serialize properties into /tmp/LTL3236338880538883230.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3678841368619533145.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11334878968333819274.hoa' '-atoms' '/tmp/LTL3236338880538883230.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3236338880538883230.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11334878968333819274.hoa
Detected timeout of ITS tools.
[2023-03-11 16:32:41] [INFO ] Flatten gal took : 326 ms
[2023-03-11 16:32:41] [INFO ] Flatten gal took : 232 ms
[2023-03-11 16:32:41] [INFO ] Time to serialize gal into /tmp/LTL13985838974368729129.gal : 40 ms
[2023-03-11 16:32:41] [INFO ] Time to serialize properties into /tmp/LTL11894617837717643779.ltl : 4 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13985838974368729129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11894617837717643779.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(((!("((p125>=1)&&(l47>=1))"))||(F(!("((p125>=1)&&(l47>=1))"))))U((G((!("((p125>=1)&&(l47>=1))"))||(F(!("((p125>=1)&&(l47>=1))")...626
Formula 0 simplified : FG"((p125>=1)&&(l47>=1))"
Detected timeout of ITS tools.
[2023-03-11 16:32:57] [INFO ] Flatten gal took : 340 ms
[2023-03-11 16:32:57] [INFO ] Applying decomposition
[2023-03-11 16:32:57] [INFO ] Flatten gal took : 307 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12091475703547460391.txt' '-o' '/tmp/graph12091475703547460391.bin' '-w' '/tmp/graph12091475703547460391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12091475703547460391.bin' '-l' '-1' '-v' '-w' '/tmp/graph12091475703547460391.weights' '-q' '0' '-e' '0.001'
[2023-03-11 16:32:58] [INFO ] Decomposing Gal with order
[2023-03-11 16:32:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 16:32:59] [INFO ] Removed a total of 17398 redundant transitions.
[2023-03-11 16:32:59] [INFO ] Flatten gal took : 685 ms
[2023-03-11 16:33:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 961 labels/synchronizations in 584 ms.
[2023-03-11 16:33:00] [INFO ] Time to serialize gal into /tmp/LTL4036474485606314272.gal : 43 ms
[2023-03-11 16:33:00] [INFO ] Time to serialize properties into /tmp/LTL6414647880474201440.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4036474485606314272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6414647880474201440.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(((!("((i12.i2.u122.p125>=1)&&(i16.u140.l47>=1))"))||(F(!("((i12.i2.u122.p125>=1)&&(i16.u140.l47>=1))"))))U((G((!("((i12.i2.u122...1041
Formula 0 simplified : FG"((i12.i2.u122.p125>=1)&&(i16.u140.l47>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1789224895449261714
[2023-03-11 16:33:15] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1789224895449261714
Running compilation step : cd /tmp/ltsmin1789224895449261714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1789224895449261714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1789224895449261714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
Treatment of property DoubleLock-PT-p1s2-LTLFireability-00 finished in 182977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 28 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:33:18] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:18] [INFO ] Invariant cache hit.
[2023-03-11 16:33:19] [INFO ] Implicit Places using invariants in 822 ms returned []
[2023-03-11 16:33:19] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:19] [INFO ] Invariant cache hit.
[2023-03-11 16:33:21] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2683 ms to find 0 implicit places.
[2023-03-11 16:33:21] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:21] [INFO ] Invariant cache hit.
[2023-03-11 16:33:24] [INFO ] Dead Transitions using invariants and state equation in 3523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6239 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s370 1) (LT s405 1) (AND (GEQ s3 1) (GEQ s385 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7790 steps with 93 reset in 140 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-03 finished in 6566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0) U p1)&&F(G(p2))))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 38 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:33:25] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:25] [INFO ] Invariant cache hit.
[2023-03-11 16:33:26] [INFO ] Implicit Places using invariants in 1237 ms returned []
[2023-03-11 16:33:26] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:26] [INFO ] Invariant cache hit.
[2023-03-11 16:33:27] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:33:30] [INFO ] Implicit Places using invariants and state equation in 3572 ms returned []
Implicit Place search using SMT with State Equation took 4811 ms to find 0 implicit places.
[2023-03-11 16:33:30] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:30] [INFO ] Invariant cache hit.
[2023-03-11 16:33:33] [INFO ] Dead Transitions using invariants and state equation in 3642 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8496 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s304 1) (GEQ s416 1)) (AND (GEQ s84 1) (GEQ s395 1))), p0:(AND (GEQ s84 1) (GEQ s395 1)), p2:(OR (LT s358 1) (LT s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 2 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-04 finished in 8817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((G(p1) U p2)))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 25 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:33:34] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:34] [INFO ] Invariant cache hit.
[2023-03-11 16:33:35] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2023-03-11 16:33:35] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:35] [INFO ] Invariant cache hit.
[2023-03-11 16:33:36] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:33:37] [INFO ] Implicit Places using invariants and state equation in 2862 ms returned []
Implicit Place search using SMT with State Equation took 3875 ms to find 0 implicit places.
[2023-03-11 16:33:37] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:38] [INFO ] Invariant cache hit.
[2023-03-11 16:33:41] [INFO ] Dead Transitions using invariants and state equation in 3837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7751 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 455 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=1 dest: 7}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s109 1) (GEQ s429 1)), p0:(AND (GEQ s50 1) (GEQ s414 1)), p1:(AND (GEQ s121 1) (GEQ s432 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-05 finished in 8254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||((G(p2)&&p1) U p3)))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 335 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:33:42] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:42] [INFO ] Invariant cache hit.
[2023-03-11 16:33:43] [INFO ] Implicit Places using invariants in 993 ms returned []
[2023-03-11 16:33:43] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:43] [INFO ] Invariant cache hit.
[2023-03-11 16:33:44] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:33:46] [INFO ] Implicit Places using invariants and state equation in 2652 ms returned []
Implicit Place search using SMT with State Equation took 3650 ms to find 0 implicit places.
[2023-03-11 16:33:47] [INFO ] Redundant transitions in 1400 ms returned []
[2023-03-11 16:33:47] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:47] [INFO ] Invariant cache hit.
[2023-03-11 16:33:52] [INFO ] Dead Transitions using invariants and state equation in 4288 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9687 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(AND (GEQ s358 1) (GEQ s431 1)), p0:(AND (GEQ s112 1) (GEQ s384 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-06 finished in 9799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||G(((p2||X(p0))&&p1)))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 207 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:33:52] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:52] [INFO ] Invariant cache hit.
[2023-03-11 16:33:53] [INFO ] Implicit Places using invariants in 898 ms returned []
[2023-03-11 16:33:53] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:53] [INFO ] Invariant cache hit.
[2023-03-11 16:33:54] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:33:56] [INFO ] Implicit Places using invariants and state equation in 3495 ms returned []
Implicit Place search using SMT with State Equation took 4396 ms to find 0 implicit places.
[2023-03-11 16:33:58] [INFO ] Redundant transitions in 1262 ms returned []
[2023-03-11 16:33:58] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:33:58] [INFO ] Invariant cache hit.
[2023-03-11 16:34:01] [INFO ] Dead Transitions using invariants and state equation in 3878 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9750 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s80 1) (GEQ s432 1)), p0:(OR (LT s244 1) (LT s413 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-07 finished in 9816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 26 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:34:01] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:01] [INFO ] Invariant cache hit.
[2023-03-11 16:34:02] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-11 16:34:02] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:02] [INFO ] Invariant cache hit.
[2023-03-11 16:34:03] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:34:05] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3464 ms to find 0 implicit places.
[2023-03-11 16:34:05] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:05] [INFO ] Invariant cache hit.
[2023-03-11 16:34:09] [INFO ] Dead Transitions using invariants and state equation in 3731 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7226 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s323 1) (GEQ s426 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-08 finished in 7329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(((G(p1) U G(p2))&&p0)))) U X(X(p1)))))'
Support contains 2 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 26 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:34:09] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:09] [INFO ] Invariant cache hit.
[2023-03-11 16:34:10] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2023-03-11 16:34:10] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:10] [INFO ] Invariant cache hit.
[2023-03-11 16:34:12] [INFO ] Implicit Places using invariants and state equation in 2207 ms returned []
Implicit Place search using SMT with State Equation took 3375 ms to find 0 implicit places.
[2023-03-11 16:34:12] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:12] [INFO ] Invariant cache hit.
[2023-03-11 16:34:16] [INFO ] Dead Transitions using invariants and state equation in 3729 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7136 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s102 1) (GEQ s413 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 2 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-09 finished in 7305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 42 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:34:16] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:16] [INFO ] Invariant cache hit.
[2023-03-11 16:34:17] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2023-03-11 16:34:17] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:17] [INFO ] Invariant cache hit.
[2023-03-11 16:34:18] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:34:21] [INFO ] Implicit Places using invariants and state equation in 3525 ms returned []
Implicit Place search using SMT with State Equation took 4764 ms to find 0 implicit places.
[2023-03-11 16:34:21] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:21] [INFO ] Invariant cache hit.
[2023-03-11 16:34:25] [INFO ] Dead Transitions using invariants and state equation in 3769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8577 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s96 1) (GEQ s420 1)) (AND (GEQ s286 1) (GEQ s396 1))), p1:(OR (LT s286 1) (LT s396 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-10 finished in 8681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((F(p2)&&p1) U X(G(p3)))))'
Support contains 8 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 25 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:34:25] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:25] [INFO ] Invariant cache hit.
[2023-03-11 16:34:26] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2023-03-11 16:34:26] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:26] [INFO ] Invariant cache hit.
[2023-03-11 16:34:27] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:34:29] [INFO ] Implicit Places using invariants and state equation in 3299 ms returned []
Implicit Place search using SMT with State Equation took 4434 ms to find 0 implicit places.
[2023-03-11 16:34:29] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:29] [INFO ] Invariant cache hit.
[2023-03-11 16:34:33] [INFO ] Dead Transitions using invariants and state equation in 3557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8022 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (NOT p2)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p3), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s290 1) (LT s406 1)), p1:(AND (GEQ s362 1) (GEQ s398 1)), p2:(AND (GEQ s85 1) (GEQ s428 1)), p3:(AND (GEQ s357 1) (GEQ s402 1))], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-11 finished in 8325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 319 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:34:33] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:33] [INFO ] Invariant cache hit.
[2023-03-11 16:34:35] [INFO ] Implicit Places using invariants in 1238 ms returned []
[2023-03-11 16:34:35] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:35] [INFO ] Invariant cache hit.
[2023-03-11 16:34:36] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:34:38] [INFO ] Implicit Places using invariants and state equation in 3335 ms returned []
Implicit Place search using SMT with State Equation took 4576 ms to find 0 implicit places.
[2023-03-11 16:34:39] [INFO ] Redundant transitions in 1321 ms returned []
[2023-03-11 16:34:39] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:39] [INFO ] Invariant cache hit.
[2023-03-11 16:34:43] [INFO ] Dead Transitions using invariants and state equation in 3474 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9699 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s10 1) (LT s403 1) (AND (GEQ s1 1) (GEQ s429 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1264 reset in 1203 ms.
Product exploration explored 100000 steps with 1260 reset in 1128 ms.
Computed a total of 10 stabilizing places and 2176 stable transitions
Computed a total of 10 stabilizing places and 2176 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 118088 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118088 steps, saw 92358 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 16:34:49] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:34:49] [INFO ] Invariant cache hit.
[2023-03-11 16:34:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:34:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 16:34:53] [INFO ] After 4343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:34:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:34:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:35:01] [INFO ] After 7872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:35:01] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:35:10] [INFO ] After 9210ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-11 16:35:10] [INFO ] After 17206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 433 transition count 7154
Applied a total of 62 rules in 203 ms. Remains 433 /433 variables (removed 0) and now considering 7154/7216 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 433/433 places, 7154/7216 transitions.
Incomplete random walk after 10001 steps, including 87 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 115131 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115131 steps, saw 90157 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 16:35:13] [INFO ] Flow matrix only has 4813 transitions (discarded 2341 similar events)
// Phase 1: matrix 4813 rows 433 cols
[2023-03-11 16:35:13] [INFO ] Computed 2 place invariants in 52 ms
[2023-03-11 16:35:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:35:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:35:18] [INFO ] After 4629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:35:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:35:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 16:35:22] [INFO ] After 4265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:35:22] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:35:32] [INFO ] After 9171ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-11 16:35:32] [INFO ] After 13538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7154/7154 transitions.
Applied a total of 0 rules in 197 ms. Remains 433 /433 variables (removed 0) and now considering 7154/7154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 433/433 places, 7154/7154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7154/7154 transitions.
Applied a total of 0 rules in 250 ms. Remains 433 /433 variables (removed 0) and now considering 7154/7154 (removed 0) transitions.
[2023-03-11 16:35:32] [INFO ] Flow matrix only has 4813 transitions (discarded 2341 similar events)
[2023-03-11 16:35:32] [INFO ] Invariant cache hit.
[2023-03-11 16:35:33] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2023-03-11 16:35:33] [INFO ] Flow matrix only has 4813 transitions (discarded 2341 similar events)
[2023-03-11 16:35:33] [INFO ] Invariant cache hit.
[2023-03-11 16:35:34] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:35:36] [INFO ] Implicit Places using invariants and state equation in 2842 ms returned []
Implicit Place search using SMT with State Equation took 4035 ms to find 0 implicit places.
[2023-03-11 16:35:37] [INFO ] Redundant transitions in 1139 ms returned []
[2023-03-11 16:35:37] [INFO ] Flow matrix only has 4813 transitions (discarded 2341 similar events)
[2023-03-11 16:35:37] [INFO ] Invariant cache hit.
[2023-03-11 16:35:41] [INFO ] Dead Transitions using invariants and state equation in 3434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8871 ms. Remains : 433/433 places, 7154/7154 transitions.
Ensure Unique test removed 2341 transitions
Reduce isomorphic transitions removed 2341 transitions.
Iterating post reduction 0 with 2341 rules applied. Total rules applied 2341 place count 433 transition count 4813
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 2341 place count 433 transition count 4804
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 2359 place count 424 transition count 4804
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 2365 place count 421 transition count 4801
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2366 place count 420 transition count 4673
Iterating global reduction 1 with 1 rules applied. Total rules applied 2367 place count 420 transition count 4673
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2368 place count 420 transition count 4672
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2369 place count 419 transition count 4672
Applied a total of 2369 rules in 324 ms. Remains 419 /433 variables (removed 14) and now considering 4672/7154 (removed 2482) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4672 rows 419 cols
[2023-03-11 16:35:41] [INFO ] Computed 2 place invariants in 52 ms
[2023-03-11 16:35:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:35:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:35:45] [INFO ] After 3726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:35:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:35:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:35:49] [INFO ] After 4372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:35:50] [INFO ] After 5176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2072 ms.
[2023-03-11 16:35:52] [INFO ] After 7333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 326 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:35:53] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2023-03-11 16:35:53] [INFO ] Computed 2 place invariants in 49 ms
[2023-03-11 16:35:54] [INFO ] Implicit Places using invariants in 1274 ms returned []
[2023-03-11 16:35:54] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:35:54] [INFO ] Invariant cache hit.
[2023-03-11 16:35:55] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:35:57] [INFO ] Implicit Places using invariants and state equation in 3381 ms returned []
Implicit Place search using SMT with State Equation took 4657 ms to find 0 implicit places.
[2023-03-11 16:35:58] [INFO ] Redundant transitions in 813 ms returned []
[2023-03-11 16:35:58] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:35:58] [INFO ] Invariant cache hit.
[2023-03-11 16:36:02] [INFO ] Dead Transitions using invariants and state equation in 3584 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9390 ms. Remains : 433/433 places, 7216/7216 transitions.
Computed a total of 10 stabilizing places and 2176 stable transitions
Computed a total of 10 stabilizing places and 2176 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 111860 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111860 steps, saw 87724 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 16:36:05] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:36:05] [INFO ] Invariant cache hit.
[2023-03-11 16:36:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:36:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:36:09] [INFO ] After 4138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:36:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:36:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:36:17] [INFO ] After 7426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:36:17] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:36:26] [INFO ] After 9322ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-11 16:36:26] [INFO ] After 16850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 433 transition count 7154
Applied a total of 62 rules in 230 ms. Remains 433 /433 variables (removed 0) and now considering 7154/7216 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 433/433 places, 7154/7216 transitions.
Incomplete random walk after 10008 steps, including 91 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125574 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125574 steps, saw 97922 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 16:36:30] [INFO ] Flow matrix only has 4813 transitions (discarded 2341 similar events)
// Phase 1: matrix 4813 rows 433 cols
[2023-03-11 16:36:30] [INFO ] Computed 2 place invariants in 29 ms
[2023-03-11 16:36:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 16:36:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:36:34] [INFO ] After 4713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:36:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:36:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:36:39] [INFO ] After 4882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:36:39] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:36:49] [INFO ] After 9223ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-11 16:36:49] [INFO ] After 14212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7154/7154 transitions.
Applied a total of 0 rules in 197 ms. Remains 433 /433 variables (removed 0) and now considering 7154/7154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 433/433 places, 7154/7154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7154/7154 transitions.
Applied a total of 0 rules in 211 ms. Remains 433 /433 variables (removed 0) and now considering 7154/7154 (removed 0) transitions.
[2023-03-11 16:36:49] [INFO ] Flow matrix only has 4813 transitions (discarded 2341 similar events)
[2023-03-11 16:36:49] [INFO ] Invariant cache hit.
[2023-03-11 16:36:50] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2023-03-11 16:36:50] [INFO ] Flow matrix only has 4813 transitions (discarded 2341 similar events)
[2023-03-11 16:36:50] [INFO ] Invariant cache hit.
[2023-03-11 16:36:51] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:36:54] [INFO ] Implicit Places using invariants and state equation in 3404 ms returned []
Implicit Place search using SMT with State Equation took 4541 ms to find 0 implicit places.
[2023-03-11 16:36:55] [INFO ] Redundant transitions in 963 ms returned []
[2023-03-11 16:36:55] [INFO ] Flow matrix only has 4813 transitions (discarded 2341 similar events)
[2023-03-11 16:36:55] [INFO ] Invariant cache hit.
[2023-03-11 16:36:58] [INFO ] Dead Transitions using invariants and state equation in 3382 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9113 ms. Remains : 433/433 places, 7154/7154 transitions.
Ensure Unique test removed 2341 transitions
Reduce isomorphic transitions removed 2341 transitions.
Iterating post reduction 0 with 2341 rules applied. Total rules applied 2341 place count 433 transition count 4813
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 2341 place count 433 transition count 4804
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 2359 place count 424 transition count 4804
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 2365 place count 421 transition count 4801
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2366 place count 420 transition count 4673
Iterating global reduction 1 with 1 rules applied. Total rules applied 2367 place count 420 transition count 4673
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2368 place count 420 transition count 4672
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2369 place count 419 transition count 4672
Applied a total of 2369 rules in 275 ms. Remains 419 /433 variables (removed 14) and now considering 4672/7154 (removed 2482) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4672 rows 419 cols
[2023-03-11 16:36:58] [INFO ] Computed 2 place invariants in 32 ms
[2023-03-11 16:36:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:36:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 16:37:02] [INFO ] After 3719ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 16:37:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 16:37:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 16:37:07] [INFO ] After 4814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 16:37:08] [INFO ] After 5619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2207 ms.
[2023-03-11 16:37:10] [INFO ] After 7958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1264 reset in 1128 ms.
Product exploration explored 100000 steps with 1289 reset in 970 ms.
Built C files in :
/tmp/ltsmin267800651969835945
[2023-03-11 16:37:13] [INFO ] Too many transitions (7216) to apply POR reductions. Disabling POR matrices.
[2023-03-11 16:37:13] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin267800651969835945
Running compilation step : cd /tmp/ltsmin267800651969835945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin267800651969835945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin267800651969835945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 188 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:37:16] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2023-03-11 16:37:16] [INFO ] Computed 2 place invariants in 33 ms
[2023-03-11 16:37:17] [INFO ] Implicit Places using invariants in 1169 ms returned []
[2023-03-11 16:37:17] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:37:17] [INFO ] Invariant cache hit.
[2023-03-11 16:37:18] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:37:20] [INFO ] Implicit Places using invariants and state equation in 3413 ms returned []
Implicit Place search using SMT with State Equation took 4584 ms to find 0 implicit places.
[2023-03-11 16:37:21] [INFO ] Redundant transitions in 814 ms returned []
[2023-03-11 16:37:21] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:37:21] [INFO ] Invariant cache hit.
[2023-03-11 16:37:24] [INFO ] Dead Transitions using invariants and state equation in 3178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8778 ms. Remains : 433/433 places, 7216/7216 transitions.
Built C files in :
/tmp/ltsmin10814893887702764922
[2023-03-11 16:37:24] [INFO ] Too many transitions (7216) to apply POR reductions. Disabling POR matrices.
[2023-03-11 16:37:25] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10814893887702764922
Running compilation step : cd /tmp/ltsmin10814893887702764922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10814893887702764922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10814893887702764922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-11 16:37:28] [INFO ] Flatten gal took : 194 ms
[2023-03-11 16:37:28] [INFO ] Flatten gal took : 291 ms
[2023-03-11 16:37:28] [INFO ] Time to serialize gal into /tmp/LTL3134805308818504008.gal : 45 ms
[2023-03-11 16:37:28] [INFO ] Time to serialize properties into /tmp/LTL393654579572114769.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3134805308818504008.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3402836000163381744.hoa' '-atoms' '/tmp/LTL393654579572114769.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL393654579572114769.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3402836000163381744.hoa
Detected timeout of ITS tools.
[2023-03-11 16:37:44] [INFO ] Flatten gal took : 296 ms
[2023-03-11 16:37:44] [INFO ] Flatten gal took : 288 ms
[2023-03-11 16:37:44] [INFO ] Time to serialize gal into /tmp/LTL13040982230751004727.gal : 27 ms
[2023-03-11 16:37:44] [INFO ] Time to serialize properties into /tmp/LTL17770441288131386695.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13040982230751004727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17770441288131386695.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G("(((p10<1)||(l19<1))||((s1>=1)&&(l48>=1)))")))
Formula 0 simplified : F!"(((p10<1)||(l19<1))||((s1>=1)&&(l48>=1)))"
Detected timeout of ITS tools.
[2023-03-11 16:37:59] [INFO ] Flatten gal took : 178 ms
[2023-03-11 16:37:59] [INFO ] Applying decomposition
[2023-03-11 16:37:59] [INFO ] Flatten gal took : 189 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14737026733262747661.txt' '-o' '/tmp/graph14737026733262747661.bin' '-w' '/tmp/graph14737026733262747661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14737026733262747661.bin' '-l' '-1' '-v' '-w' '/tmp/graph14737026733262747661.weights' '-q' '0' '-e' '0.001'
[2023-03-11 16:38:00] [INFO ] Decomposing Gal with order
[2023-03-11 16:38:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 16:38:01] [INFO ] Removed a total of 17398 redundant transitions.
[2023-03-11 16:38:01] [INFO ] Flatten gal took : 444 ms
[2023-03-11 16:38:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1108 labels/synchronizations in 260 ms.
[2023-03-11 16:38:01] [INFO ] Time to serialize gal into /tmp/LTL10427342167968784868.gal : 29 ms
[2023-03-11 16:38:01] [INFO ] Time to serialize properties into /tmp/LTL13314433809911699329.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10427342167968784868.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13314433809911699329.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G("(((i0.i1.u5.p10<1)||(i7.i4.u132.l19<1))||((i15.i4.u66.s1>=1)&&(i15.i3.u141.l48>=1)))")))
Formula 0 simplified : F!"(((i0.i1.u5.p10<1)||(i7.i4.u132.l19<1))||((i15.i4.u66.s1>=1)&&(i15.i3.u141.l48>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7412850062044128780
[2023-03-11 16:38:16] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7412850062044128780
Running compilation step : cd /tmp/ltsmin7412850062044128780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7412850062044128780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7412850062044128780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
Treatment of property DoubleLock-PT-p1s2-LTLFireability-12 finished in 226091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 26 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:38:19] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:38:19] [INFO ] Invariant cache hit.
[2023-03-11 16:38:20] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2023-03-11 16:38:20] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:38:20] [INFO ] Invariant cache hit.
[2023-03-11 16:38:21] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:38:24] [INFO ] Implicit Places using invariants and state equation in 3337 ms returned []
Implicit Place search using SMT with State Equation took 4438 ms to find 0 implicit places.
[2023-03-11 16:38:24] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:38:24] [INFO ] Invariant cache hit.
[2023-03-11 16:38:27] [INFO ] Dead Transitions using invariants and state equation in 3720 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8185 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s336 1) (GEQ s409 1)), p1:(OR (AND (GEQ s336 1) (GEQ s409 1)) (AND (GEQ s52 1) (GEQ s392 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 2 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-13 finished in 8314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1)) U (G((G(p2) U p1))||G(!p3))))'
Support contains 8 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 40 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:38:28] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:38:28] [INFO ] Invariant cache hit.
[2023-03-11 16:38:29] [INFO ] Implicit Places using invariants in 1146 ms returned []
[2023-03-11 16:38:29] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:38:29] [INFO ] Invariant cache hit.
[2023-03-11 16:38:30] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:38:32] [INFO ] Implicit Places using invariants and state equation in 3336 ms returned []
Implicit Place search using SMT with State Equation took 4486 ms to find 0 implicit places.
[2023-03-11 16:38:32] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:38:32] [INFO ] Invariant cache hit.
[2023-03-11 16:38:36] [INFO ] Dead Transitions using invariants and state equation in 3598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8127 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 1034 ms :[(AND (NOT p1) p3), (NOT p1), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) p2 p3)), (AND (NOT p1) p3 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), true, p3, (NOT p2), (AND p3 (NOT p2)), (NOT p1), (AND p2 (NOT p1) p3 p0), (NOT p1), (AND p0 (NOT p1) p3)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p1 p3) (AND p2 p3)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={1, 2} source=0 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=0 dest: 6}, { cond=(AND (NOT p1) p2 p3), acceptance={0, 1, 2} source=0 dest: 6}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=0 dest: 7}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=0 dest: 9}, { cond=(OR (AND p1 p3) (AND p2 p3)), acceptance={} source=0 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 11}], [{ cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 11}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=3 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=3 dest: 14}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p1 (NOT p2) p3), acceptance={0, 2} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p2 p3), acceptance={2} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p2 p3), acceptance={} source=4 dest: 8}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=5 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=5 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 14}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=5 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 16}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p3), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=7 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 14}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 15}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 17}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1, 2} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 17}], [{ cond=true, acceptance={0, 1, 2} source=11 dest: 11}], [{ cond=p3, acceptance={} source=12 dest: 11}, { cond=(NOT p3), acceptance={} source=12 dest: 12}], [{ cond=(NOT p2), acceptance={} source=13 dest: 11}, { cond=p2, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p2) p3), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=14 dest: 12}, { cond=(AND p2 p3), acceptance={} source=14 dest: 13}, { cond=(AND p2 (NOT p3)), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=15 dest: 13}, { cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=15 dest: 15}], [{ cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=16 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=17 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=17 dest: 13}, { cond=(AND (NOT p1) p2), acceptance={} source=17 dest: 15}, { cond=(OR p1 p2), acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={} source=18 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=18 dest: 12}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=18 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=18 dest: 14}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=18 dest: 15}, { cond=(OR (AND p1 p3) (AND p2 p3 p0)), acceptance={} source=18 dest: 17}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3) p0)), acceptance={} source=18 dest: 18}]], initial=0, aps=[p1:(AND (GEQ s350 1) (GEQ s415 1)), p3:(AND (GEQ s6 1) (GEQ s384 1)), p2:(AND (GEQ s112 1) (GEQ s403 1)), p0:(AND (GEQ s60 1) (GEQ s424 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2186 steps with 26 reset in 33 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-14 finished in 9263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(G((p1||X(p2))))))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 40 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-11 16:38:37] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:38:37] [INFO ] Invariant cache hit.
[2023-03-11 16:38:38] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2023-03-11 16:38:38] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:38:38] [INFO ] Invariant cache hit.
[2023-03-11 16:38:39] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-11 16:38:41] [INFO ] Implicit Places using invariants and state equation in 3271 ms returned []
Implicit Place search using SMT with State Equation took 4492 ms to find 0 implicit places.
[2023-03-11 16:38:41] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-11 16:38:41] [INFO ] Invariant cache hit.
[2023-03-11 16:38:45] [INFO ] Dead Transitions using invariants and state equation in 3405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7941 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (GEQ s69 1) (GEQ s404 1)), p2:(AND (GEQ s86 1) (GEQ s425 1)), p1:(AND (GEQ s106 1) (GEQ s430 1) (GEQ s69 1) (GEQ s404 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 4 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-15 finished in 8162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0||F(!p0)) U (G((!p0||F(!p0)))||(((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))&&(!p0||F(!p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
[2023-03-11 16:38:46] [INFO ] Flatten gal took : 303 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11446394029663162666
[2023-03-11 16:38:46] [INFO ] Too many transitions (7216) to apply POR reductions. Disabling POR matrices.
[2023-03-11 16:38:46] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11446394029663162666
Running compilation step : cd /tmp/ltsmin11446394029663162666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 16:38:46] [INFO ] Applying decomposition
[2023-03-11 16:38:46] [INFO ] Flatten gal took : 197 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8861495657554075982.txt' '-o' '/tmp/graph8861495657554075982.bin' '-w' '/tmp/graph8861495657554075982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8861495657554075982.bin' '-l' '-1' '-v' '-w' '/tmp/graph8861495657554075982.weights' '-q' '0' '-e' '0.001'
[2023-03-11 16:38:47] [INFO ] Decomposing Gal with order
[2023-03-11 16:38:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 16:38:47] [INFO ] Removed a total of 17653 redundant transitions.
[2023-03-11 16:38:47] [INFO ] Flatten gal took : 421 ms
[2023-03-11 16:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 900 labels/synchronizations in 302 ms.
[2023-03-11 16:38:48] [INFO ] Time to serialize gal into /tmp/LTLFireability17939978126237732124.gal : 29 ms
[2023-03-11 16:38:48] [INFO ] Time to serialize properties into /tmp/LTLFireability285199994949513008.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17939978126237732124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability285199994949513008.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F(((!("((i7.i2.u67.p125>=1)&&(i17.u142.l47>=1))"))||(F(!("((i7.i2.u67.p125>=1)&&(i17.u142.l47>=1))"))))U((G((!("((i7.i2.u67.p125>...996
Formula 0 simplified : FG"((i7.i2.u67.p125>=1)&&(i17.u142.l47>=1))"
Compilation finished in 44209 ms.
Running link step : cd /tmp/ltsmin11446394029663162666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin11446394029663162666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((!(LTLAPp0==true)||<>(!(LTLAPp0==true))) U ([]((!(LTLAPp0==true)||<>(!(LTLAPp0==true))))||(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))) U ((!(LTLAPp3==true)&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))||[]((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))&&(!(LTLAPp0==true)||<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 17:02:23] [INFO ] Flatten gal took : 433 ms
[2023-03-11 17:02:23] [INFO ] Time to serialize gal into /tmp/LTLFireability11593032051345276573.gal : 55 ms
[2023-03-11 17:02:23] [INFO ] Time to serialize properties into /tmp/LTLFireability17447757186468181274.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11593032051345276573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17447757186468181274.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((G(F(((!("((p125>=1)&&(l47>=1))"))||(F(!("((p125>=1)&&(l47>=1))"))))U((G((!("((p125>=1)&&(l47>=1))"))||(F(!("((p125>=1)&&(l47>=1))")...626
Formula 0 simplified : FG"((p125>=1)&&(l47>=1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin11446394029663162666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((!(LTLAPp0==true)||<>(!(LTLAPp0==true))) U ([]((!(LTLAPp0==true)||<>(!(LTLAPp0==true))))||(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))) U ((!(LTLAPp3==true)&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))||[]((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))&&(!(LTLAPp0==true)||<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11446394029663162666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp4==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 17:25:59] [INFO ] Flatten gal took : 463 ms
[2023-03-11 17:26:00] [INFO ] Input system was already deterministic with 7216 transitions.
[2023-03-11 17:26:00] [INFO ] Transformed 433 places.
[2023-03-11 17:26:00] [INFO ] Transformed 7216 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 17:26:01] [INFO ] Time to serialize gal into /tmp/LTLFireability5475272149723760848.gal : 71 ms
[2023-03-11 17:26:01] [INFO ] Time to serialize properties into /tmp/LTLFireability5015431421873791360.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5475272149723760848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5015431421873791360.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(((!("((p125>=1)&&(l47>=1))"))||(F(!("((p125>=1)&&(l47>=1))"))))U((G((!("((p125>=1)&&(l47>=1))"))||(F(!("((p125>=1)&&(l47>=1))")...626
Formula 0 simplified : FG"((p125>=1)&&(l47>=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13237008 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16033516 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="DoubleLock-PT-p1s2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DoubleLock-PT-p1s2, 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 r133-smll-167819411200516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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