fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r389-oct2-167903713600508
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ShieldPPPs-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16205.647 3600000.00 13344574.00 12155.50 FF?FF?FFFTFFFTTT normal

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-167903713600508.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 ShieldPPPs-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713600508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 888K 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 ShieldPPPs-PT-050B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679209512051

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=ShieldPPPs-PT-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 07:05:14] [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 07:05:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 07:05:14] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-03-19 07:05:14] [INFO ] Transformed 3403 places.
[2023-03-19 07:05:14] [INFO ] Transformed 3153 transitions.
[2023-03-19 07:05:14] [INFO ] Found NUPN structural information;
[2023-03-19 07:05:14] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 60 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 342 places :
Symmetric choice reduction at 0 with 342 rule applications. Total rules 342 place count 3061 transition count 2811
Iterating global reduction 0 with 342 rules applied. Total rules applied 684 place count 3061 transition count 2811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 685 place count 3060 transition count 2810
Iterating global reduction 0 with 1 rules applied. Total rules applied 686 place count 3060 transition count 2810
Applied a total of 686 rules in 1190 ms. Remains 3060 /3403 variables (removed 343) and now considering 2810/3153 (removed 343) transitions.
// Phase 1: matrix 2810 rows 3060 cols
[2023-03-19 07:05:16] [INFO ] Computed 551 place invariants in 64 ms
[2023-03-19 07:05:18] [INFO ] Implicit Places using invariants in 1890 ms returned []
[2023-03-19 07:05:18] [INFO ] Invariant cache hit.
[2023-03-19 07:05:23] [INFO ] Implicit Places using invariants and state equation in 5416 ms returned []
Implicit Place search using SMT with State Equation took 7366 ms to find 0 implicit places.
[2023-03-19 07:05:23] [INFO ] Invariant cache hit.
[2023-03-19 07:05:25] [INFO ] Dead Transitions using invariants and state equation in 2272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3060/3403 places, 2810/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10847 ms. Remains : 3060/3403 places, 2810/3153 transitions.
Support contains 60 out of 3060 places after structural reductions.
[2023-03-19 07:05:26] [INFO ] Flatten gal took : 200 ms
[2023-03-19 07:05:26] [INFO ] Flatten gal took : 120 ms
[2023-03-19 07:05:26] [INFO ] Input system was already deterministic with 2810 transitions.
Support contains 57 out of 3060 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 37) seen :22
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-19 07:05:27] [INFO ] Invariant cache hit.
[2023-03-19 07:05:29] [INFO ] [Real]Absence check using 551 positive place invariants in 321 ms returned sat
[2023-03-19 07:05:29] [INFO ] After 2054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-19 07:05:31] [INFO ] [Nat]Absence check using 551 positive place invariants in 322 ms returned sat
[2023-03-19 07:05:37] [INFO ] After 4257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-19 07:05:38] [INFO ] Deduced a trap composed of 18 places in 960 ms of which 7 ms to minimize.
[2023-03-19 07:05:39] [INFO ] Deduced a trap composed of 16 places in 1015 ms of which 34 ms to minimize.
[2023-03-19 07:05:40] [INFO ] Deduced a trap composed of 19 places in 883 ms of which 3 ms to minimize.
[2023-03-19 07:05:41] [INFO ] Deduced a trap composed of 20 places in 1047 ms of which 5 ms to minimize.
[2023-03-19 07:05:42] [INFO ] Deduced a trap composed of 28 places in 1237 ms of which 4 ms to minimize.
[2023-03-19 07:05:43] [INFO ] Deduced a trap composed of 23 places in 928 ms of which 2 ms to minimize.
[2023-03-19 07:05:44] [INFO ] Deduced a trap composed of 21 places in 850 ms of which 2 ms to minimize.
[2023-03-19 07:05:46] [INFO ] Deduced a trap composed of 25 places in 1238 ms of which 2 ms to minimize.
[2023-03-19 07:05:47] [INFO ] Deduced a trap composed of 29 places in 954 ms of which 2 ms to minimize.
[2023-03-19 07:05:48] [INFO ] Deduced a trap composed of 17 places in 805 ms of which 11 ms to minimize.
[2023-03-19 07:05:49] [INFO ] Deduced a trap composed of 31 places in 812 ms of which 2 ms to minimize.
[2023-03-19 07:05:50] [INFO ] Deduced a trap composed of 20 places in 803 ms of which 1 ms to minimize.
[2023-03-19 07:05:51] [INFO ] Deduced a trap composed of 27 places in 755 ms of which 2 ms to minimize.
[2023-03-19 07:05:51] [INFO ] Deduced a trap composed of 30 places in 655 ms of which 1 ms to minimize.
[2023-03-19 07:05:52] [INFO ] Deduced a trap composed of 31 places in 734 ms of which 2 ms to minimize.
[2023-03-19 07:05:53] [INFO ] Deduced a trap composed of 33 places in 626 ms of which 2 ms to minimize.
[2023-03-19 07:05:54] [INFO ] Deduced a trap composed of 34 places in 665 ms of which 2 ms to minimize.
[2023-03-19 07:05:55] [INFO ] Deduced a trap composed of 24 places in 1055 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:05:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:05:55] [INFO ] After 25903ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 2144 ms.
Support contains 27 out of 3060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Drop transitions removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 3060 transition count 2465
Reduce places removed 345 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 346 rules applied. Total rules applied 691 place count 2715 transition count 2464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 692 place count 2714 transition count 2464
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 252 Pre rules applied. Total rules applied 692 place count 2714 transition count 2212
Deduced a syphon composed of 252 places in 8 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1196 place count 2462 transition count 2212
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1201 place count 2457 transition count 2207
Iterating global reduction 3 with 5 rules applied. Total rules applied 1206 place count 2457 transition count 2207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1206 place count 2457 transition count 2204
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1212 place count 2454 transition count 2204
Performed 885 Post agglomeration using F-continuation condition.Transition count delta: 885
Deduced a syphon composed of 885 places in 3 ms
Reduce places removed 885 places and 0 transitions.
Iterating global reduction 3 with 1770 rules applied. Total rules applied 2982 place count 1569 transition count 1319
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 434 times.
Drop transitions removed 434 transitions
Iterating global reduction 3 with 434 rules applied. Total rules applied 3416 place count 1569 transition count 1319
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3417 place count 1568 transition count 1318
Applied a total of 3417 rules in 1279 ms. Remains 1568 /3060 variables (removed 1492) and now considering 1318/2810 (removed 1492) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1280 ms. Remains : 1568/3060 places, 1318/2810 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1318 rows 1568 cols
[2023-03-19 07:05:59] [INFO ] Computed 551 place invariants in 38 ms
[2023-03-19 07:06:00] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 07:06:00] [INFO ] [Nat]Absence check using 526 positive place invariants in 118 ms returned sat
[2023-03-19 07:06:00] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-19 07:06:02] [INFO ] After 1577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 07:06:02] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2023-03-19 07:06:02] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
[2023-03-19 07:06:03] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 1 ms to minimize.
[2023-03-19 07:06:03] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 0 ms to minimize.
[2023-03-19 07:06:04] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-19 07:06:04] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-19 07:06:04] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 0 ms to minimize.
[2023-03-19 07:06:05] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2023-03-19 07:06:05] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-19 07:06:05] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-19 07:06:05] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 0 ms to minimize.
[2023-03-19 07:06:06] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2023-03-19 07:06:06] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-19 07:06:06] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-19 07:06:06] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2023-03-19 07:06:06] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 13 ms to minimize.
[2023-03-19 07:06:07] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-19 07:06:07] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2023-03-19 07:06:07] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2023-03-19 07:06:07] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-19 07:06:07] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2023-03-19 07:06:08] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 10 ms to minimize.
[2023-03-19 07:06:08] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-19 07:06:08] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2023-03-19 07:06:08] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 15 ms to minimize.
[2023-03-19 07:06:08] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2023-03-19 07:06:09] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-19 07:06:09] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2023-03-19 07:06:09] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-19 07:06:09] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-19 07:06:09] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2023-03-19 07:06:10] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 7694 ms
[2023-03-19 07:06:10] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2023-03-19 07:06:10] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2023-03-19 07:06:10] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2023-03-19 07:06:10] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2023-03-19 07:06:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 976 ms
[2023-03-19 07:06:11] [INFO ] After 10857ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 346 ms.
[2023-03-19 07:06:11] [INFO ] After 11844ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 226 ms.
Support contains 7 out of 1568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1568/1568 places, 1318/1318 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1568 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1567 transition count 1317
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1567 transition count 1316
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1566 transition count 1316
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 22 place count 1557 transition count 1307
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 1557 transition count 1307
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 1555 transition count 1305
Applied a total of 30 rules in 190 ms. Remains 1555 /1568 variables (removed 13) and now considering 1305/1318 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 1555/1568 places, 1305/1318 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1305 rows 1555 cols
[2023-03-19 07:06:12] [INFO ] Computed 551 place invariants in 36 ms
[2023-03-19 07:06:13] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 07:06:13] [INFO ] [Nat]Absence check using 522 positive place invariants in 125 ms returned sat
[2023-03-19 07:06:13] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-19 07:06:14] [INFO ] After 854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 07:06:14] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-19 07:06:15] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2023-03-19 07:06:15] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 13 ms to minimize.
[2023-03-19 07:06:15] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2023-03-19 07:06:15] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2023-03-19 07:06:15] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2023-03-19 07:06:16] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-19 07:06:16] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-19 07:06:16] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2023-03-19 07:06:16] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-19 07:06:17] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-19 07:06:17] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 2 ms to minimize.
[2023-03-19 07:06:17] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2023-03-19 07:06:17] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 13 ms to minimize.
[2023-03-19 07:06:17] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2023-03-19 07:06:18] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-19 07:06:18] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2023-03-19 07:06:18] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-19 07:06:18] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2023-03-19 07:06:18] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2023-03-19 07:06:18] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2023-03-19 07:06:19] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-19 07:06:19] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2023-03-19 07:06:19] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2023-03-19 07:06:19] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-19 07:06:19] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-19 07:06:20] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2023-03-19 07:06:20] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-19 07:06:20] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2023-03-19 07:06:20] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-19 07:06:21] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2023-03-19 07:06:21] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6682 ms
[2023-03-19 07:06:21] [INFO ] After 7747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-19 07:06:21] [INFO ] After 8372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 98 ms.
Support contains 4 out of 1555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1555/1555 places, 1305/1305 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1555 transition count 1304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1554 transition count 1304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1554 transition count 1303
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1553 transition count 1303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1552 transition count 1302
Applied a total of 6 rules in 110 ms. Remains 1552 /1555 variables (removed 3) and now considering 1302/1305 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 1552/1555 places, 1302/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 118185 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118185 steps, saw 110660 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-19 07:06:25] [INFO ] Computed 551 place invariants in 21 ms
[2023-03-19 07:06:25] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 07:06:25] [INFO ] [Nat]Absence check using 526 positive place invariants in 140 ms returned sat
[2023-03-19 07:06:25] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-19 07:06:26] [INFO ] After 1005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 07:06:27] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2023-03-19 07:06:27] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2023-03-19 07:06:27] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 4 ms to minimize.
[2023-03-19 07:06:27] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2023-03-19 07:06:28] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2023-03-19 07:06:28] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2023-03-19 07:06:28] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2023-03-19 07:06:29] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2023-03-19 07:06:29] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 1 ms to minimize.
[2023-03-19 07:06:29] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-19 07:06:29] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-19 07:06:30] [INFO ] Deduced a trap composed of 6 places in 427 ms of which 0 ms to minimize.
[2023-03-19 07:06:30] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2023-03-19 07:06:30] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2023-03-19 07:06:31] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2023-03-19 07:06:31] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-19 07:06:31] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-19 07:06:31] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-19 07:06:31] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-19 07:06:32] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-19 07:06:32] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 0 ms to minimize.
[2023-03-19 07:06:32] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-19 07:06:32] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-19 07:06:33] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-19 07:06:33] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6261 ms
[2023-03-19 07:06:33] [INFO ] After 7499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-19 07:06:33] [INFO ] After 8153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 75 ms.
Support contains 4 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 61 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 62 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-19 07:06:33] [INFO ] Invariant cache hit.
[2023-03-19 07:06:34] [INFO ] Implicit Places using invariants in 1128 ms returned []
[2023-03-19 07:06:34] [INFO ] Invariant cache hit.
[2023-03-19 07:06:37] [INFO ] Implicit Places using invariants and state equation in 2637 ms returned []
Implicit Place search using SMT with State Equation took 3797 ms to find 0 implicit places.
[2023-03-19 07:06:37] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-19 07:06:37] [INFO ] Invariant cache hit.
[2023-03-19 07:06:38] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4716 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 61 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 07:06:38] [INFO ] Invariant cache hit.
[2023-03-19 07:06:38] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 07:06:39] [INFO ] [Nat]Absence check using 526 positive place invariants in 121 ms returned sat
[2023-03-19 07:06:39] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-19 07:06:39] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 07:06:40] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2023-03-19 07:06:40] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2023-03-19 07:06:40] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 1 ms to minimize.
[2023-03-19 07:06:40] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2023-03-19 07:06:41] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 2 ms to minimize.
[2023-03-19 07:06:41] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-03-19 07:06:41] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-19 07:06:41] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 1 ms to minimize.
[2023-03-19 07:06:42] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 0 ms to minimize.
[2023-03-19 07:06:42] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-19 07:06:42] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2023-03-19 07:06:43] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 13 ms to minimize.
[2023-03-19 07:06:43] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2023-03-19 07:06:43] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2023-03-19 07:06:43] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 1 ms to minimize.
[2023-03-19 07:06:44] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-19 07:06:44] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-19 07:06:44] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-19 07:06:44] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2023-03-19 07:06:45] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2023-03-19 07:06:45] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-19 07:06:45] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2023-03-19 07:06:45] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2023-03-19 07:06:46] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-19 07:06:46] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-19 07:06:46] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2023-03-19 07:06:46] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-19 07:06:47] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2023-03-19 07:06:47] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7409 ms
[2023-03-19 07:06:47] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-19 07:06:47] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-19 07:06:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2023-03-19 07:06:47] [INFO ] After 8812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-19 07:06:48] [INFO ] After 9393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA ShieldPPPs-PT-050B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 604 stabilizing places and 604 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||(p1 U G(p2))))))'
Support contains 3 out of 3060 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 531 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-19 07:06:49] [INFO ] Computed 551 place invariants in 17 ms
[2023-03-19 07:06:50] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2023-03-19 07:06:50] [INFO ] Invariant cache hit.
[2023-03-19 07:06:53] [INFO ] Implicit Places using invariants and state equation in 3444 ms returned []
Implicit Place search using SMT with State Equation took 4480 ms to find 0 implicit places.
[2023-03-19 07:06:53] [INFO ] Invariant cache hit.
[2023-03-19 07:06:56] [INFO ] Dead Transitions using invariants and state equation in 2685 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3060 places, 2803/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7706 ms. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2081 1), p2:(AND (EQ s1941 1) (EQ s1971 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 10802 steps with 1 reset in 193 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-00 finished in 8342 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(p0)||(p1&&X(p1))))&&X(G(p2))))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3054 transition count 2804
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3054 transition count 2804
Applied a total of 12 rules in 431 ms. Remains 3054 /3060 variables (removed 6) and now considering 2804/2810 (removed 6) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2023-03-19 07:06:57] [INFO ] Computed 551 place invariants in 35 ms
[2023-03-19 07:06:59] [INFO ] Implicit Places using invariants in 1669 ms returned []
[2023-03-19 07:06:59] [INFO ] Invariant cache hit.
[2023-03-19 07:07:03] [INFO ] Implicit Places using invariants and state equation in 4046 ms returned []
Implicit Place search using SMT with State Equation took 5717 ms to find 0 implicit places.
[2023-03-19 07:07:03] [INFO ] Invariant cache hit.
[2023-03-19 07:07:05] [INFO ] Dead Transitions using invariants and state equation in 2346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3060 places, 2804/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8496 ms. Remains : 3054/3060 places, 2804/2810 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(OR (EQ s364 0) (EQ s394 0)), p0:(EQ s813 1), p1:(EQ s1058 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6307 steps with 0 reset in 91 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-01 finished in 8920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3059 transition count 2458
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2708 transition count 2458
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2708 transition count 2208
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2458 transition count 2208
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1210 place count 2450 transition count 2200
Iterating global reduction 2 with 8 rules applied. Total rules applied 1218 place count 2450 transition count 2200
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1218 place count 2450 transition count 2196
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1226 place count 2446 transition count 2196
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 3010 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3012 place count 1552 transition count 1302
Applied a total of 3012 rules in 856 ms. Remains 1552 /3060 variables (removed 1508) and now considering 1302/2810 (removed 1508) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-19 07:07:06] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-19 07:07:07] [INFO ] Implicit Places using invariants in 859 ms returned []
[2023-03-19 07:07:07] [INFO ] Invariant cache hit.
[2023-03-19 07:07:09] [INFO ] Implicit Places using invariants and state equation in 2129 ms returned []
Implicit Place search using SMT with State Equation took 2990 ms to find 0 implicit places.
[2023-03-19 07:07:09] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-19 07:07:09] [INFO ] Invariant cache hit.
[2023-03-19 07:07:10] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3060 places, 1302/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4804 ms. Remains : 1552/3060 places, 1302/2810 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1344 0) (EQ s1357 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 164 reset in 1047 ms.
Product exploration explored 100000 steps with 169 reset in 1211 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 183 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 p0), (NOT p0)]
Finished random walk after 362 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 224 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 139 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 104 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-19 07:07:14] [INFO ] Invariant cache hit.
[2023-03-19 07:07:15] [INFO ] Implicit Places using invariants in 913 ms returned []
[2023-03-19 07:07:15] [INFO ] Invariant cache hit.
[2023-03-19 07:07:17] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2982 ms to find 0 implicit places.
[2023-03-19 07:07:17] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 07:07:17] [INFO ] Invariant cache hit.
[2023-03-19 07:07:18] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4022 ms. Remains : 1552/1552 places, 1302/1302 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 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 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3469 steps, including 1 resets, run visited all 1 properties in 54 ms. (steps per millisecond=64 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 259 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 149 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 170 reset in 948 ms.
Product exploration explored 100000 steps with 180 reset in 1154 ms.
Built C files in :
/tmp/ltsmin13860597926836364277
[2023-03-19 07:07:21] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2023-03-19 07:07:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:07:21] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2023-03-19 07:07:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:07:21] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2023-03-19 07:07:21] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:07:21] [INFO ] Built C files in 313ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13860597926836364277
Running compilation step : cd /tmp/ltsmin13860597926836364277;'/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/ltsmin13860597926836364277;'/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/ltsmin13860597926836364277;'/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 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 96 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-19 07:07:24] [INFO ] Invariant cache hit.
[2023-03-19 07:07:25] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-19 07:07:25] [INFO ] Invariant cache hit.
[2023-03-19 07:07:28] [INFO ] Implicit Places using invariants and state equation in 2416 ms returned []
Implicit Place search using SMT with State Equation took 3184 ms to find 0 implicit places.
[2023-03-19 07:07:28] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-19 07:07:28] [INFO ] Invariant cache hit.
[2023-03-19 07:07:28] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4216 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Built C files in :
/tmp/ltsmin3932559045474074201
[2023-03-19 07:07:28] [INFO ] Computing symmetric may disable matrix : 1302 transitions.
[2023-03-19 07:07:28] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:07:28] [INFO ] Computing symmetric may enable matrix : 1302 transitions.
[2023-03-19 07:07:29] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:07:29] [INFO ] Computing Do-Not-Accords matrix : 1302 transitions.
[2023-03-19 07:07:29] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:07:29] [INFO ] Built C files in 295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3932559045474074201
Running compilation step : cd /tmp/ltsmin3932559045474074201;'/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/ltsmin3932559045474074201;'/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/ltsmin3932559045474074201;'/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 07:07:32] [INFO ] Flatten gal took : 53 ms
[2023-03-19 07:07:32] [INFO ] Flatten gal took : 53 ms
[2023-03-19 07:07:32] [INFO ] Time to serialize gal into /tmp/LTL11327861475009380772.gal : 12 ms
[2023-03-19 07:07:32] [INFO ] Time to serialize properties into /tmp/LTL1703356415433990067.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/LTL11327861475009380772.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7524056121046397371.hoa' '-atoms' '/tmp/LTL1703356415433990067.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/LTL1703356415433990067.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7524056121046397371.hoa
Detected timeout of ITS tools.
[2023-03-19 07:07:47] [INFO ] Flatten gal took : 47 ms
[2023-03-19 07:07:47] [INFO ] Flatten gal took : 45 ms
[2023-03-19 07:07:47] [INFO ] Time to serialize gal into /tmp/LTL14496832581526857834.gal : 9 ms
[2023-03-19 07:07:47] [INFO ] Time to serialize properties into /tmp/LTL16055962253507545838.ltl : 8 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/LTL14496832581526857834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16055962253507545838.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2955==0)||(p2973==0))"))))
Formula 0 simplified : FG!"((p2955==0)||(p2973==0))"
Detected timeout of ITS tools.
[2023-03-19 07:08:02] [INFO ] Flatten gal took : 43 ms
[2023-03-19 07:08:02] [INFO ] Applying decomposition
[2023-03-19 07:08:03] [INFO ] Flatten gal took : 41 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/graph16622315135341707092.txt' '-o' '/tmp/graph16622315135341707092.bin' '-w' '/tmp/graph16622315135341707092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16622315135341707092.bin' '-l' '-1' '-v' '-w' '/tmp/graph16622315135341707092.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:08:03] [INFO ] Decomposing Gal with order
[2023-03-19 07:08:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:08:03] [INFO ] Removed a total of 302 redundant transitions.
[2023-03-19 07:08:03] [INFO ] Flatten gal took : 127 ms
[2023-03-19 07:08:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 17 ms.
[2023-03-19 07:08:03] [INFO ] Time to serialize gal into /tmp/LTL8913461819700950321.gal : 16 ms
[2023-03-19 07:08:03] [INFO ] Time to serialize properties into /tmp/LTL10000754492448396227.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/LTL8913461819700950321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10000754492448396227.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 : !((G(F("((i43.u478.p2955==0)||(i43.u483.p2973==0))"))))
Formula 0 simplified : FG!"((i43.u478.p2955==0)||(i43.u483.p2973==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9158110082283699342
[2023-03-19 07:08:18] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9158110082283699342
Running compilation step : cd /tmp/ltsmin9158110082283699342;'/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 2436 ms.
Running link step : cd /tmp/ltsmin9158110082283699342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin9158110082283699342;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-02 finished in 87858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U ((p1 U p2)||G(p3)))))))'
Support contains 5 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 455 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-19 07:08:34] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-19 07:08:35] [INFO ] Implicit Places using invariants in 1591 ms returned []
[2023-03-19 07:08:35] [INFO ] Invariant cache hit.
[2023-03-19 07:08:40] [INFO ] Implicit Places using invariants and state equation in 4197 ms returned []
Implicit Place search using SMT with State Equation took 5791 ms to find 0 implicit places.
[2023-03-19 07:08:40] [INFO ] Invariant cache hit.
[2023-03-19 07:08:42] [INFO ] Dead Transitions using invariants and state equation in 2390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8643 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(NEQ s350 1), p1:(EQ s2750 1), p0:(AND (EQ s2948 1) (EQ s2950 1)), p3:(NEQ s1303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14735 steps with 1 reset in 214 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-03 finished in 9424 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(G((X(p0)||(p0 U p1)))))'
Support contains 3 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3054 transition count 2804
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3054 transition count 2804
Applied a total of 12 rules in 432 ms. Remains 3054 /3060 variables (removed 6) and now considering 2804/2810 (removed 6) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2023-03-19 07:08:43] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-19 07:08:45] [INFO ] Implicit Places using invariants in 2018 ms returned []
[2023-03-19 07:08:45] [INFO ] Invariant cache hit.
[2023-03-19 07:08:50] [INFO ] Implicit Places using invariants and state equation in 4354 ms returned []
Implicit Place search using SMT with State Equation took 6381 ms to find 0 implicit places.
[2023-03-19 07:08:50] [INFO ] Invariant cache hit.
[2023-03-19 07:08:52] [INFO ] Dead Transitions using invariants and state equation in 2675 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3060 places, 2804/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9511 ms. Remains : 3054/3060 places, 2804/2810 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s2514 1), p1:(OR (EQ s2012 1) (EQ s2324 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-04 finished in 9775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3059 transition count 2457
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2707 transition count 2457
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2707 transition count 2207
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2457 transition count 2207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1212 place count 2449 transition count 2199
Iterating global reduction 2 with 8 rules applied. Total rules applied 1220 place count 2449 transition count 2199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1220 place count 2449 transition count 2195
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1228 place count 2445 transition count 2195
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 3012 place count 1553 transition count 1303
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3014 place count 1551 transition count 1301
Applied a total of 3014 rules in 764 ms. Remains 1551 /3060 variables (removed 1509) and now considering 1301/2810 (removed 1509) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-19 07:08:53] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-19 07:08:54] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-19 07:08:54] [INFO ] Invariant cache hit.
[2023-03-19 07:08:56] [INFO ] Implicit Places using invariants and state equation in 2198 ms returned []
Implicit Place search using SMT with State Equation took 2942 ms to find 0 implicit places.
[2023-03-19 07:08:56] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 07:08:56] [INFO ] Invariant cache hit.
[2023-03-19 07:08:57] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/3060 places, 1301/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4703 ms. Remains : 1551/3060 places, 1301/2810 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s192 0) (EQ s209 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 31 reset in 1042 ms.
Product exploration explored 100000 steps with 31 reset in 1182 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 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 109 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6528 steps, including 1 resets, run visited all 1 properties in 107 ms. (steps per millisecond=61 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 176 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 112 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 07:09:00] [INFO ] Invariant cache hit.
[2023-03-19 07:09:01] [INFO ] Implicit Places using invariants in 886 ms returned []
[2023-03-19 07:09:01] [INFO ] Invariant cache hit.
[2023-03-19 07:09:03] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 3008 ms to find 0 implicit places.
[2023-03-19 07:09:04] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-19 07:09:04] [INFO ] Invariant cache hit.
[2023-03-19 07:09:04] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3942 ms. Remains : 1551/1551 places, 1301/1301 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 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 137 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6064 steps, including 1 resets, run visited all 1 properties in 94 ms. (steps per millisecond=64 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 217 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 131 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 31 reset in 953 ms.
Product exploration explored 100000 steps with 31 reset in 1133 ms.
Built C files in :
/tmp/ltsmin3877379054878560713
[2023-03-19 07:09:07] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2023-03-19 07:09:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:09:07] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2023-03-19 07:09:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:09:08] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2023-03-19 07:09:08] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:09:08] [INFO ] Built C files in 313ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3877379054878560713
Running compilation step : cd /tmp/ltsmin3877379054878560713;'/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/ltsmin3877379054878560713;'/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/ltsmin3877379054878560713;'/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 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 96 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 07:09:11] [INFO ] Invariant cache hit.
[2023-03-19 07:09:12] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-19 07:09:12] [INFO ] Invariant cache hit.
[2023-03-19 07:09:14] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 3191 ms to find 0 implicit places.
[2023-03-19 07:09:14] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-19 07:09:14] [INFO ] Invariant cache hit.
[2023-03-19 07:09:15] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4137 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin10287433083467209905
[2023-03-19 07:09:16] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2023-03-19 07:09:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:09:16] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2023-03-19 07:09:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:09:16] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2023-03-19 07:09:16] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:09:16] [INFO ] Built C files in 295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10287433083467209905
Running compilation step : cd /tmp/ltsmin10287433083467209905;'/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/ltsmin10287433083467209905;'/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/ltsmin10287433083467209905;'/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 07:09:20] [INFO ] Flatten gal took : 46 ms
[2023-03-19 07:09:20] [INFO ] Flatten gal took : 45 ms
[2023-03-19 07:09:20] [INFO ] Time to serialize gal into /tmp/LTL8913891331649381929.gal : 10 ms
[2023-03-19 07:09:20] [INFO ] Time to serialize properties into /tmp/LTL3723264704285181967.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/LTL8913891331649381929.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13688395357951051495.hoa' '-atoms' '/tmp/LTL3723264704285181967.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/LTL3723264704285181967.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13688395357951051495.hoa
Detected timeout of ITS tools.
[2023-03-19 07:09:35] [INFO ] Flatten gal took : 58 ms
[2023-03-19 07:09:35] [INFO ] Flatten gal took : 41 ms
[2023-03-19 07:09:35] [INFO ] Time to serialize gal into /tmp/LTL1803017620460311650.gal : 7 ms
[2023-03-19 07:09:35] [INFO ] Time to serialize properties into /tmp/LTL14103772528292182187.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/LTL1803017620460311650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14103772528292182187.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 : !((G(F("((p469==0)||(p493==0))"))))
Formula 0 simplified : FG!"((p469==0)||(p493==0))"
Detected timeout of ITS tools.
[2023-03-19 07:09:50] [INFO ] Flatten gal took : 50 ms
[2023-03-19 07:09:50] [INFO ] Applying decomposition
[2023-03-19 07:09:50] [INFO ] Flatten gal took : 44 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/graph516195501952762975.txt' '-o' '/tmp/graph516195501952762975.bin' '-w' '/tmp/graph516195501952762975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph516195501952762975.bin' '-l' '-1' '-v' '-w' '/tmp/graph516195501952762975.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:09:50] [INFO ] Decomposing Gal with order
[2023-03-19 07:09:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:09:50] [INFO ] Removed a total of 301 redundant transitions.
[2023-03-19 07:09:50] [INFO ] Flatten gal took : 79 ms
[2023-03-19 07:09:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 11 ms.
[2023-03-19 07:09:50] [INFO ] Time to serialize gal into /tmp/LTL2232929908265552791.gal : 14 ms
[2023-03-19 07:09:50] [INFO ] Time to serialize properties into /tmp/LTL5706546971872374892.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/LTL2232929908265552791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5706546971872374892.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i6.u68.p469==0)||(i6.u75.p493==0))"))))
Formula 0 simplified : FG!"((i6.u68.p469==0)||(i6.u75.p493==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8926020802731852029
[2023-03-19 07:10:06] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8926020802731852029
Running compilation step : cd /tmp/ltsmin8926020802731852029;'/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 2572 ms.
Running link step : cd /tmp/ltsmin8926020802731852029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8926020802731852029;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-05 finished in 88101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3059 transition count 2459
Reduce places removed 350 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 351 rules applied. Total rules applied 701 place count 2709 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 702 place count 2708 transition count 2458
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 702 place count 2708 transition count 2208
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1202 place count 2458 transition count 2208
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1210 place count 2450 transition count 2200
Iterating global reduction 3 with 8 rules applied. Total rules applied 1218 place count 2450 transition count 2200
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1218 place count 2450 transition count 2196
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1226 place count 2446 transition count 2196
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 1 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 3 with 1784 rules applied. Total rules applied 3010 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3012 place count 1552 transition count 1302
Applied a total of 3012 rules in 614 ms. Remains 1552 /3060 variables (removed 1508) and now considering 1302/2810 (removed 1508) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-19 07:10:21] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-19 07:10:22] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-19 07:10:22] [INFO ] Invariant cache hit.
[2023-03-19 07:10:25] [INFO ] Implicit Places using invariants and state equation in 2526 ms returned []
Implicit Place search using SMT with State Equation took 3429 ms to find 0 implicit places.
[2023-03-19 07:10:25] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-19 07:10:25] [INFO ] Invariant cache hit.
[2023-03-19 07:10:26] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3060 places, 1302/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5158 ms. Remains : 1552/3060 places, 1302/2810 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s538 1) (EQ s551 1)) (AND (EQ s659 1) (EQ s661 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3317 steps with 0 reset in 45 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-06 finished in 5263 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(G(p0)))'
Support contains 1 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 404 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-19 07:10:26] [INFO ] Computed 551 place invariants in 19 ms
[2023-03-19 07:10:28] [INFO ] Implicit Places using invariants in 1682 ms returned []
[2023-03-19 07:10:28] [INFO ] Invariant cache hit.
[2023-03-19 07:10:32] [INFO ] Implicit Places using invariants and state equation in 4026 ms returned []
Implicit Place search using SMT with State Equation took 5710 ms to find 0 implicit places.
[2023-03-19 07:10:32] [INFO ] Invariant cache hit.
[2023-03-19 07:10:34] [INFO ] Dead Transitions using invariants and state equation in 1786 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7902 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 1927 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1018 0)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 802 steps with 0 reset in 12 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-07 finished in 9881 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(p1)))'
Support contains 5 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 508 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
[2023-03-19 07:10:37] [INFO ] Invariant cache hit.
[2023-03-19 07:10:39] [INFO ] Implicit Places using invariants in 1478 ms returned []
[2023-03-19 07:10:39] [INFO ] Invariant cache hit.
[2023-03-19 07:10:43] [INFO ] Implicit Places using invariants and state equation in 3962 ms returned []
Implicit Place search using SMT with State Equation took 5452 ms to find 0 implicit places.
[2023-03-19 07:10:43] [INFO ] Invariant cache hit.
[2023-03-19 07:10:45] [INFO ] Dead Transitions using invariants and state equation in 1673 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7634 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 1613 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (EQ s2594 0) (EQ s2609 0)) (EQ s1770 0)), p0:(OR (EQ s189 0) (EQ s221 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1576 ms.
Product exploration explored 100000 steps with 50000 reset in 1557 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-09 finished in 13807 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)||((p1 U (p2||G(p3)))&&X(X(F(p2))))))'
Support contains 7 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 465 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
[2023-03-19 07:10:50] [INFO ] Invariant cache hit.
[2023-03-19 07:10:52] [INFO ] Implicit Places using invariants in 1511 ms returned []
[2023-03-19 07:10:52] [INFO ] Invariant cache hit.
[2023-03-19 07:10:55] [INFO ] Implicit Places using invariants and state equation in 3805 ms returned []
Implicit Place search using SMT with State Equation took 5324 ms to find 0 implicit places.
[2023-03-19 07:10:55] [INFO ] Invariant cache hit.
[2023-03-19 07:10:58] [INFO ] Dead Transitions using invariants and state equation in 2304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8101 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 495 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR p2 p3 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s1218 1) (EQ s1298 1)), p3:(NEQ s199 1), p1:(AND (EQ s2884 1) (EQ s2914 1)), p0:(AND (EQ s2227 1) (EQ s2251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6904 steps with 0 reset in 103 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-10 finished in 8764 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 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 434 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
[2023-03-19 07:10:59] [INFO ] Invariant cache hit.
[2023-03-19 07:11:00] [INFO ] Implicit Places using invariants in 1614 ms returned []
[2023-03-19 07:11:00] [INFO ] Invariant cache hit.
[2023-03-19 07:11:04] [INFO ] Implicit Places using invariants and state equation in 3900 ms returned []
Implicit Place search using SMT with State Equation took 5538 ms to find 0 implicit places.
[2023-03-19 07:11:04] [INFO ] Invariant cache hit.
[2023-03-19 07:11:06] [INFO ] Dead Transitions using invariants and state equation in 2206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8190 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-11 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:(AND (EQ s1149 1) (EQ s1181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 14014 steps with 1 reset in 165 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-11 finished in 8558 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((F(p1)&&F(p2)&&p0)))'
Support contains 3 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3059 transition count 2459
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2709 transition count 2459
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 700 place count 2709 transition count 2209
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1200 place count 2459 transition count 2209
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1208 place count 2451 transition count 2201
Iterating global reduction 2 with 8 rules applied. Total rules applied 1216 place count 2451 transition count 2201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1216 place count 2451 transition count 2197
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1224 place count 2447 transition count 2197
Performed 891 Post agglomeration using F-continuation condition.Transition count delta: 891
Deduced a syphon composed of 891 places in 3 ms
Reduce places removed 891 places and 0 transitions.
Iterating global reduction 2 with 1782 rules applied. Total rules applied 3006 place count 1556 transition count 1306
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3008 place count 1554 transition count 1304
Applied a total of 3008 rules in 638 ms. Remains 1554 /3060 variables (removed 1506) and now considering 1304/2810 (removed 1506) transitions.
// Phase 1: matrix 1304 rows 1554 cols
[2023-03-19 07:11:08] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-19 07:11:08] [INFO ] Implicit Places using invariants in 849 ms returned []
[2023-03-19 07:11:08] [INFO ] Invariant cache hit.
[2023-03-19 07:11:11] [INFO ] Implicit Places using invariants and state equation in 2816 ms returned []
Implicit Place search using SMT with State Equation took 3672 ms to find 0 implicit places.
[2023-03-19 07:11:11] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-19 07:11:11] [INFO ] Invariant cache hit.
[2023-03-19 07:11:12] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1554/3060 places, 1304/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5277 ms. Remains : 1554/3060 places, 1304/2810 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s47 1) (EQ s65 1)), p1:(EQ s1214 1), p2:(AND (EQ s47 1) (EQ s65 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3416 steps with 0 reset in 63 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-12 finished in 5623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&X(F(p1)))||(p2&&X((p2 U (!p0||G(p2)))))||G(F(p1))))))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 417 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-19 07:11:13] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-19 07:11:14] [INFO ] Implicit Places using invariants in 1376 ms returned []
[2023-03-19 07:11:14] [INFO ] Invariant cache hit.
[2023-03-19 07:11:18] [INFO ] Implicit Places using invariants and state equation in 3784 ms returned []
Implicit Place search using SMT with State Equation took 5163 ms to find 0 implicit places.
[2023-03-19 07:11:18] [INFO ] Invariant cache hit.
[2023-03-19 07:11:20] [INFO ] Dead Transitions using invariants and state equation in 2318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3060 places, 2803/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7899 ms. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 671 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2116 1) (EQ s2150 1)), p2:(NEQ s2734 1), p1:(NEQ s2781 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1172 ms.
Product exploration explored 100000 steps with 33333 reset in 1054 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 p1)
Knowledge based reduction with 13 factoid took 691 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-13 finished in 11560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||G(p2)||p0))))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 481 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-19 07:11:25] [INFO ] Computed 551 place invariants in 18 ms
[2023-03-19 07:11:26] [INFO ] Implicit Places using invariants in 1656 ms returned []
[2023-03-19 07:11:26] [INFO ] Invariant cache hit.
[2023-03-19 07:11:30] [INFO ] Implicit Places using invariants and state equation in 4096 ms returned []
Implicit Place search using SMT with State Equation took 5760 ms to find 0 implicit places.
[2023-03-19 07:11:30] [INFO ] Invariant cache hit.
[2023-03-19 07:11:33] [INFO ] Dead Transitions using invariants and state equation in 2383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8638 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s704 1), p0:(OR (NEQ s1576 1) (NEQ s1610 1)), p2:(EQ s1618 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1500 ms.
Product exploration explored 100000 steps with 50000 reset in 1523 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/3052 stabilizing places and 599/2802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0 (NOT p2))
Knowledge based reduction with 11 factoid took 1322 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-14 finished in 13176 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' '!(((p0||G(!p1)) U X((p2||F(p3)))))'
Support contains 5 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 472 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-19 07:11:38] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-19 07:11:39] [INFO ] Implicit Places using invariants in 1597 ms returned []
[2023-03-19 07:11:39] [INFO ] Invariant cache hit.
[2023-03-19 07:11:43] [INFO ] Implicit Places using invariants and state equation in 3939 ms returned []
Implicit Place search using SMT with State Equation took 5567 ms to find 0 implicit places.
[2023-03-19 07:11:43] [INFO ] Invariant cache hit.
[2023-03-19 07:11:46] [INFO ] Dead Transitions using invariants and state equation in 2842 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3060 places, 2803/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8884 ms. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 427 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) p1)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s2008 1), p1:(OR (EQ s2159 1) (AND (EQ s2830 1) (EQ s2862 1))), p2:(NEQ s2756 1), p3:(EQ s2159 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1473 ms.
Product exploration explored 100000 steps with 50000 reset in 1483 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/3053 stabilizing places and 599/2803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p3))))
Knowledge based reduction with 18 factoid took 439 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-15 finished in 12798 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)))'
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)))'
[2023-03-19 07:11:50] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12204980364387764327
[2023-03-19 07:11:50] [INFO ] Too many transitions (2810) to apply POR reductions. Disabling POR matrices.
[2023-03-19 07:11:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12204980364387764327
Running compilation step : cd /tmp/ltsmin12204980364387764327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 07:11:50] [INFO ] Applying decomposition
[2023-03-19 07:11:51] [INFO ] Flatten gal took : 84 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/graph16075394419784878886.txt' '-o' '/tmp/graph16075394419784878886.bin' '-w' '/tmp/graph16075394419784878886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16075394419784878886.bin' '-l' '-1' '-v' '-w' '/tmp/graph16075394419784878886.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:11:51] [INFO ] Decomposing Gal with order
[2023-03-19 07:11:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:11:51] [INFO ] Removed a total of 450 redundant transitions.
[2023-03-19 07:11:51] [INFO ] Flatten gal took : 155 ms
[2023-03-19 07:11:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2023-03-19 07:11:51] [INFO ] Time to serialize gal into /tmp/LTLFireability5463883215075300734.gal : 41 ms
[2023-03-19 07:11:51] [INFO ] Time to serialize properties into /tmp/LTLFireability14600766975789917350.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/LTLFireability5463883215075300734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14600766975789917350.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 2 LTL properties
Checking formula 0 : !((G(F("((i42.i1.i0.u1039.p2955==0)||(i42.i3.i1.u1045.p2973==0))"))))
Formula 0 simplified : FG!"((i42.i1.i0.u1039.p2955==0)||(i42.i3.i1.u1045.p2973==0))"
Compilation finished in 6569 ms.
Running link step : cd /tmp/ltsmin12204980364387764327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin12204980364387764327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 07:34:05] [INFO ] Applying decomposition
[2023-03-19 07:34:05] [INFO ] Flatten gal took : 159 ms
[2023-03-19 07:34:05] [INFO ] Decomposing Gal with order
[2023-03-19 07:34:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:34:06] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 07:34:06] [INFO ] Flatten gal took : 249 ms
[2023-03-19 07:34:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 147 ms.
[2023-03-19 07:34:07] [INFO ] Time to serialize gal into /tmp/LTLFireability3346797905444630235.gal : 76 ms
[2023-03-19 07:34:07] [INFO ] Time to serialize properties into /tmp/LTLFireability17302277724758740541.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/LTLFireability3346797905444630235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17302277724758740541.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 2 LTL properties
Checking formula 0 : !((G(F("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u966.p2955==0)||(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u971.p2973==0))"))))
Formula 0 simplified : FG!"((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u966.p2955==0)||(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u971.p2973==0))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12204980364387764327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12204980364387764327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 07:56:21] [INFO ] Flatten gal took : 563 ms
[2023-03-19 07:56:26] [INFO ] Input system was already deterministic with 2810 transitions.
[2023-03-19 07:56:27] [INFO ] Transformed 3060 places.
[2023-03-19 07:56:27] [INFO ] Transformed 2810 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 07:56:29] [INFO ] Time to serialize gal into /tmp/LTLFireability2505260656824682468.gal : 553 ms
[2023-03-19 07:56:29] [INFO ] Time to serialize properties into /tmp/LTLFireability11013508030586616137.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2505260656824682468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11013508030586616137.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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p2955==0)||(p2973==0))"))))
Formula 0 simplified : FG!"((p2955==0)||(p2973==0))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10740548 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15360976 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPs-PT-050B"
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 ShieldPPPs-PT-050B, 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-167903713600508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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