About the Execution of 2023-gold for DoubleLock-PT-p1s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.035 | 3600000.00 | 12701416.00 | 20801.70 | ?FFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151700373.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DoubleLock-PT-p1s2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151700373
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1716436471987
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s2
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 03:54:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 03:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 03:54:33] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2024-05-23 03:54:33] [INFO ] Transformed 570 places.
[2024-05-23 03:54:33] [INFO ] Transformed 7600 transitions.
[2024-05-23 03:54:34] [INFO ] Parsed PT model containing 570 places and 7600 transitions and 30784 arcs in 550 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 132 places in 18 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s2-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 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
Applied a total of 4 rules in 106 ms. Remains 434 /438 variables (removed 4) and now considering 7344/7344 (removed 0) transitions.
[2024-05-23 03:54:34] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
// Phase 1: matrix 5003 rows 434 cols
[2024-05-23 03:54:34] [INFO ] Computed 2 invariants in 83 ms
[2024-05-23 03:54:34] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-23 03:54:34] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2024-05-23 03:54:34] [INFO ] Invariant cache hit.
[2024-05-23 03:54:35] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:54:36] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
[2024-05-23 03:54:36] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2024-05-23 03:54:36] [INFO ] Invariant cache hit.
[2024-05-23 03:54:38] [INFO ] Dead Transitions using invariants and state equation in 1910 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/438 places, 7344/7344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4073 ms. Remains : 434/438 places, 7344/7344 transitions.
Support contains 55 out of 434 places after structural reductions.
[2024-05-23 03:54:38] [INFO ] Flatten gal took : 355 ms
[2024-05-23 03:54:39] [INFO ] Flatten gal took : 229 ms
[2024-05-23 03:54:39] [INFO ] Input system was already deterministic with 7344 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 33) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 27) 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 27) seen :2
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 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :1
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 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 23) 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 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) 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 22) seen :0
Running SMT prover for 22 properties.
[2024-05-23 03:54:40] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2024-05-23 03:54:40] [INFO ] Invariant cache hit.
[2024-05-23 03:54:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 03:54:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 03:54:55] [INFO ] After 15345ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:19
[2024-05-23 03:54:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 03:54:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 03:55:20] [INFO ] After 24700ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :18
[2024-05-23 03:55:20] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:55:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:55:20] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:19
Fused 22 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 566 ms.
Support contains 34 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Drop transitions removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 434 transition count 7291
Applied a total of 53 rules in 315 ms. Remains 434 /434 variables (removed 0) and now considering 7291/7344 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 434/434 places, 7291/7344 transitions.
Incomplete random walk after 10003 steps, including 87 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Interrupted probabilistic random walk after 85233 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{10=1}
Probabilistic random walk after 85233 steps, saw 66678 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :1
Running SMT prover for 17 properties.
[2024-05-23 03:55:24] [INFO ] Flow matrix only has 4950 transitions (discarded 2341 similar events)
// Phase 1: matrix 4950 rows 434 cols
[2024-05-23 03:55:24] [INFO ] Computed 2 invariants in 52 ms
[2024-05-23 03:55:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 03:55:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 03:55:37] [INFO ] After 13082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-23 03:55:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 03:55:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 03:56:03] [INFO ] After 24772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-23 03:56:03] [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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 03:56:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 03:56:03] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 0 properties in 560 ms.
Support contains 32 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 7291/7291 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 434 transition count 7289
Applied a total of 2 rules in 182 ms. Remains 434 /434 variables (removed 0) and now considering 7289/7291 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 434/434 places, 7289/7291 transitions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 103718 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103718 steps, saw 81241 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 17 properties.
[2024-05-23 03:56:06] [INFO ] Flow matrix only has 4948 transitions (discarded 2341 similar events)
// Phase 1: matrix 4948 rows 434 cols
[2024-05-23 03:56:07] [INFO ] Computed 2 invariants in 34 ms
[2024-05-23 03:56:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 03:56:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 03:56:23] [INFO ] After 16105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-23 03:56:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 03:56:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 03:56:45] [INFO ] After 21949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-23 03:56:45] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:56:48] [INFO ] After 2798ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2024-05-23 03:56:48] [INFO ] After 2798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-23 03:56:48] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 598 ms.
Support contains 32 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 7289/7289 transitions.
Applied a total of 0 rules in 159 ms. Remains 434 /434 variables (removed 0) and now considering 7289/7289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 434/434 places, 7289/7289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 7289/7289 transitions.
Applied a total of 0 rules in 153 ms. Remains 434 /434 variables (removed 0) and now considering 7289/7289 (removed 0) transitions.
[2024-05-23 03:56:49] [INFO ] Flow matrix only has 4948 transitions (discarded 2341 similar events)
[2024-05-23 03:56:49] [INFO ] Invariant cache hit.
[2024-05-23 03:56:49] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-23 03:56:49] [INFO ] Flow matrix only has 4948 transitions (discarded 2341 similar events)
[2024-05-23 03:56:49] [INFO ] Invariant cache hit.
[2024-05-23 03:56:50] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:57:03] [INFO ] Implicit Places using invariants and state equation in 13567 ms returned []
Implicit Place search using SMT with State Equation took 13993 ms to find 0 implicit places.
[2024-05-23 03:57:03] [INFO ] Redundant transitions in 746 ms returned []
[2024-05-23 03:57:03] [INFO ] Flow matrix only has 4948 transitions (discarded 2341 similar events)
[2024-05-23 03:57:03] [INFO ] Invariant cache hit.
[2024-05-23 03:57:05] [INFO ] Dead Transitions using invariants and state equation in 1856 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16757 ms. Remains : 434/434 places, 7289/7289 transitions.
FORMULA DoubleLock-PT-p1s2-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Computed a total of 10 stabilizing places and 2176 stable transitions
FORMULA DoubleLock-PT-p1s2-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 434 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 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 367 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 03:57:06] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2024-05-23 03:57:06] [INFO ] Computed 2 invariants in 40 ms
[2024-05-23 03:57:06] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-23 03:57:06] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:57:06] [INFO ] Invariant cache hit.
[2024-05-23 03:57:07] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:57:08] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 2191 ms to find 0 implicit places.
[2024-05-23 03:57:09] [INFO ] Redundant transitions in 721 ms returned []
[2024-05-23 03:57:09] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:57:09] [INFO ] Invariant cache hit.
[2024-05-23 03:57:11] [INFO ] Dead Transitions using invariants and state equation in 1875 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5167 ms. Remains : 433/434 places, 7216/7344 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 194 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 1236 reset in 985 ms.
Product exploration explored 100000 steps with 1267 reset in 962 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 68 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 63 ms :[p0, p0]
Incomplete random walk after 10001 steps, including 83 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Finished Best-First random walk after 3662 steps, including 4 resets, run visited all 1 properties in 6 ms. (steps per millisecond=610 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 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 62 ms :[p0, p0]
Stuttering acceptance computed with spot in 73 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 167 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2024-05-23 03:57:14] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:57:14] [INFO ] Invariant cache hit.
[2024-05-23 03:57:14] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-23 03:57:14] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:57:14] [INFO ] Invariant cache hit.
[2024-05-23 03:57:15] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:57:16] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-05-23 03:57:16] [INFO ] Redundant transitions in 534 ms returned []
[2024-05-23 03:57:16] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:57:16] [INFO ] Invariant cache hit.
[2024-05-23 03:57:18] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4770 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 71 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 10007 steps, including 88 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Finished Best-First random walk after 765 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=382 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 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 79 ms :[p0, p0]
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Product exploration explored 100000 steps with 1273 reset in 714 ms.
Product exploration explored 100000 steps with 1278 reset in 842 ms.
Built C files in :
/tmp/ltsmin13832190592903170403
[2024-05-23 03:57:20] [INFO ] Too many transitions (7216) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:57:20] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13832190592903170403
Running compilation step : cd /tmp/ltsmin13832190592903170403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13832190592903170403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13832190592903170403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 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 177 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2024-05-23 03:57:24] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:57:24] [INFO ] Invariant cache hit.
[2024-05-23 03:57:24] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-23 03:57:24] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:57:24] [INFO ] Invariant cache hit.
[2024-05-23 03:57:25] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:57:26] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
[2024-05-23 03:57:27] [INFO ] Redundant transitions in 538 ms returned []
[2024-05-23 03:57:27] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:57:27] [INFO ] Invariant cache hit.
[2024-05-23 03:57:28] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4856 ms. Remains : 433/433 places, 7216/7216 transitions.
Built C files in :
/tmp/ltsmin18028507667363833297
[2024-05-23 03:57:28] [INFO ] Too many transitions (7216) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:57:29] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18028507667363833297
Running compilation step : cd /tmp/ltsmin18028507667363833297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18028507667363833297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18028507667363833297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 03:57:32] [INFO ] Flatten gal took : 204 ms
[2024-05-23 03:57:32] [INFO ] Flatten gal took : 183 ms
[2024-05-23 03:57:32] [INFO ] Time to serialize gal into /tmp/LTL17490739974860128300.gal : 54 ms
[2024-05-23 03:57:32] [INFO ] Time to serialize properties into /tmp/LTL8164733726412581028.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17490739974860128300.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12590823742828548074.hoa' '-atoms' '/tmp/LTL8164733726412581028.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8164733726412581028.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12590823742828548074.hoa
Detected timeout of ITS tools.
[2024-05-23 03:57:48] [INFO ] Flatten gal took : 170 ms
[2024-05-23 03:57:48] [INFO ] Flatten gal took : 173 ms
[2024-05-23 03:57:48] [INFO ] Time to serialize gal into /tmp/LTL206687393649960492.gal : 28 ms
[2024-05-23 03:57:48] [INFO ] Time to serialize properties into /tmp/LTL5580612414915931329.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL206687393649960492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5580612414915931329.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
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.
[2024-05-23 03:58:03] [INFO ] Flatten gal took : 163 ms
[2024-05-23 03:58:03] [INFO ] Applying decomposition
[2024-05-23 03:58:03] [INFO ] Flatten gal took : 174 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16760388355237168514.txt' '-o' '/tmp/graph16760388355237168514.bin' '-w' '/tmp/graph16760388355237168514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16760388355237168514.bin' '-l' '-1' '-v' '-w' '/tmp/graph16760388355237168514.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:58:04] [INFO ] Decomposing Gal with order
[2024-05-23 03:58:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:58:04] [INFO ] Removed a total of 17653 redundant transitions.
[2024-05-23 03:58:04] [INFO ] Flatten gal took : 557 ms
[2024-05-23 03:58:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 917 labels/synchronizations in 313 ms.
[2024-05-23 03:58:05] [INFO ] Time to serialize gal into /tmp/LTL16519742649225037890.gal : 35 ms
[2024-05-23 03:58:05] [INFO ] Time to serialize properties into /tmp/LTL9081723577080525991.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16519742649225037890.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9081723577080525991.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(((!("((i2.i1.u59.p125>=1)&&(i17.u142.l47>=1))"))||(F(!("((i2.i1.u59.p125>=1)&&(i17.u142.l47>=1))"))))U((G((!("((i2.i1.u59.p125>...1027
Formula 0 simplified : FG"((i2.i1.u59.p125>=1)&&(i17.u142.l47>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2537582421962311059
[2024-05-23 03:58:20] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2537582421962311059
Running compilation step : cd /tmp/ltsmin2537582421962311059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2537582421962311059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2537582421962311059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleLock-PT-p1s2-LTLFireability-00 finished in 77551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1||X(X((p2 U (p3||G(p2))))))))'
Support contains 8 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 40 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 03:58:23] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:58:23] [INFO ] Invariant cache hit.
[2024-05-23 03:58:24] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-23 03:58:24] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:58:24] [INFO ] Invariant cache hit.
[2024-05-23 03:58:24] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:58:33] [INFO ] Implicit Places using invariants and state equation in 9323 ms returned []
Implicit Place search using SMT with State Equation took 9755 ms to find 0 implicit places.
[2024-05-23 03:58:33] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:58:33] [INFO ] Invariant cache hit.
[2024-05-23 03:58:35] [INFO ] Dead Transitions using invariants and state equation in 1773 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11569 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s30 1) (GEQ s386 1)), p0:(AND (GEQ s283 1) (GEQ s431 1)), p3:(AND (GEQ s56 1) (GEQ s418 1) (NOT (AND (GEQ s365 1) (GEQ s405 1)))), p2:(AND (G...], 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]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 3 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-01 finished in 11938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)||X(G(p2)))))'
Support contains 6 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 42 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 03:58:35] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:58:35] [INFO ] Invariant cache hit.
[2024-05-23 03:58:36] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-23 03:58:36] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:58:36] [INFO ] Invariant cache hit.
[2024-05-23 03:58:36] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:58:47] [INFO ] Implicit Places using invariants and state equation in 11596 ms returned []
Implicit Place search using SMT with State Equation took 12054 ms to find 0 implicit places.
[2024-05-23 03:58:47] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:58:47] [INFO ] Invariant cache hit.
[2024-05-23 03:58:49] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13950 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(AND (GEQ s361 1) (GEQ s422 1)), p1:(AND (GEQ s59 1) (GEQ s428 1)), p2:(AND (GEQ s28 1) (GEQ s390 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-02 finished in 14279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 39 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 03:58:49] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:58:49] [INFO ] Invariant cache hit.
[2024-05-23 03:58:50] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-23 03:58:50] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:58:50] [INFO ] Invariant cache hit.
[2024-05-23 03:58:50] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:58:59] [INFO ] Implicit Places using invariants and state equation in 9122 ms returned []
Implicit Place search using SMT with State Equation took 9591 ms to find 0 implicit places.
[2024-05-23 03:58:59] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:58:59] [INFO ] Invariant cache hit.
[2024-05-23 03:59:01] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11526 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 133 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]]
Product exploration explored 100000 steps with 1262 reset in 920 ms.
Product exploration explored 100000 steps with 1260 reset in 916 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 168335 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168335 steps, saw 129739 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 03:59:06] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 03:59:06] [INFO ] Invariant cache hit.
[2024-05-23 03:59:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 03:59:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 03:59:11] [INFO ] After 4442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 03:59:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 03:59:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 13 ms returned sat
[2024-05-23 03:59:18] [INFO ] After 6871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 03:59:18] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:59:27] [INFO ] After 9114ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-23 03:59:27] [INFO ] After 16111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 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 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 433 transition count 7090
Applied a total of 126 rules in 198 ms. Remains 433 /433 variables (removed 0) and now considering 7090/7216 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 433/433 places, 7090/7216 transitions.
Incomplete random walk after 10006 steps, including 85 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 184520 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184520 steps, saw 141776 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 03:59:30] [INFO ] Flow matrix only has 4749 transitions (discarded 2341 similar events)
// Phase 1: matrix 4749 rows 433 cols
[2024-05-23 03:59:30] [INFO ] Computed 2 invariants in 38 ms
[2024-05-23 03:59:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 03:59:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 03:59:34] [INFO ] After 4077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 03:59:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 03:59:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 03:59:41] [INFO ] After 6958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 03:59:41] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 03:59:50] [INFO ] After 9126ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-23 03:59:50] [INFO ] After 16174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7090/7090 transitions.
Applied a total of 0 rules in 170 ms. Remains 433 /433 variables (removed 0) and now considering 7090/7090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 433/433 places, 7090/7090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7090/7090 transitions.
Applied a total of 0 rules in 164 ms. Remains 433 /433 variables (removed 0) and now considering 7090/7090 (removed 0) transitions.
[2024-05-23 03:59:51] [INFO ] Flow matrix only has 4749 transitions (discarded 2341 similar events)
[2024-05-23 03:59:51] [INFO ] Invariant cache hit.
[2024-05-23 03:59:51] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-23 03:59:51] [INFO ] Flow matrix only has 4749 transitions (discarded 2341 similar events)
[2024-05-23 03:59:51] [INFO ] Invariant cache hit.
[2024-05-23 03:59:52] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:00:05] [INFO ] Implicit Places using invariants and state equation in 14343 ms returned []
Implicit Place search using SMT with State Equation took 14775 ms to find 0 implicit places.
[2024-05-23 04:00:06] [INFO ] Redundant transitions in 546 ms returned []
[2024-05-23 04:00:06] [INFO ] Flow matrix only has 4749 transitions (discarded 2341 similar events)
[2024-05-23 04:00:06] [INFO ] Invariant cache hit.
[2024-05-23 04:00:08] [INFO ] Dead Transitions using invariants and state equation in 1752 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17254 ms. Remains : 433/433 places, 7090/7090 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 4749
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 2341 place count 433 transition count 4741
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 2357 place count 425 transition count 4741
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 2363 place count 422 transition count 4738
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2364 place count 421 transition count 4610
Iterating global reduction 1 with 1 rules applied. Total rules applied 2365 place count 421 transition count 4610
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2367 place count 421 transition count 4608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2369 place count 419 transition count 4608
Applied a total of 2369 rules in 288 ms. Remains 419 /433 variables (removed 14) and now considering 4608/7090 (removed 2482) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4608 rows 419 cols
[2024-05-23 04:00:08] [INFO ] Computed 2 invariants in 50 ms
[2024-05-23 04:00:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:00:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:00:12] [INFO ] After 4019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:00:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:00:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:00:17] [INFO ] After 4973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:00:18] [INFO ] After 6316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1714 ms.
[2024-05-23 04:00:20] [INFO ] After 8100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT 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 23 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2024-05-23 04:00:21] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2024-05-23 04:00:21] [INFO ] Computed 2 invariants in 35 ms
[2024-05-23 04:00:21] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-23 04:00:21] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:00:21] [INFO ] Invariant cache hit.
[2024-05-23 04:00:22] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:00:23] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2024-05-23 04:00:23] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:00:23] [INFO ] Invariant cache hit.
[2024-05-23 04:00:24] [INFO ] Dead Transitions using invariants and state equation in 1729 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3886 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 85 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 178729 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178729 steps, saw 137470 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 04:00:28] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:00:28] [INFO ] Invariant cache hit.
[2024-05-23 04:00:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:00:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:00:32] [INFO ] After 4318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:00:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:00:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:00:39] [INFO ] After 6729ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:00:39] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:00:48] [INFO ] After 9128ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-23 04:00:48] [INFO ] After 15942ms 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 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 433 transition count 7090
Applied a total of 126 rules in 166 ms. Remains 433 /433 variables (removed 0) and now considering 7090/7216 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 433/433 places, 7090/7216 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187270 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187270 steps, saw 143824 distinct states, run finished after 3003 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 04:00:51] [INFO ] Flow matrix only has 4749 transitions (discarded 2341 similar events)
// Phase 1: matrix 4749 rows 433 cols
[2024-05-23 04:00:51] [INFO ] Computed 2 invariants in 29 ms
[2024-05-23 04:00:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:00:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:00:55] [INFO ] After 3807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:00:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:00:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 04:01:02] [INFO ] After 6490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:01:02] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:01:11] [INFO ] After 9123ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-23 04:01:11] [INFO ] After 15693ms 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, 7090/7090 transitions.
Applied a total of 0 rules in 166 ms. Remains 433 /433 variables (removed 0) and now considering 7090/7090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 433/433 places, 7090/7090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7090/7090 transitions.
Applied a total of 0 rules in 152 ms. Remains 433 /433 variables (removed 0) and now considering 7090/7090 (removed 0) transitions.
[2024-05-23 04:01:11] [INFO ] Flow matrix only has 4749 transitions (discarded 2341 similar events)
[2024-05-23 04:01:11] [INFO ] Invariant cache hit.
[2024-05-23 04:01:12] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-23 04:01:12] [INFO ] Flow matrix only has 4749 transitions (discarded 2341 similar events)
[2024-05-23 04:01:12] [INFO ] Invariant cache hit.
[2024-05-23 04:01:12] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:01:25] [INFO ] Implicit Places using invariants and state equation in 13954 ms returned []
Implicit Place search using SMT with State Equation took 14389 ms to find 0 implicit places.
[2024-05-23 04:01:26] [INFO ] Redundant transitions in 510 ms returned []
[2024-05-23 04:01:26] [INFO ] Flow matrix only has 4749 transitions (discarded 2341 similar events)
[2024-05-23 04:01:26] [INFO ] Invariant cache hit.
[2024-05-23 04:01:28] [INFO ] Dead Transitions using invariants and state equation in 1672 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16735 ms. Remains : 433/433 places, 7090/7090 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 4749
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 2341 place count 433 transition count 4741
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 2357 place count 425 transition count 4741
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 2363 place count 422 transition count 4738
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2364 place count 421 transition count 4610
Iterating global reduction 1 with 1 rules applied. Total rules applied 2365 place count 421 transition count 4610
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2367 place count 421 transition count 4608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2369 place count 419 transition count 4608
Applied a total of 2369 rules in 214 ms. Remains 419 /433 variables (removed 14) and now considering 4608/7090 (removed 2482) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4608 rows 419 cols
[2024-05-23 04:01:28] [INFO ] Computed 2 invariants in 31 ms
[2024-05-23 04:01:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:01:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:01:32] [INFO ] After 3748ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:01:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:01:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 04:01:37] [INFO ] After 5031ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:01:38] [INFO ] After 6401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1738 ms.
[2024-05-23 04:01:40] [INFO ] After 8204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 8419 steps with 107 reset in 68 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-03 finished in 171126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Applied a total of 0 rules in 152 ms. Remains 434 /434 variables (removed 0) and now considering 7344/7344 (removed 0) transitions.
[2024-05-23 04:01:41] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
// Phase 1: matrix 5003 rows 434 cols
[2024-05-23 04:01:41] [INFO ] Computed 2 invariants in 29 ms
[2024-05-23 04:01:41] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-23 04:01:41] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2024-05-23 04:01:41] [INFO ] Invariant cache hit.
[2024-05-23 04:01:42] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:01:43] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
[2024-05-23 04:01:43] [INFO ] Redundant transitions in 558 ms returned []
[2024-05-23 04:01:43] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2024-05-23 04:01:43] [INFO ] Invariant cache hit.
[2024-05-23 04:01:45] [INFO ] Dead Transitions using invariants and state equation in 1712 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4557 ms. Remains : 434/434 places, 7344/7344 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s265 1) (GEQ s432 1)), p1:(AND (GEQ s7 1) (GEQ s433 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 90 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 4616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 188 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 04:01:45] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2024-05-23 04:01:45] [INFO ] Computed 2 invariants in 22 ms
[2024-05-23 04:01:46] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-23 04:01:46] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:01:46] [INFO ] Invariant cache hit.
[2024-05-23 04:01:46] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:02:00] [INFO ] Implicit Places using invariants and state equation in 14728 ms returned []
Implicit Place search using SMT with State Equation took 15174 ms to find 0 implicit places.
[2024-05-23 04:02:01] [INFO ] Redundant transitions in 556 ms returned []
[2024-05-23 04:02:01] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:01] [INFO ] Invariant cache hit.
[2024-05-23 04:02:03] [INFO ] Dead Transitions using invariants and state equation in 1674 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17610 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s31 1) (GEQ s418 1)), p0:(AND (GEQ s57 1) (GEQ s388 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 53 steps with 0 reset in 2 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-07 finished in 17720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 187 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 04:02:03] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:03] [INFO ] Invariant cache hit.
[2024-05-23 04:02:03] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-23 04:02:03] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:03] [INFO ] Invariant cache hit.
[2024-05-23 04:02:04] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:02:17] [INFO ] Implicit Places using invariants and state equation in 13495 ms returned []
Implicit Place search using SMT with State Equation took 13926 ms to find 0 implicit places.
[2024-05-23 04:02:17] [INFO ] Redundant transitions in 529 ms returned []
[2024-05-23 04:02:17] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:17] [INFO ] Invariant cache hit.
[2024-05-23 04:02:19] [INFO ] Dead Transitions using invariants and state equation in 1701 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16355 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s51 1) (GEQ s384 1)), p1:(OR (LT s11 1) (LT s432 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 4 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-10 finished in 16478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 188 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 04:02:19] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:19] [INFO ] Invariant cache hit.
[2024-05-23 04:02:20] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-23 04:02:20] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:20] [INFO ] Invariant cache hit.
[2024-05-23 04:02:21] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:02:31] [INFO ] Implicit Places using invariants and state equation in 11625 ms returned []
Implicit Place search using SMT with State Equation took 12067 ms to find 0 implicit places.
[2024-05-23 04:02:32] [INFO ] Redundant transitions in 553 ms returned []
[2024-05-23 04:02:32] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:32] [INFO ] Invariant cache hit.
[2024-05-23 04:02:34] [INFO ] Dead Transitions using invariants and state equation in 1684 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14503 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s368 1) (GEQ s396 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]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-11 finished in 14609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 177 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 04:02:34] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:34] [INFO ] Invariant cache hit.
[2024-05-23 04:02:34] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-23 04:02:34] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:34] [INFO ] Invariant cache hit.
[2024-05-23 04:02:35] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:02:49] [INFO ] Implicit Places using invariants and state equation in 14299 ms returned []
Implicit Place search using SMT with State Equation took 14736 ms to find 0 implicit places.
[2024-05-23 04:02:49] [INFO ] Redundant transitions in 524 ms returned []
[2024-05-23 04:02:49] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:49] [INFO ] Invariant cache hit.
[2024-05-23 04:02:51] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17199 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 47 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 1285 reset in 697 ms.
Product exploration explored 100000 steps with 1254 reset in 709 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 118 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 52 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 186273 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186273 steps, saw 143085 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 04:02:56] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:02:56] [INFO ] Invariant cache hit.
[2024-05-23 04:02:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:02:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:02:58] [INFO ] After 2682ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:02:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:02:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:03:04] [INFO ] After 5437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:03:04] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:03:13] [INFO ] After 9138ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-23 04:03:13] [INFO ] After 14652ms 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, 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 160 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 160 ms. Remains : 433/433 places, 7154/7216 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Finished Best-First random walk after 3873 steps, including 5 resets, run visited all 1 properties in 6 ms. (steps per millisecond=645 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p1s2-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p1s2-LTLFireability-12 finished in 39630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1)) U (G((G(p2) U p1))||G(!p3))))'
Support contains 8 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 36 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 04:03:14] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:03:14] [INFO ] Invariant cache hit.
[2024-05-23 04:03:14] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-23 04:03:14] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:03:14] [INFO ] Invariant cache hit.
[2024-05-23 04:03:14] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:03:16] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2024-05-23 04:03:16] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:03:16] [INFO ] Invariant cache hit.
[2024-05-23 04:03:17] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3830 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 776 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 2407 steps with 32 reset in 18 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-14 finished in 4670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7344/7344 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7216
Applied a total of 2 rules in 182 ms. Remains 433 /434 variables (removed 1) and now considering 7216/7344 (removed 128) transitions.
[2024-05-23 04:03:18] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:03:18] [INFO ] Invariant cache hit.
[2024-05-23 04:03:19] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-23 04:03:19] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:03:19] [INFO ] Invariant cache hit.
[2024-05-23 04:03:19] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-23 04:03:20] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
[2024-05-23 04:03:21] [INFO ] Redundant transitions in 554 ms returned []
[2024-05-23 04:03:21] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2024-05-23 04:03:21] [INFO ] Invariant cache hit.
[2024-05-23 04:03:23] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7216/7344 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4580 ms. Remains : 433/434 places, 7216/7344 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s31 1) (GEQ s389 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]]
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 2 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-15 finished in 4680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0||F(!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))))))))'
[2024-05-23 04:03:23] [INFO ] Flatten gal took : 171 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2883014719549416705
[2024-05-23 04:03:23] [INFO ] Too many transitions (7344) to apply POR reductions. Disabling POR matrices.
[2024-05-23 04:03:23] [INFO ] Applying decomposition
[2024-05-23 04:03:23] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2883014719549416705
Running compilation step : cd /tmp/ltsmin2883014719549416705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 04:03:24] [INFO ] Flatten gal took : 178 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3350374224658281300.txt' '-o' '/tmp/graph3350374224658281300.bin' '-w' '/tmp/graph3350374224658281300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3350374224658281300.bin' '-l' '-1' '-v' '-w' '/tmp/graph3350374224658281300.weights' '-q' '0' '-e' '0.001'
[2024-05-23 04:03:24] [INFO ] Decomposing Gal with order
[2024-05-23 04:03:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 04:03:24] [INFO ] Removed a total of 17653 redundant transitions.
[2024-05-23 04:03:24] [INFO ] Flatten gal took : 314 ms
[2024-05-23 04:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1053 labels/synchronizations in 200 ms.
[2024-05-23 04:03:25] [INFO ] Time to serialize gal into /tmp/LTLFireability12820199057059008235.gal : 101 ms
[2024-05-23 04:03:25] [INFO ] Time to serialize properties into /tmp/LTLFireability122172709088795190.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12820199057059008235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability122172709088795190.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((!("((i4.i2.u123.p125>=1)&&(i16.i1.u141.l47>=1))"))||(F(!("((i4.i2.u123.p125>=1)&&(i16.i1.u141.l47>=1))"))))U((G((!("((i4.i2.u...1051
Formula 0 simplified : FG"((i4.i2.u123.p125>=1)&&(i16.i1.u141.l47>=1))"
Compilation finished in 27052 ms.
Running link step : cd /tmp/ltsmin2883014719549416705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin2883014719549416705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((!(LTLAPp0==true)||<>(!(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.
[2024-05-23 04:26:22] [INFO ] Flatten gal took : 375 ms
[2024-05-23 04:26:22] [INFO ] Time to serialize gal into /tmp/LTLFireability16941567721122679983.gal : 53 ms
[2024-05-23 04:26:22] [INFO ] Time to serialize properties into /tmp/LTLFireability17067726806369084324.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16941567721122679983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17067726806369084324.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
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.
[2024-05-23 04:49:22] [INFO ] Flatten gal took : 1604 ms
[2024-05-23 04:49:30] [INFO ] Input system was already deterministic with 7344 transitions.
[2024-05-23 04:49:30] [INFO ] Transformed 434 places.
[2024-05-23 04:49:30] [INFO ] Transformed 7344 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
[2024-05-23 04:49:31] [INFO ] Time to serialize gal into /tmp/LTLFireability14058458428062443350.gal : 143 ms
[2024-05-23 04:49:31] [INFO ] Time to serialize properties into /tmp/LTLFireability4070701478964813156.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14058458428062443350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4070701478964813156.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 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: 10088564 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16253504 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleLock-PT-p1s2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is 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 r153-tall-171631151700373"
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 '
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 ;