Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.8K Feb 25 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 21:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 539K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679191971111

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 02:12:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 02:12:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:12:53] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-19 02:12:53] [INFO ] Transformed 1903 places.
[2023-03-19 02:12:53] [INFO ] Transformed 1403 transitions.
[2023-03-19 02:12:53] [INFO ] Found NUPN structural information;
[2023-03-19 02:12:53] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-100A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 294 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:12:54] [INFO ] Computed 901 place invariants in 55 ms
[2023-03-19 02:12:58] [INFO ] Implicit Places using invariants in 3732 ms returned []
[2023-03-19 02:12:58] [INFO ] Invariant cache hit.
[2023-03-19 02:13:06] [INFO ] Implicit Places using invariants and state equation in 8453 ms returned []
Implicit Place search using SMT with State Equation took 12269 ms to find 0 implicit places.
[2023-03-19 02:13:06] [INFO ] Invariant cache hit.
[2023-03-19 02:13:09] [INFO ] Dead Transitions using invariants and state equation in 2577 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15144 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Support contains 60 out of 1903 places after structural reductions.
[2023-03-19 02:13:09] [INFO ] Flatten gal took : 281 ms
[2023-03-19 02:13:10] [INFO ] Flatten gal took : 130 ms
[2023-03-19 02:13:10] [INFO ] Input system was already deterministic with 1402 transitions.
Support contains 57 out of 1903 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 44566 steps, run timeout after 3004 ms. (steps per millisecond=14 ) properties seen :{2=1, 10=1, 15=1, 17=1, 18=1, 21=1, 26=1}
Probabilistic random walk after 44566 steps, saw 43770 distinct states, run finished after 3006 ms. (steps per millisecond=14 ) properties seen :7
Running SMT prover for 21 properties.
[2023-03-19 02:13:14] [INFO ] Invariant cache hit.
[2023-03-19 02:13:16] [INFO ] [Real]Absence check using 901 positive place invariants in 1046 ms returned sat
[2023-03-19 02:13:20] [INFO ] After 6184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-19 02:13:22] [INFO ] [Nat]Absence check using 901 positive place invariants in 275 ms returned sat
[2023-03-19 02:13:36] [INFO ] After 12311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-19 02:13:47] [INFO ] Deduced a trap composed of 3 places in 1483 ms of which 22 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 02:13:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 02:13:47] [INFO ] After 26520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Parikh walk visited 0 properties in 11336 ms.
Support contains 42 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 192 times.
Drop transitions removed 192 transitions
Iterating global reduction 0 with 192 rules applied. Total rules applied 196 place count 1901 transition count 1400
Applied a total of 196 rules in 390 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 44563 steps, run timeout after 3008 ms. (steps per millisecond=14 ) properties seen :{1=1, 4=1, 15=1, 20=1}
Probabilistic random walk after 44563 steps, saw 43420 distinct states, run finished after 3009 ms. (steps per millisecond=14 ) properties seen :4
Running SMT prover for 17 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:14:03] [INFO ] Computed 901 place invariants in 8 ms
[2023-03-19 02:14:04] [INFO ] [Real]Absence check using 901 positive place invariants in 398 ms returned sat
[2023-03-19 02:14:08] [INFO ] After 4833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 02:14:09] [INFO ] [Nat]Absence check using 901 positive place invariants in 290 ms returned sat
[2023-03-19 02:14:15] [INFO ] After 4949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 02:14:15] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-19 02:14:20] [INFO ] After 4843ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 02:14:24] [INFO ] After 9307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 4288 ms.
[2023-03-19 02:14:29] [INFO ] After 20844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 8102 ms.
Support contains 35 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1901 transition count 1400
Applied a total of 2 rules in 218 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 46784 steps, run timeout after 3004 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 46784 steps, saw 45625 distinct states, run finished after 3006 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:14:41] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-19 02:14:42] [INFO ] [Real]Absence check using 901 positive place invariants in 247 ms returned sat
[2023-03-19 02:14:45] [INFO ] After 4584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 02:14:47] [INFO ] [Nat]Absence check using 901 positive place invariants in 263 ms returned sat
[2023-03-19 02:14:53] [INFO ] After 5595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 02:14:53] [INFO ] State equation strengthened by 99 read => feed constraints.
[2023-03-19 02:14:58] [INFO ] After 4627ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 02:15:02] [INFO ] After 8992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 4690 ms.
[2023-03-19 02:15:07] [INFO ] After 21388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 1 properties in 8239 ms.
Support contains 33 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 67 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 95 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-19 02:15:15] [INFO ] Invariant cache hit.
[2023-03-19 02:15:19] [INFO ] Implicit Places using invariants in 3760 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3783 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 122 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-19 02:15:19] [INFO ] Computed 899 place invariants in 5 ms
[2023-03-19 02:15:23] [INFO ] Implicit Places using invariants in 3510 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3519 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 161 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-19 02:15:23] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-19 02:15:24] [INFO ] Implicit Places using invariants in 1614 ms returned []
[2023-03-19 02:15:24] [INFO ] Invariant cache hit.
[2023-03-19 02:15:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-19 02:15:31] [INFO ] Implicit Places using invariants and state equation in 6902 ms returned []
Implicit Place search using SMT with State Equation took 8557 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 16239 ms. Remains : 1896/1901 places, 1398/1400 transitions.
FORMULA ShieldIIPt-PT-100A-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((!p1 U (p2||G(!p1))))))))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 130 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:15:32] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-19 02:15:35] [INFO ] Implicit Places using invariants in 2673 ms returned []
[2023-03-19 02:15:35] [INFO ] Invariant cache hit.
[2023-03-19 02:15:38] [INFO ] Implicit Places using invariants and state equation in 3366 ms returned []
Implicit Place search using SMT with State Equation took 6061 ms to find 0 implicit places.
[2023-03-19 02:15:38] [INFO ] Invariant cache hit.
[2023-03-19 02:15:40] [INFO ] Dead Transitions using invariants and state equation in 2421 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8627 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s590 1), p2:(AND (NEQ s1236 1) (NOT (AND (EQ s881 1) (EQ s883 1)))), p1:(AND (EQ s881 1) (EQ s883 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1725 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-00 finished in 10995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(p1)))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 148 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:15:43] [INFO ] Invariant cache hit.
[2023-03-19 02:15:45] [INFO ] Implicit Places using invariants in 1861 ms returned []
[2023-03-19 02:15:45] [INFO ] Invariant cache hit.
[2023-03-19 02:15:49] [INFO ] Implicit Places using invariants and state equation in 4090 ms returned []
Implicit Place search using SMT with State Equation took 5972 ms to find 0 implicit places.
[2023-03-19 02:15:49] [INFO ] Invariant cache hit.
[2023-03-19 02:15:51] [INFO ] Dead Transitions using invariants and state equation in 1729 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7868 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s516 1) (EQ s533 1)), p1:(AND (EQ s611 1) (EQ s628 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1491 ms.
Product exploration explored 100000 steps with 0 reset in 1984 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 719 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Finished probabilistic random walk after 81344 steps, run visited all 3 properties in 2565 ms. (steps per millisecond=31 )
Probabilistic random walk after 81344 steps, saw 80318 distinct states, run finished after 2569 ms. (steps per millisecond=31 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 663 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 243 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2023-03-19 02:16:00] [INFO ] Invariant cache hit.
[2023-03-19 02:16:02] [INFO ] [Real]Absence check using 901 positive place invariants in 483 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 353 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100A-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-01 finished in 19828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(F(p1)))))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1902 transition count 1400
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1900 transition count 1400
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1898 transition count 1399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 1898 transition count 1398
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1897 transition count 1398
Applied a total of 8 rules in 342 ms. Remains 1897 /1903 variables (removed 6) and now considering 1398/1402 (removed 4) transitions.
// Phase 1: matrix 1398 rows 1897 cols
[2023-03-19 02:16:03] [INFO ] Computed 899 place invariants in 4 ms
[2023-03-19 02:16:05] [INFO ] Implicit Places using invariants in 1821 ms returned [1886]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1838 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1896/1903 places, 1398/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1895 transition count 1397
Applied a total of 2 rules in 159 ms. Remains 1895 /1896 variables (removed 1) and now considering 1397/1398 (removed 1) transitions.
// Phase 1: matrix 1397 rows 1895 cols
[2023-03-19 02:16:05] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-19 02:16:07] [INFO ] Implicit Places using invariants in 1742 ms returned []
[2023-03-19 02:16:07] [INFO ] Invariant cache hit.
[2023-03-19 02:16:09] [INFO ] Implicit Places using invariants and state equation in 2838 ms returned []
Implicit Place search using SMT with State Equation took 4599 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1895/1903 places, 1397/1402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6945 ms. Remains : 1895/1903 places, 1397/1402 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s851 0), p1:(OR (NEQ s1368 1) (NEQ s1691 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1578 ms.
Product exploration explored 100000 steps with 0 reset in 2199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 92226 steps, run timeout after 3006 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92226 steps, saw 91100 distinct states, run finished after 3007 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 02:16:18] [INFO ] Invariant cache hit.
[2023-03-19 02:16:18] [INFO ] [Real]Absence check using 898 positive place invariants in 282 ms returned sat
[2023-03-19 02:16:20] [INFO ] After 2114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 02:16:21] [INFO ] [Nat]Absence check using 898 positive place invariants in 230 ms returned sat
[2023-03-19 02:16:22] [INFO ] After 1033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 02:16:22] [INFO ] After 1386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 223 ms.
[2023-03-19 02:16:22] [INFO ] After 2664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 213 ms.
Support contains 3 out of 1895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 75 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 101855 steps, run timeout after 3004 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101855 steps, saw 100682 distinct states, run finished after 3004 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 02:16:26] [INFO ] Invariant cache hit.
[2023-03-19 02:16:27] [INFO ] [Real]Absence check using 898 positive place invariants in 343 ms returned sat
[2023-03-19 02:16:28] [INFO ] After 2325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 02:16:29] [INFO ] [Nat]Absence check using 898 positive place invariants in 241 ms returned sat
[2023-03-19 02:16:30] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 02:16:31] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-03-19 02:16:31] [INFO ] After 2378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 161 ms.
Support contains 3 out of 1895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 87 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 155 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-19 02:16:31] [INFO ] Invariant cache hit.
[2023-03-19 02:16:33] [INFO ] Implicit Places using invariants in 2103 ms returned []
[2023-03-19 02:16:33] [INFO ] Invariant cache hit.
[2023-03-19 02:16:36] [INFO ] Implicit Places using invariants and state equation in 2402 ms returned []
Implicit Place search using SMT with State Equation took 4507 ms to find 0 implicit places.
[2023-03-19 02:16:36] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-19 02:16:36] [INFO ] Invariant cache hit.
[2023-03-19 02:16:37] [INFO ] Dead Transitions using invariants and state equation in 1497 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6276 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 84 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 02:16:37] [INFO ] Invariant cache hit.
[2023-03-19 02:16:38] [INFO ] [Real]Absence check using 898 positive place invariants in 310 ms returned sat
[2023-03-19 02:16:39] [INFO ] After 1801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 02:16:40] [INFO ] [Nat]Absence check using 898 positive place invariants in 237 ms returned sat
[2023-03-19 02:16:41] [INFO ] After 1313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 02:16:42] [INFO ] After 1662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-19 02:16:42] [INFO ] After 2744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 337 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 107 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-19 02:16:43] [INFO ] Invariant cache hit.
[2023-03-19 02:16:45] [INFO ] Implicit Places using invariants in 1902 ms returned []
[2023-03-19 02:16:45] [INFO ] Invariant cache hit.
[2023-03-19 02:16:48] [INFO ] Implicit Places using invariants and state equation in 2955 ms returned []
Implicit Place search using SMT with State Equation took 4871 ms to find 0 implicit places.
[2023-03-19 02:16:48] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-19 02:16:48] [INFO ] Invariant cache hit.
[2023-03-19 02:16:49] [INFO ] Dead Transitions using invariants and state equation in 1605 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6743 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 98421 steps, run timeout after 3006 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98421 steps, saw 97266 distinct states, run finished after 3006 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 02:16:55] [INFO ] Invariant cache hit.
[2023-03-19 02:16:55] [INFO ] [Real]Absence check using 898 positive place invariants in 192 ms returned sat
[2023-03-19 02:16:57] [INFO ] After 2115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 02:16:57] [INFO ] [Nat]Absence check using 898 positive place invariants in 220 ms returned sat
[2023-03-19 02:16:58] [INFO ] After 1018ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 02:16:59] [INFO ] After 1300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-19 02:16:59] [INFO ] After 2223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 132 ms.
Support contains 3 out of 1895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 145 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 90826 steps, run timeout after 3006 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90826 steps, saw 89708 distinct states, run finished after 3006 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 02:17:03] [INFO ] Invariant cache hit.
[2023-03-19 02:17:04] [INFO ] [Real]Absence check using 898 positive place invariants in 278 ms returned sat
[2023-03-19 02:17:05] [INFO ] After 1966ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 02:17:06] [INFO ] [Nat]Absence check using 898 positive place invariants in 849 ms returned sat
[2023-03-19 02:17:07] [INFO ] After 928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 02:17:08] [INFO ] After 1127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-19 02:17:08] [INFO ] After 2959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 99 ms.
Support contains 3 out of 1895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 77 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 138 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-19 02:17:08] [INFO ] Invariant cache hit.
[2023-03-19 02:17:11] [INFO ] Implicit Places using invariants in 2599 ms returned []
[2023-03-19 02:17:11] [INFO ] Invariant cache hit.
[2023-03-19 02:17:12] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 3766 ms to find 0 implicit places.
[2023-03-19 02:17:12] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-19 02:17:12] [INFO ] Invariant cache hit.
[2023-03-19 02:17:14] [INFO ] Dead Transitions using invariants and state equation in 1789 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5757 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 152 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 02:17:14] [INFO ] Invariant cache hit.
[2023-03-19 02:17:15] [INFO ] [Real]Absence check using 898 positive place invariants in 188 ms returned sat
[2023-03-19 02:17:16] [INFO ] After 2002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 02:17:16] [INFO ] [Nat]Absence check using 898 positive place invariants in 169 ms returned sat
[2023-03-19 02:17:18] [INFO ] After 1112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 02:17:18] [INFO ] After 1391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-19 02:17:18] [INFO ] After 2184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1993 ms.
Product exploration explored 100000 steps with 0 reset in 2221 ms.
Built C files in :
/tmp/ltsmin3679610525311038651
[2023-03-19 02:17:23] [INFO ] Computing symmetric may disable matrix : 1397 transitions.
[2023-03-19 02:17:23] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:17:23] [INFO ] Computing symmetric may enable matrix : 1397 transitions.
[2023-03-19 02:17:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:17:23] [INFO ] Computing Do-Not-Accords matrix : 1397 transitions.
[2023-03-19 02:17:23] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:17:24] [INFO ] Built C files in 420ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3679610525311038651
Running compilation step : cd /tmp/ltsmin3679610525311038651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3679610525311038651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3679610525311038651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1895/1895 places, 1397/1397 transitions.
Applied a total of 0 rules in 106 ms. Remains 1895 /1895 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-19 02:17:27] [INFO ] Invariant cache hit.
[2023-03-19 02:17:29] [INFO ] Implicit Places using invariants in 2286 ms returned []
[2023-03-19 02:17:29] [INFO ] Invariant cache hit.
[2023-03-19 02:17:32] [INFO ] Implicit Places using invariants and state equation in 2882 ms returned []
Implicit Place search using SMT with State Equation took 5170 ms to find 0 implicit places.
[2023-03-19 02:17:32] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-19 02:17:32] [INFO ] Invariant cache hit.
[2023-03-19 02:17:33] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6821 ms. Remains : 1895/1895 places, 1397/1397 transitions.
Built C files in :
/tmp/ltsmin2775232511759249976
[2023-03-19 02:17:33] [INFO ] Computing symmetric may disable matrix : 1397 transitions.
[2023-03-19 02:17:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:17:33] [INFO ] Computing symmetric may enable matrix : 1397 transitions.
[2023-03-19 02:17:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:17:34] [INFO ] Computing Do-Not-Accords matrix : 1397 transitions.
[2023-03-19 02:17:34] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:17:34] [INFO ] Built C files in 398ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2775232511759249976
Running compilation step : cd /tmp/ltsmin2775232511759249976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2775232511759249976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2775232511759249976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 02:17:37] [INFO ] Flatten gal took : 53 ms
[2023-03-19 02:17:37] [INFO ] Flatten gal took : 91 ms
[2023-03-19 02:17:37] [INFO ] Time to serialize gal into /tmp/LTL1096187123847972311.gal : 16 ms
[2023-03-19 02:17:37] [INFO ] Time to serialize properties into /tmp/LTL8677831471070046381.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1096187123847972311.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10828144165553073223.hoa' '-atoms' '/tmp/LTL8677831471070046381.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8677831471070046381.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10828144165553073223.hoa
Detected timeout of ITS tools.
[2023-03-19 02:17:52] [INFO ] Flatten gal took : 52 ms
[2023-03-19 02:17:52] [INFO ] Flatten gal took : 59 ms
[2023-03-19 02:17:52] [INFO ] Time to serialize gal into /tmp/LTL12101723025925190811.gal : 8 ms
[2023-03-19 02:17:52] [INFO ] Time to serialize properties into /tmp/LTL6362062115722824447.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12101723025925190811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6362062115722824447.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p852==0)")||(X(X(F("((p1369==0)||(p1692==0))"))))))))
Formula 0 simplified : G(F!"(p852==0)" & FG!"((p1369==0)||(p1692==0))")
Detected timeout of ITS tools.
[2023-03-19 02:18:08] [INFO ] Flatten gal took : 88 ms
[2023-03-19 02:18:08] [INFO ] Applying decomposition
[2023-03-19 02:18:08] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8255801681612778670.txt' '-o' '/tmp/graph8255801681612778670.bin' '-w' '/tmp/graph8255801681612778670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8255801681612778670.bin' '-l' '-1' '-v' '-w' '/tmp/graph8255801681612778670.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:18:08] [INFO ] Decomposing Gal with order
[2023-03-19 02:18:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:18:08] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-19 02:18:08] [INFO ] Flatten gal took : 153 ms
[2023-03-19 02:18:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2023-03-19 02:18:08] [INFO ] Time to serialize gal into /tmp/LTL9376323027885756373.gal : 19 ms
[2023-03-19 02:18:08] [INFO ] Time to serialize properties into /tmp/LTL13159947666670625196.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9376323027885756373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13159947666670625196.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i16.i1.i2.u358.p852==0)")||(X(X(F("((i28.i0.i0.u576.p1369==0)||(i33.i2.i2.u712.p1692==0))"))))))))
Formula 0 simplified : G(F!"(i16.i1.i2.u358.p852==0)" & FG!"((i28.i0.i0.u576.p1369==0)||(i33.i2.i2.u712.p1692==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
196 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.18412,56628,1,0,80366,174,4950,157230,115,736,134061
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLFireability-04 finished in 128362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 108 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:18:11] [INFO ] Computed 901 place invariants in 9 ms
[2023-03-19 02:18:13] [INFO ] Implicit Places using invariants in 1724 ms returned []
[2023-03-19 02:18:13] [INFO ] Invariant cache hit.
[2023-03-19 02:18:17] [INFO ] Implicit Places using invariants and state equation in 3818 ms returned []
Implicit Place search using SMT with State Equation took 5544 ms to find 0 implicit places.
[2023-03-19 02:18:17] [INFO ] Invariant cache hit.
[2023-03-19 02:18:19] [INFO ] Dead Transitions using invariants and state equation in 2064 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7730 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 329 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-05 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (NEQ s488 1) (NEQ s494 1) (NEQ s496 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1586 ms.
Product exploration explored 100000 steps with 0 reset in 2367 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Finished probabilistic random walk after 83539 steps, run visited all 1 properties in 2095 ms. (steps per millisecond=39 )
Probabilistic random walk after 83539 steps, saw 82501 distinct states, run finished after 2100 ms. (steps per millisecond=39 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 117 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:18:27] [INFO ] Invariant cache hit.
[2023-03-19 02:18:29] [INFO ] Implicit Places using invariants in 2522 ms returned []
[2023-03-19 02:18:29] [INFO ] Invariant cache hit.
[2023-03-19 02:18:34] [INFO ] Implicit Places using invariants and state equation in 4946 ms returned []
Implicit Place search using SMT with State Equation took 7504 ms to find 0 implicit places.
[2023-03-19 02:18:34] [INFO ] Invariant cache hit.
[2023-03-19 02:18:36] [INFO ] Dead Transitions using invariants and state equation in 1777 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9403 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Finished probabilistic random walk after 83539 steps, run visited all 1 properties in 2305 ms. (steps per millisecond=36 )
Probabilistic random walk after 83539 steps, saw 82501 distinct states, run finished after 2309 ms. (steps per millisecond=36 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 397 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 429 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1573 ms.
Product exploration explored 100000 steps with 0 reset in 1863 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 421 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:18:45] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:18:45] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-19 02:18:47] [INFO ] Dead Transitions using invariants and state equation in 1797 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2264 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin6272588830586096243
[2023-03-19 02:18:47] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6272588830586096243
Running compilation step : cd /tmp/ltsmin6272588830586096243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2914 ms.
Running link step : cd /tmp/ltsmin6272588830586096243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin6272588830586096243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2729035605473807107.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 88 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:19:02] [INFO ] Computed 901 place invariants in 9 ms
[2023-03-19 02:19:05] [INFO ] Implicit Places using invariants in 2443 ms returned []
[2023-03-19 02:19:05] [INFO ] Invariant cache hit.
[2023-03-19 02:19:08] [INFO ] Implicit Places using invariants and state equation in 3623 ms returned []
Implicit Place search using SMT with State Equation took 6083 ms to find 0 implicit places.
[2023-03-19 02:19:08] [INFO ] Invariant cache hit.
[2023-03-19 02:19:10] [INFO ] Dead Transitions using invariants and state equation in 1594 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7780 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin16590006599554806833
[2023-03-19 02:19:10] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16590006599554806833
Running compilation step : cd /tmp/ltsmin16590006599554806833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2997 ms.
Running link step : cd /tmp/ltsmin16590006599554806833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16590006599554806833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11549558003994219136.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 02:19:25] [INFO ] Flatten gal took : 114 ms
[2023-03-19 02:19:25] [INFO ] Flatten gal took : 108 ms
[2023-03-19 02:19:26] [INFO ] Time to serialize gal into /tmp/LTL5712609958228735977.gal : 8 ms
[2023-03-19 02:19:26] [INFO ] Time to serialize properties into /tmp/LTL10562229525413604784.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5712609958228735977.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15387066378003076942.hoa' '-atoms' '/tmp/LTL10562229525413604784.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10562229525413604784.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15387066378003076942.hoa
Detected timeout of ITS tools.
[2023-03-19 02:19:41] [INFO ] Flatten gal took : 154 ms
[2023-03-19 02:19:41] [INFO ] Flatten gal took : 138 ms
[2023-03-19 02:19:41] [INFO ] Time to serialize gal into /tmp/LTL13840270923348759896.gal : 37 ms
[2023-03-19 02:19:41] [INFO ] Time to serialize properties into /tmp/LTL15159718926711791994.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13840270923348759896.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15159718926711791994.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(((p488==0)||(p494==0))||(p496==0))")))))))
Formula 0 simplified : XXXXF!"(((p488==0)||(p494==0))||(p496==0))"
Detected timeout of ITS tools.
[2023-03-19 02:19:56] [INFO ] Flatten gal took : 182 ms
[2023-03-19 02:19:56] [INFO ] Applying decomposition
[2023-03-19 02:19:56] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8896947840116078010.txt' '-o' '/tmp/graph8896947840116078010.bin' '-w' '/tmp/graph8896947840116078010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8896947840116078010.bin' '-l' '-1' '-v' '-w' '/tmp/graph8896947840116078010.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:19:56] [INFO ] Decomposing Gal with order
[2023-03-19 02:19:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:19:57] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 02:19:57] [INFO ] Flatten gal took : 100 ms
[2023-03-19 02:19:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 153 ms.
[2023-03-19 02:19:57] [INFO ] Time to serialize gal into /tmp/LTL8168290399989791443.gal : 28 ms
[2023-03-19 02:19:57] [INFO ] Time to serialize properties into /tmp/LTL4832404634966075434.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8168290399989791443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4832404634966075434.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("(((i12.i0.i0.u204.p488==0)||(i11.u207.p494==0))||(i11.u208.p496==0))")))))))
Formula 0 simplified : XXXXF!"(((i12.i0.i0.u204.p488==0)||(i11.u207.p494==0))||(i11.u208.p496==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
327 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.58793,85864,1,0,136991,1085,6182,314663,119,9608,203626
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLFireability-05 finished in 110210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(!p1 U G(!p2))))'
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 221 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:20:01] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-19 02:20:04] [INFO ] Implicit Places using invariants in 2302 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2328 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 144 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-19 02:20:04] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-19 02:20:05] [INFO ] Implicit Places using invariants in 1684 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1686 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 118 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-19 02:20:06] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-19 02:20:07] [INFO ] Implicit Places using invariants in 1746 ms returned []
[2023-03-19 02:20:07] [INFO ] Invariant cache hit.
[2023-03-19 02:20:11] [INFO ] Implicit Places using invariants and state equation in 4190 ms returned []
Implicit Place search using SMT with State Equation took 5947 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 10444 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s708 1) (EQ s719 1)), p2:(AND (EQ s982 1) (EQ s988 1) (EQ s990 1)), p1:(OR (AND (EQ s708 1) (EQ s719 1)) (EQ s322 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1600 ms.
Product exploration explored 100000 steps with 0 reset in 1968 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1000 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 79214 steps, run timeout after 3005 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 79214 steps, saw 78154 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :5
Running SMT prover for 2 properties.
[2023-03-19 02:20:21] [INFO ] Invariant cache hit.
[2023-03-19 02:20:22] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 02:20:23] [INFO ] [Nat]Absence check using 898 positive place invariants in 421 ms returned sat
[2023-03-19 02:20:27] [INFO ] After 3910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 02:20:27] [INFO ] After 4258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 697 ms.
[2023-03-19 02:20:28] [INFO ] After 5842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 508 ms.
Support contains 6 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 0 with 197 rules applied. Total rules applied 197 place count 1896 transition count 1398
Applied a total of 197 rules in 121 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Finished probabilistic random walk after 75056 steps, run visited all 2 properties in 1945 ms. (steps per millisecond=38 )
Probabilistic random walk after 75056 steps, saw 73729 distinct states, run finished after 1948 ms. (steps per millisecond=38 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2))]
Knowledge based reduction with 15 factoid took 1350 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 536 ms :[(AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2)]
Support contains 6 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 70 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-19 02:20:33] [INFO ] Invariant cache hit.
[2023-03-19 02:20:35] [INFO ] Implicit Places using invariants in 2511 ms returned []
[2023-03-19 02:20:35] [INFO ] Invariant cache hit.
[2023-03-19 02:20:38] [INFO ] Implicit Places using invariants and state equation in 2966 ms returned []
Implicit Place search using SMT with State Equation took 5496 ms to find 0 implicit places.
[2023-03-19 02:20:38] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-19 02:20:38] [INFO ] Invariant cache hit.
[2023-03-19 02:20:41] [INFO ] Dead Transitions using invariants and state equation in 2196 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7857 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 787 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 84465 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{0=1, 1=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 84465 steps, saw 83377 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :5
Running SMT prover for 2 properties.
[2023-03-19 02:20:46] [INFO ] Invariant cache hit.
[2023-03-19 02:20:47] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 02:20:48] [INFO ] [Nat]Absence check using 898 positive place invariants in 286 ms returned sat
[2023-03-19 02:20:51] [INFO ] After 2861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 02:20:51] [INFO ] After 3301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 751 ms.
[2023-03-19 02:20:52] [INFO ] After 4963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 630 ms.
Support contains 6 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 0 with 197 rules applied. Total rules applied 197 place count 1896 transition count 1398
Applied a total of 197 rules in 123 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Finished probabilistic random walk after 75056 steps, run visited all 2 properties in 2033 ms. (steps per millisecond=36 )
Probabilistic random walk after 75056 steps, saw 73729 distinct states, run finished after 2036 ms. (steps per millisecond=36 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2))]
Knowledge based reduction with 15 factoid took 1313 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 0 reset in 1561 ms.
Product exploration explored 100000 steps with 0 reset in 1841 ms.
Built C files in :
/tmp/ltsmin10907025492170660305
[2023-03-19 02:21:01] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2023-03-19 02:21:01] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:21:01] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2023-03-19 02:21:01] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:21:01] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2023-03-19 02:21:01] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:21:01] [INFO ] Built C files in 343ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10907025492170660305
Running compilation step : cd /tmp/ltsmin10907025492170660305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10907025492170660305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10907025492170660305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 66 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-19 02:21:04] [INFO ] Invariant cache hit.
[2023-03-19 02:21:06] [INFO ] Implicit Places using invariants in 2169 ms returned []
[2023-03-19 02:21:06] [INFO ] Invariant cache hit.
[2023-03-19 02:21:11] [INFO ] Implicit Places using invariants and state equation in 4644 ms returned []
Implicit Place search using SMT with State Equation took 6830 ms to find 0 implicit places.
[2023-03-19 02:21:11] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-19 02:21:11] [INFO ] Invariant cache hit.
[2023-03-19 02:21:13] [INFO ] Dead Transitions using invariants and state equation in 1907 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8875 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin13332551619565615056
[2023-03-19 02:21:13] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2023-03-19 02:21:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:21:13] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2023-03-19 02:21:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:21:13] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2023-03-19 02:21:13] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:21:13] [INFO ] Built C files in 326ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13332551619565615056
Running compilation step : cd /tmp/ltsmin13332551619565615056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13332551619565615056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13332551619565615056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 02:21:17] [INFO ] Flatten gal took : 118 ms
[2023-03-19 02:21:17] [INFO ] Flatten gal took : 94 ms
[2023-03-19 02:21:17] [INFO ] Time to serialize gal into /tmp/LTL13082649833158083685.gal : 19 ms
[2023-03-19 02:21:17] [INFO ] Time to serialize properties into /tmp/LTL5104335715453203473.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13082649833158083685.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2642049666262811878.hoa' '-atoms' '/tmp/LTL5104335715453203473.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5104335715453203473.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2642049666262811878.hoa
Detected timeout of ITS tools.
[2023-03-19 02:21:32] [INFO ] Flatten gal took : 86 ms
[2023-03-19 02:21:32] [INFO ] Flatten gal took : 108 ms
[2023-03-19 02:21:32] [INFO ] Time to serialize gal into /tmp/LTL932742294994474961.gal : 21 ms
[2023-03-19 02:21:32] [INFO ] Time to serialize properties into /tmp/LTL12008671863609425489.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL932742294994474961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12008671863609425489.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("((p708==1)&&(p719==1))"))||((!("(((p708==1)&&(p719==1))||(p322==1))"))U(G(!("(((p982==1)&&(p988==1))&&(p990==1))"))))))
Formula 0 simplified : G!"((p708==1)&&(p719==1))" & ("(((p708==1)&&(p719==1))||(p322==1))" R F"(((p982==1)&&(p988==1))&&(p990==1))")
Detected timeout of ITS tools.
[2023-03-19 02:21:47] [INFO ] Flatten gal took : 133 ms
[2023-03-19 02:21:47] [INFO ] Applying decomposition
[2023-03-19 02:21:47] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6295936554528153271.txt' '-o' '/tmp/graph6295936554528153271.bin' '-w' '/tmp/graph6295936554528153271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6295936554528153271.bin' '-l' '-1' '-v' '-w' '/tmp/graph6295936554528153271.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:21:48] [INFO ] Decomposing Gal with order
[2023-03-19 02:21:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:21:48] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-19 02:21:48] [INFO ] Flatten gal took : 93 ms
[2023-03-19 02:21:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 159 ms.
[2023-03-19 02:21:48] [INFO ] Time to serialize gal into /tmp/LTL11407236386886598342.gal : 23 ms
[2023-03-19 02:21:48] [INFO ] Time to serialize properties into /tmp/LTL12465076363255544894.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11407236386886598342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12465076363255544894.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((F("((i16.i0.i2.u298.p708==1)&&(i16.i0.i1.u302.p719==1))"))||((!("(((i16.i0.i2.u298.p708==1)&&(i16.i0.i1.u302.p719==1))||(i6.i1.i2....266
Formula 0 simplified : G!"((i16.i0.i2.u298.p708==1)&&(i16.i0.i1.u302.p719==1))" & ("(((i16.i0.i2.u298.p708==1)&&(i16.i0.i1.u302.p719==1))||(i6.i1.i2.u135.p...251
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
1363 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.9102,414764,1,0,507511,981,6562,3.14954e+06,118,7904,266962
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-LTLFireability-06 finished in 122010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 51 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:22:03] [INFO ] Computed 901 place invariants in 4 ms
[2023-03-19 02:22:06] [INFO ] Implicit Places using invariants in 2439 ms returned []
[2023-03-19 02:22:06] [INFO ] Invariant cache hit.
[2023-03-19 02:22:10] [INFO ] Implicit Places using invariants and state equation in 4001 ms returned []
Implicit Place search using SMT with State Equation took 6451 ms to find 0 implicit places.
[2023-03-19 02:22:10] [INFO ] Invariant cache hit.
[2023-03-19 02:22:11] [INFO ] Dead Transitions using invariants and state equation in 1272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7789 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s37 1), p0:(AND (EQ s467 1) (EQ s471 1) (EQ s477 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-07 finished in 7977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 62 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:22:11] [INFO ] Invariant cache hit.
[2023-03-19 02:22:13] [INFO ] Implicit Places using invariants in 2056 ms returned []
[2023-03-19 02:22:13] [INFO ] Invariant cache hit.
[2023-03-19 02:22:18] [INFO ] Implicit Places using invariants and state equation in 4639 ms returned []
Implicit Place search using SMT with State Equation took 6699 ms to find 0 implicit places.
[2023-03-19 02:22:18] [INFO ] Invariant cache hit.
[2023-03-19 02:22:20] [INFO ] Dead Transitions using invariants and state equation in 2113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8875 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s365 0) (EQ s378 0)), p1:(EQ s624 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6201 ms.
Product exploration explored 100000 steps with 50000 reset in 6442 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100A-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-08 finished in 21892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 75 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:22:33] [INFO ] Invariant cache hit.
[2023-03-19 02:22:35] [INFO ] Implicit Places using invariants in 2433 ms returned []
[2023-03-19 02:22:35] [INFO ] Invariant cache hit.
[2023-03-19 02:22:40] [INFO ] Implicit Places using invariants and state equation in 4657 ms returned []
Implicit Place search using SMT with State Equation took 7120 ms to find 0 implicit places.
[2023-03-19 02:22:40] [INFO ] Invariant cache hit.
[2023-03-19 02:22:42] [INFO ] Dead Transitions using invariants and state equation in 2012 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9209 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1384 0), p1:(OR (NEQ s615 1) (NEQ s617 1) (AND (EQ s521 1) (EQ s532 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1371 ms.
Product exploration explored 100000 steps with 0 reset in 1778 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Finished probabilistic random walk after 73710 steps, run visited all 1 properties in 1328 ms. (steps per millisecond=55 )
Probabilistic random walk after 73710 steps, saw 72726 distinct states, run finished after 1331 ms. (steps per millisecond=55 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 309 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1)]
Support contains 4 out of 1903 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 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 170 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:22:48] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-19 02:22:50] [INFO ] Implicit Places using invariants in 1758 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1761 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 121 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-19 02:22:50] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-19 02:22:52] [INFO ] Implicit Places using invariants in 2209 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2211 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 135 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-19 02:22:52] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-19 02:22:54] [INFO ] Implicit Places using invariants in 1837 ms returned []
[2023-03-19 02:22:54] [INFO ] Invariant cache hit.
[2023-03-19 02:22:57] [INFO ] Implicit Places using invariants and state equation in 3225 ms returned []
Implicit Place search using SMT with State Equation took 5084 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 9483 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Finished probabilistic random walk after 73742 steps, run visited all 1 properties in 1263 ms. (steps per millisecond=58 )
Probabilistic random walk after 73742 steps, saw 72715 distinct states, run finished after 1267 ms. (steps per millisecond=58 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1419 ms.
Product exploration explored 100000 steps with 0 reset in 1821 ms.
Built C files in :
/tmp/ltsmin11114164830136920920
[2023-03-19 02:23:03] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2023-03-19 02:23:03] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:23:03] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2023-03-19 02:23:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:23:03] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2023-03-19 02:23:03] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:23:03] [INFO ] Built C files in 362ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11114164830136920920
Running compilation step : cd /tmp/ltsmin11114164830136920920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11114164830136920920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11114164830136920920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 66 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-19 02:23:06] [INFO ] Invariant cache hit.
[2023-03-19 02:23:08] [INFO ] Implicit Places using invariants in 1627 ms returned []
[2023-03-19 02:23:08] [INFO ] Invariant cache hit.
[2023-03-19 02:23:11] [INFO ] Implicit Places using invariants and state equation in 3146 ms returned []
Implicit Place search using SMT with State Equation took 4778 ms to find 0 implicit places.
[2023-03-19 02:23:11] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-19 02:23:11] [INFO ] Invariant cache hit.
[2023-03-19 02:23:13] [INFO ] Dead Transitions using invariants and state equation in 1742 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6639 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin14715563418678675685
[2023-03-19 02:23:13] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2023-03-19 02:23:13] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:23:13] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2023-03-19 02:23:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:23:13] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2023-03-19 02:23:13] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:23:13] [INFO ] Built C files in 296ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14715563418678675685
Running compilation step : cd /tmp/ltsmin14715563418678675685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14715563418678675685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14715563418678675685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 02:23:16] [INFO ] Flatten gal took : 103 ms
[2023-03-19 02:23:17] [INFO ] Flatten gal took : 92 ms
[2023-03-19 02:23:17] [INFO ] Time to serialize gal into /tmp/LTL10973296180339612600.gal : 9 ms
[2023-03-19 02:23:17] [INFO ] Time to serialize properties into /tmp/LTL8359585911662262390.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10973296180339612600.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11278346349275768713.hoa' '-atoms' '/tmp/LTL8359585911662262390.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8359585911662262390.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11278346349275768713.hoa
Detected timeout of ITS tools.
[2023-03-19 02:23:32] [INFO ] Flatten gal took : 93 ms
[2023-03-19 02:23:32] [INFO ] Flatten gal took : 107 ms
[2023-03-19 02:23:32] [INFO ] Time to serialize gal into /tmp/LTL8516930782359380671.gal : 19 ms
[2023-03-19 02:23:32] [INFO ] Time to serialize properties into /tmp/LTL1362187042711249633.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8516930782359380671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1362187042711249633.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(p1384==0)")&&(F(G("(((p615==0)||(p617==0))||((p521==1)&&(p532==1)))"))))))
Formula 0 simplified : X(!"(p1384==0)" | GF!"(((p615==0)||(p617==0))||((p521==1)&&(p532==1)))")
Detected timeout of ITS tools.
[2023-03-19 02:23:47] [INFO ] Flatten gal took : 96 ms
[2023-03-19 02:23:47] [INFO ] Applying decomposition
[2023-03-19 02:23:47] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11749745026842549915.txt' '-o' '/tmp/graph11749745026842549915.bin' '-w' '/tmp/graph11749745026842549915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11749745026842549915.bin' '-l' '-1' '-v' '-w' '/tmp/graph11749745026842549915.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:23:47] [INFO ] Decomposing Gal with order
[2023-03-19 02:23:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:23:48] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-19 02:23:48] [INFO ] Flatten gal took : 109 ms
[2023-03-19 02:23:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 51 ms.
[2023-03-19 02:23:48] [INFO ] Time to serialize gal into /tmp/LTL9026553235752422993.gal : 20 ms
[2023-03-19 02:23:48] [INFO ] Time to serialize properties into /tmp/LTL2384850899124895177.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9026553235752422993.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2384850899124895177.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(("(i31.i0.i1.u582.p1384==0)")&&(F(G("(((i13.u258.p615==0)||(i13.u258.p617==0))||((i11.i0.i1.u218.p521==1)&&(i11.i0.i2.u223.p532==...166
Formula 0 simplified : X(!"(i31.i0.i1.u582.p1384==0)" | GF!"(((i13.u258.p615==0)||(i13.u258.p617==0))||((i11.i0.i1.u218.p521==1)&&(i11.i0.i2.u223.p532==1))...158
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10407466355294045440
[2023-03-19 02:24:03] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10407466355294045440
Running compilation step : cd /tmp/ltsmin10407466355294045440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10407466355294045440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10407466355294045440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-100A-LTLFireability-09 finished in 92857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 45 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:24:06] [INFO ] Computed 901 place invariants in 4 ms
[2023-03-19 02:24:07] [INFO ] Implicit Places using invariants in 1347 ms returned []
[2023-03-19 02:24:07] [INFO ] Invariant cache hit.
[2023-03-19 02:24:12] [INFO ] Implicit Places using invariants and state equation in 4385 ms returned []
Implicit Place search using SMT with State Equation took 5749 ms to find 0 implicit places.
[2023-03-19 02:24:12] [INFO ] Invariant cache hit.
[2023-03-19 02:24:13] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7104 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1208 0) (EQ s1212 0) (EQ s1218 0)), p1:(OR (EQ s1316 0) (EQ s1327 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1464 ms.
Product exploration explored 100000 steps with 0 reset in 1666 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22939 steps, run visited all 1 properties in 431 ms. (steps per millisecond=53 )
Probabilistic random walk after 22939 steps, saw 22352 distinct states, run finished after 433 ms. (steps per millisecond=52 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 409 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 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 1903 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 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 164 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:24:18] [INFO ] Computed 901 place invariants in 18 ms
[2023-03-19 02:24:21] [INFO ] Implicit Places using invariants in 2858 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2860 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 98 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-19 02:24:21] [INFO ] Computed 899 place invariants in 4 ms
[2023-03-19 02:24:23] [INFO ] Implicit Places using invariants in 1939 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1941 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 132 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-19 02:24:23] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-19 02:24:26] [INFO ] Implicit Places using invariants in 2583 ms returned []
[2023-03-19 02:24:26] [INFO ] Invariant cache hit.
[2023-03-19 02:24:31] [INFO ] Implicit Places using invariants and state equation in 4733 ms returned []
Implicit Place search using SMT with State Equation took 7319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 12516 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 197 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 115 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22971 steps, run visited all 1 properties in 424 ms. (steps per millisecond=54 )
Probabilistic random walk after 22971 steps, saw 22342 distinct states, run finished after 426 ms. (steps per millisecond=53 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 199 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 108 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1361 ms.
Product exploration explored 100000 steps with 0 reset in 1735 ms.
Built C files in :
/tmp/ltsmin14910209052285008262
[2023-03-19 02:24:35] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2023-03-19 02:24:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:24:35] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2023-03-19 02:24:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:24:36] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2023-03-19 02:24:36] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:24:36] [INFO ] Built C files in 346ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14910209052285008262
Running compilation step : cd /tmp/ltsmin14910209052285008262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14910209052285008262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14910209052285008262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 103 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-19 02:24:39] [INFO ] Invariant cache hit.
[2023-03-19 02:24:41] [INFO ] Implicit Places using invariants in 2764 ms returned []
[2023-03-19 02:24:41] [INFO ] Invariant cache hit.
[2023-03-19 02:24:46] [INFO ] Implicit Places using invariants and state equation in 4132 ms returned []
Implicit Place search using SMT with State Equation took 6913 ms to find 0 implicit places.
[2023-03-19 02:24:46] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-19 02:24:46] [INFO ] Invariant cache hit.
[2023-03-19 02:24:48] [INFO ] Dead Transitions using invariants and state equation in 2399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9500 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin11808662940865509339
[2023-03-19 02:24:48] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2023-03-19 02:24:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:24:48] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2023-03-19 02:24:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:24:48] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2023-03-19 02:24:48] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:24:48] [INFO ] Built C files in 300ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11808662940865509339
Running compilation step : cd /tmp/ltsmin11808662940865509339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11808662940865509339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11808662940865509339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 02:24:52] [INFO ] Flatten gal took : 112 ms
[2023-03-19 02:24:52] [INFO ] Flatten gal took : 98 ms
[2023-03-19 02:24:52] [INFO ] Time to serialize gal into /tmp/LTL13166274315152532742.gal : 15 ms
[2023-03-19 02:24:52] [INFO ] Time to serialize properties into /tmp/LTL17885280092781319929.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13166274315152532742.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13620168449312538994.hoa' '-atoms' '/tmp/LTL17885280092781319929.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17885280092781319929.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13620168449312538994.hoa
Detected timeout of ITS tools.
[2023-03-19 02:25:07] [INFO ] Flatten gal took : 91 ms
[2023-03-19 02:25:07] [INFO ] Flatten gal took : 137 ms
[2023-03-19 02:25:07] [INFO ] Time to serialize gal into /tmp/LTL17982423476682378481.gal : 9 ms
[2023-03-19 02:25:07] [INFO ] Time to serialize properties into /tmp/LTL7853742345486905051.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17982423476682378481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7853742345486905051.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((p1316==0)||(p1327==0))")))&&("(((p1208==0)||(p1212==0))||(p1218==0))"))))
Formula 0 simplified : X(!"(((p1208==0)||(p1212==0))||(p1218==0))" | FG!"((p1316==0)||(p1327==0))")
Detected timeout of ITS tools.
[2023-03-19 02:25:22] [INFO ] Flatten gal took : 94 ms
[2023-03-19 02:25:22] [INFO ] Applying decomposition
[2023-03-19 02:25:22] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17250766091412347514.txt' '-o' '/tmp/graph17250766091412347514.bin' '-w' '/tmp/graph17250766091412347514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17250766091412347514.bin' '-l' '-1' '-v' '-w' '/tmp/graph17250766091412347514.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:25:22] [INFO ] Decomposing Gal with order
[2023-03-19 02:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:25:23] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-19 02:25:23] [INFO ] Flatten gal took : 80 ms
[2023-03-19 02:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 60 ms.
[2023-03-19 02:25:23] [INFO ] Time to serialize gal into /tmp/LTL9072145350269239473.gal : 25 ms
[2023-03-19 02:25:23] [INFO ] Time to serialize properties into /tmp/LTL10467286540857981208.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9072145350269239473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10467286540857981208.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((i30.i0.i2.u554.p1316==0)||(i30.i0.i1.u558.p1327==0))")))&&("(((i26.i2.i2.u507.p1208==0)||(i27.i0.i1.u509.p1212==0))||(i27...182
Formula 0 simplified : X(!"(((i26.i2.i2.u507.p1208==0)||(i27.i0.i1.u509.p1212==0))||(i27.i0.i2.u512.p1218==0))" | FG!"((i30.i0.i2.u554.p1316==0)||(i30.i0.i...174
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
368 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.97753,78328,1,0,116499,852,6350,267735,120,6315,172887
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLFireability-11 finished in 81455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 102 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:25:27] [INFO ] Computed 901 place invariants in 4 ms
[2023-03-19 02:25:29] [INFO ] Implicit Places using invariants in 1459 ms returned []
[2023-03-19 02:25:29] [INFO ] Invariant cache hit.
[2023-03-19 02:25:33] [INFO ] Implicit Places using invariants and state equation in 4226 ms returned []
Implicit Place search using SMT with State Equation took 5713 ms to find 0 implicit places.
[2023-03-19 02:25:33] [INFO ] Invariant cache hit.
[2023-03-19 02:25:35] [INFO ] Dead Transitions using invariants and state equation in 2184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8013 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s384 1) (NEQ s397 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4621 ms.
Product exploration explored 100000 steps with 33333 reset in 4829 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-12 finished in 17796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(G(p1)) U p2)))))'
Support contains 4 out of 1903 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 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 135 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:25:45] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-19 02:25:47] [INFO ] Implicit Places using invariants in 2193 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2196 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 88 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-19 02:25:47] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-19 02:25:50] [INFO ] Implicit Places using invariants in 2193 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2196 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 137 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-19 02:25:50] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-19 02:25:52] [INFO ] Implicit Places using invariants in 1862 ms returned []
[2023-03-19 02:25:52] [INFO ] Invariant cache hit.
[2023-03-19 02:25:53] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 3233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7985 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s182 1) (EQ s186 1) (EQ s192 1)), p0:(EQ s985 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1335 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-14 finished in 9442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(((p1 U (X(p2) U !p3))&&p0)))))'
Support contains 9 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 60 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:25:55] [INFO ] Computed 901 place invariants in 8 ms
[2023-03-19 02:25:57] [INFO ] Implicit Places using invariants in 2533 ms returned []
[2023-03-19 02:25:57] [INFO ] Invariant cache hit.
[2023-03-19 02:26:01] [INFO ] Implicit Places using invariants and state equation in 4118 ms returned []
Implicit Place search using SMT with State Equation took 6666 ms to find 0 implicit places.
[2023-03-19 02:26:01] [INFO ] Invariant cache hit.
[2023-03-19 02:26:03] [INFO ] Dead Transitions using invariants and state equation in 1771 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8507 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) p3), (OR p3 (AND (NOT p0) (NOT p2))), p3]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p3 p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p3 p0 p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p0) p2) (AND p3 p0 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p3 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p3 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s429 1) (EQ s433 1) (EQ s439 1) (EQ s687 1) (EQ s704 1)), p3:(AND (EQ s886 1) (EQ s911 1)), p1:(AND (EQ s687 1) (EQ s704 1)), p2:(AND (EQ s143...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1444 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-15 finished in 10261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
[2023-03-19 02:26:05] [INFO ] Flatten gal took : 133 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12457479631022592615
[2023-03-19 02:26:05] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2023-03-19 02:26:05] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:26:05] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2023-03-19 02:26:05] [INFO ] Applying decomposition
[2023-03-19 02:26:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:26:05] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13730740243878811589.txt' '-o' '/tmp/graph13730740243878811589.bin' '-w' '/tmp/graph13730740243878811589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13730740243878811589.bin' '-l' '-1' '-v' '-w' '/tmp/graph13730740243878811589.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:26:05] [INFO ] Decomposing Gal with order
[2023-03-19 02:26:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:26:06] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2023-03-19 02:26:06] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:26:06] [INFO ] Built C files in 436ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12457479631022592615
Running compilation step : cd /tmp/ltsmin12457479631022592615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 02:26:06] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 02:26:06] [INFO ] Flatten gal took : 122 ms
[2023-03-19 02:26:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 66 ms.
[2023-03-19 02:26:06] [INFO ] Time to serialize gal into /tmp/LTLFireability5383257876859952972.gal : 25 ms
[2023-03-19 02:26:06] [INFO ] Time to serialize properties into /tmp/LTLFireability11939053150323847004.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5383257876859952972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11939053150323847004.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("(i32.i0.i1.u582.p1384==0)")&&(F(G("(((i12.i0.i2.u258.p615!=1)||(i12.i0.i2.u258.p617!=1))||((i10.u218.p521==1)&&(i10.u223.p532==...166
Formula 0 simplified : X(!"(i32.i0.i1.u582.p1384==0)" | GF!"(((i12.i0.i2.u258.p615!=1)||(i12.i0.i2.u258.p617!=1))||((i10.u218.p521==1)&&(i10.u223.p532==1))...158
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 6810 ms.
Running link step : cd /tmp/ltsmin12457479631022592615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin12457479631022592615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.436: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.436: LTL layer: formula: X(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))
pins2lts-mc-linux64( 7/ 8), 0.436: "X(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.436: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.459: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.567: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.585: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.671: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.706: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.743: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.790: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.288: There are 1405 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.288: State length is 1904, there are 1410 groups
pins2lts-mc-linux64( 0/ 8), 2.288: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.288: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.288: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.288: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 2.591: [Blue] ~117 levels ~960 states ~4056 transitions
pins2lts-mc-linux64( 4/ 8), 2.943: [Blue] ~236 levels ~1920 states ~9136 transitions
pins2lts-mc-linux64( 4/ 8), 3.362: [Blue] ~463 levels ~3840 states ~18816 transitions
pins2lts-mc-linux64( 7/ 8), 4.933: [Blue] ~953 levels ~7680 states ~39880 transitions
pins2lts-mc-linux64( 4/ 8), 6.923: [Blue] ~1884 levels ~15360 states ~83696 transitions
pins2lts-mc-linux64( 4/ 8), 8.799: [Blue] ~3788 levels ~30720 states ~173048 transitions
pins2lts-mc-linux64( 0/ 8), 11.773: [Blue] ~7619 levels ~61440 states ~415320 transitions
pins2lts-mc-linux64( 7/ 8), 17.310: [Blue] ~15263 levels ~122880 states ~746072 transitions
pins2lts-mc-linux64( 7/ 8), 27.823: [Blue] ~30546 levels ~245760 states ~1540640 transitions
pins2lts-mc-linux64( 7/ 8), 48.622: [Blue] ~61106 levels ~491520 states ~3192840 transitions
pins2lts-mc-linux64( 7/ 8), 90.032: [Blue] ~122261 levels ~983040 states ~6660472 transitions
pins2lts-mc-linux64( 7/ 8), 173.741: [Blue] ~244667 levels ~1966080 states ~13917040 transitions
pins2lts-mc-linux64( 3/ 8), 210.277: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 210.589:
pins2lts-mc-linux64( 0/ 8), 210.589: Explored 2330334 states 19085659 transitions, fanout: 8.190
pins2lts-mc-linux64( 0/ 8), 210.589: Total exploration time 208.280 sec (207.990 sec minimum, 208.115 sec on average)
pins2lts-mc-linux64( 0/ 8), 210.589: States per second: 11188, Transitions per second: 91635
pins2lts-mc-linux64( 0/ 8), 210.589:
pins2lts-mc-linux64( 0/ 8), 210.589: State space has 10408441 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 210.589: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 210.589: blue states: 2330334 (22.39%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 210.589: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 210.589: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 210.589:
pins2lts-mc-linux64( 0/ 8), 210.589: Total memory used for local state coloring: 35.5MB
pins2lts-mc-linux64( 0/ 8), 210.589:
pins2lts-mc-linux64( 0/ 8), 210.589: Queue width: 8B, total height: 2324712, memory: 17.74MB
pins2lts-mc-linux64( 0/ 8), 210.589: Tree memory: 335.4MB, 33.8 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 210.589: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 210.589: Stored 1586 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 210.589: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 210.589: Est. total memory use: 353.1MB (~1041.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12457479631022592615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12457479631022592615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 02:50:31] [INFO ] Applying decomposition
[2023-03-19 02:50:33] [INFO ] Flatten gal took : 1908 ms
[2023-03-19 02:50:33] [INFO ] Decomposing Gal with order
[2023-03-19 02:50:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:50:34] [INFO ] Removed a total of 400 redundant transitions.
[2023-03-19 02:50:34] [INFO ] Flatten gal took : 471 ms
[2023-03-19 02:50:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 311 ms.
[2023-03-19 02:50:35] [INFO ] Time to serialize gal into /tmp/LTLFireability5307974636342736979.gal : 83 ms
[2023-03-19 02:50:35] [INFO ] Time to serialize properties into /tmp/LTLFireability4605321262233948188.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5307974636342736979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4605321262233948188.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(u729.p1384==0)")&&(F(G("(((i258.u324.p615!=1)||(i258.u325.p617!=1))||((i218.u275.p521==1)&&(u280.p532==1)))"))))))
Formula 0 simplified : X(!"(u729.p1384==0)" | GF!"(((i258.u324.p615!=1)||(i258.u325.p617!=1))||((i218.u275.p521==1)&&(u280.p532==1)))")
ITS-tools command line returned an error code 137
[2023-03-19 02:59:26] [INFO ] Flatten gal took : 975 ms
[2023-03-19 02:59:30] [INFO ] Input system was already deterministic with 1402 transitions.
[2023-03-19 02:59:31] [INFO ] Transformed 1903 places.
[2023-03-19 02:59:31] [INFO ] Transformed 1402 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 02:59:32] [INFO ] Time to serialize gal into /tmp/LTLFireability3672459159786608545.gal : 72 ms
[2023-03-19 02:59:32] [INFO ] Time to serialize properties into /tmp/LTLFireability6645889637351843121.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3672459159786608545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6645889637351843121.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("(p1384==0)")&&(F(G("(((p615!=1)||(p617!=1))||((p521==1)&&(p532==1)))"))))))
Formula 0 simplified : X(!"(p1384==0)" | GF!"(((p615!=1)||(p617!=1))||((p521==1)&&(p532==1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10596004 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15841180 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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