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-167903713900692.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 ShieldPPPt-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713900692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K Feb 25 21:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 21:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 21:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 21:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 21:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 21:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 685K 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 ShieldPPPt-PT-100A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679222785576

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=ShieldPPPt-PT-100A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 10:46:28] [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 10:46:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:46:28] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-19 10:46:28] [INFO ] Transformed 2503 places.
[2023-03-19 10:46:28] [INFO ] Transformed 1803 transitions.
[2023-03-19 10:46:28] [INFO ] Found NUPN structural information;
[2023-03-19 10:46:28] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-100A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 273 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:46:29] [INFO ] Computed 1101 place invariants in 54 ms
[2023-03-19 10:46:31] [INFO ] Implicit Places using invariants in 2871 ms returned []
[2023-03-19 10:46:32] [INFO ] Invariant cache hit.
[2023-03-19 10:46:34] [INFO ] Implicit Places using invariants and state equation in 2432 ms returned []
Implicit Place search using SMT with State Equation took 5364 ms to find 0 implicit places.
[2023-03-19 10:46:34] [INFO ] Invariant cache hit.
[2023-03-19 10:46:36] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7330 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Support contains 45 out of 2503 places after structural reductions.
[2023-03-19 10:46:36] [INFO ] Flatten gal took : 295 ms
[2023-03-19 10:46:36] [INFO ] Flatten gal took : 204 ms
[2023-03-19 10:46:37] [INFO ] Input system was already deterministic with 1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 716 ms. (steps per millisecond=13 ) properties (out of 25) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-19 10:46:38] [INFO ] Invariant cache hit.
[2023-03-19 10:46:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 475 ms returned sat
[2023-03-19 10:46:40] [INFO ] After 2261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-19 10:46:42] [INFO ] [Nat]Absence check using 1101 positive place invariants in 358 ms returned sat
[2023-03-19 10:46:59] [INFO ] After 15192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-19 10:47:05] [INFO ] After 21728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-19 10:47:05] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 6 properties in 9843 ms.
Support contains 25 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 395 times.
Drop transitions removed 395 transitions
Iterating global reduction 0 with 395 rules applied. Total rules applied 399 place count 2501 transition count 1800
Applied a total of 399 rules in 560 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 102572 steps, run timeout after 6001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 102572 steps, saw 98360 distinct states, run finished after 6003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:47:24] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-19 10:47:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 357 ms returned sat
[2023-03-19 10:47:26] [INFO ] After 1620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 10:47:28] [INFO ] [Nat]Absence check using 1101 positive place invariants in 434 ms returned sat
[2023-03-19 10:47:35] [INFO ] After 6014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-19 10:47:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:47:40] [INFO ] After 5227ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-19 10:47:42] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 7 ms to minimize.
[2023-03-19 10:47:43] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 2 ms to minimize.
[2023-03-19 10:47:43] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 1 ms to minimize.
[2023-03-19 10:47:44] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 2 ms to minimize.
[2023-03-19 10:47:44] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 7 ms to minimize.
[2023-03-19 10:47:45] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 1 ms to minimize.
[2023-03-19 10:47:45] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 15 ms to minimize.
[2023-03-19 10:47:45] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-19 10:47:46] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 1 ms to minimize.
[2023-03-19 10:47:46] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-19 10:47:46] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 1 ms to minimize.
[2023-03-19 10:47:47] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-19 10:47:47] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 1 ms to minimize.
[2023-03-19 10:47:47] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 0 ms to minimize.
[2023-03-19 10:47:48] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-19 10:47:48] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 1 ms to minimize.
[2023-03-19 10:47:49] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-19 10:47:49] [INFO ] Deduced a trap composed of 7 places in 394 ms of which 1 ms to minimize.
[2023-03-19 10:47:49] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-19 10:47:50] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-19 10:47:50] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-19 10:47:50] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 8146 ms
[2023-03-19 10:47:51] [INFO ] After 16350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 10:47:51] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 6446 ms.
Support contains 25 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 108 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 117 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-19 10:47:58] [INFO ] Invariant cache hit.
[2023-03-19 10:48:01] [INFO ] Implicit Places using invariants in 3018 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3031 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 211 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-19 10:48:01] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-19 10:48:03] [INFO ] Implicit Places using invariants in 2621 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2627 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 450 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:48:04] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-19 10:48:06] [INFO ] Implicit Places using invariants in 2082 ms returned []
[2023-03-19 10:48:06] [INFO ] Invariant cache hit.
[2023-03-19 10:48:08] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-19 10:48:13] [INFO ] Implicit Places using invariants and state equation in 7395 ms returned []
Implicit Place search using SMT with State Equation took 9490 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 15926 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 152840 steps, run timeout after 9008 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 152840 steps, saw 145684 distinct states, run finished after 9010 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-19 10:48:25] [INFO ] Invariant cache hit.
[2023-03-19 10:48:27] [INFO ] [Real]Absence check using 1098 positive place invariants in 281 ms returned sat
[2023-03-19 10:48:27] [INFO ] After 1644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 10:48:29] [INFO ] [Nat]Absence check using 1098 positive place invariants in 378 ms returned sat
[2023-03-19 10:48:36] [INFO ] After 6348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-19 10:48:36] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-19 10:48:51] [INFO ] After 15516ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-19 10:48:52] [INFO ] After 16312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 10:48:52] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Finished Parikh walk after 2432 steps, including 0 resets, run visited all 14 properties in 212 ms. (steps per millisecond=11 )
Parikh walk visited 14 properties in 213 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 108 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:48:53] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-19 10:48:54] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-19 10:48:54] [INFO ] Invariant cache hit.
[2023-03-19 10:48:56] [INFO ] Implicit Places using invariants and state equation in 2483 ms returned []
Implicit Place search using SMT with State Equation took 3000 ms to find 0 implicit places.
[2023-03-19 10:48:56] [INFO ] Invariant cache hit.
[2023-03-19 10:48:58] [INFO ] Dead Transitions using invariants and state equation in 2136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5256 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 476 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s2367 1) (EQ s2369 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 5 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-01 finished in 5859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))||X(F(p0))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 134 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-19 10:48:59] [INFO ] Invariant cache hit.
[2023-03-19 10:49:00] [INFO ] Implicit Places using invariants in 1507 ms returned []
[2023-03-19 10:49:00] [INFO ] Invariant cache hit.
[2023-03-19 10:49:03] [INFO ] Implicit Places using invariants and state equation in 2398 ms returned []
Implicit Place search using SMT with State Equation took 3913 ms to find 0 implicit places.
[2023-03-19 10:49:03] [INFO ] Invariant cache hit.
[2023-03-19 10:49:04] [INFO ] Dead Transitions using invariants and state equation in 1478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5527 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(OR p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s154 1) (EQ s173 1)), p1:(AND (EQ s1807 1) (EQ s1809 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1765 ms.
Stack based approach found an accepted trace after 99 steps with 0 reset with depth 100 and stack size 100 in 3 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-04 finished in 7558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 372 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:49:07] [INFO ] Computed 1101 place invariants in 8 ms
[2023-03-19 10:49:09] [INFO ] Implicit Places using invariants in 1906 ms returned []
[2023-03-19 10:49:09] [INFO ] Invariant cache hit.
[2023-03-19 10:49:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 10:49:11] [INFO ] Implicit Places using invariants and state equation in 2467 ms returned []
Implicit Place search using SMT with State Equation took 4375 ms to find 0 implicit places.
[2023-03-19 10:49:11] [INFO ] Redundant transitions in 155 ms returned []
[2023-03-19 10:49:11] [INFO ] Invariant cache hit.
[2023-03-19 10:49:13] [INFO ] Dead Transitions using invariants and state equation in 1346 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6275 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1105 1) (EQ s1122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1574 ms.
Stack based approach found an accepted trace after 226 steps with 0 reset with depth 227 and stack size 227 in 5 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-06 finished in 7927 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)))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 128 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:49:14] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-19 10:49:16] [INFO ] Implicit Places using invariants in 1528 ms returned []
[2023-03-19 10:49:16] [INFO ] Invariant cache hit.
[2023-03-19 10:49:21] [INFO ] Implicit Places using invariants and state equation in 5437 ms returned []
Implicit Place search using SMT with State Equation took 6982 ms to find 0 implicit places.
[2023-03-19 10:49:21] [INFO ] Invariant cache hit.
[2023-03-19 10:49:23] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8361 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1299 0) (AND (EQ s843 1) (EQ s850 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 7542 ms.
Product exploration explored 100000 steps with 50000 reset in 8018 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLFireability-07 finished in 24310 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)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 154 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-19 10:49:39] [INFO ] Invariant cache hit.
[2023-03-19 10:49:41] [INFO ] Implicit Places using invariants in 2667 ms returned []
[2023-03-19 10:49:41] [INFO ] Invariant cache hit.
[2023-03-19 10:49:44] [INFO ] Implicit Places using invariants and state equation in 2612 ms returned []
Implicit Place search using SMT with State Equation took 5297 ms to find 0 implicit places.
[2023-03-19 10:49:44] [INFO ] Invariant cache hit.
[2023-03-19 10:49:46] [INFO ] Dead Transitions using invariants and state equation in 1912 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7365 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s181 0) (EQ s196 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 7540 ms.
Product exploration explored 100000 steps with 50000 reset in 7663 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100A-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLFireability-08 finished in 22851 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((G(p0)||F((p1||X(p2)||G(p3))))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 347 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:50:02] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-19 10:50:04] [INFO ] Implicit Places using invariants in 1811 ms returned []
[2023-03-19 10:50:04] [INFO ] Invariant cache hit.
[2023-03-19 10:50:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 10:50:10] [INFO ] Implicit Places using invariants and state equation in 5990 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7823 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 168 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-19 10:50:10] [INFO ] Computed 1100 place invariants in 11 ms
[2023-03-19 10:50:12] [INFO ] Implicit Places using invariants in 1750 ms returned []
[2023-03-19 10:50:12] [INFO ] Invariant cache hit.
[2023-03-19 10:50:16] [INFO ] Implicit Places using invariants and state equation in 4878 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6646 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 304 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:50:17] [INFO ] Computed 1098 place invariants in 11 ms
[2023-03-19 10:50:20] [INFO ] Implicit Places using invariants in 3049 ms returned []
[2023-03-19 10:50:20] [INFO ] Invariant cache hit.
[2023-03-19 10:50:25] [INFO ] Implicit Places using invariants and state equation in 5539 ms returned []
Implicit Place search using SMT with State Equation took 8641 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 23930 ms. Remains : 2494/2503 places, 1796/1802 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s388 0) (EQ s402 0)), p1:(AND (EQ s1018 1) (EQ s1025 1)), p3:(AND (EQ s1666 1) (EQ s1677 1)), p2:(AND (EQ s388 1) (EQ s402 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1531 ms.
Product exploration explored 100000 steps with 0 reset in 1914 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 322 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 107397 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 107397 steps, saw 106372 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 10:50:33] [INFO ] Invariant cache hit.
[2023-03-19 10:50:34] [INFO ] After 598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:50:35] [INFO ] [Nat]Absence check using 1098 positive place invariants in 270 ms returned sat
[2023-03-19 10:50:39] [INFO ] After 3978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:50:39] [INFO ] After 4200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2343 ms.
[2023-03-19 10:50:42] [INFO ] After 7705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 162 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 397 times.
Drop transitions removed 397 transitions
Iterating global reduction 0 with 397 rules applied. Total rules applied 397 place count 2494 transition count 1796
Applied a total of 397 rules in 307 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 123837 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123837 steps, saw 118342 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:50:45] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-19 10:50:46] [INFO ] After 866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:50:47] [INFO ] [Nat]Absence check using 1098 positive place invariants in 407 ms returned sat
[2023-03-19 10:50:51] [INFO ] After 4036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:50:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:50:52] [INFO ] After 852ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:50:53] [INFO ] After 1935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-19 10:50:53] [INFO ] After 7224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 319 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 134 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 142 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-19 10:50:54] [INFO ] Invariant cache hit.
[2023-03-19 10:50:56] [INFO ] Implicit Places using invariants in 1633 ms returned []
[2023-03-19 10:50:56] [INFO ] Invariant cache hit.
[2023-03-19 10:50:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:51:07] [INFO ] Implicit Places using invariants and state equation in 11154 ms returned []
Implicit Place search using SMT with State Equation took 12791 ms to find 0 implicit places.
[2023-03-19 10:51:07] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-19 10:51:07] [INFO ] Invariant cache hit.
[2023-03-19 10:51:09] [INFO ] Dead Transitions using invariants and state equation in 2300 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15323 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 2494 transition count 1796
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 2494 transition count 1696
Applied a total of 200 rules in 483 ms. Remains 2494 /2494 variables (removed 0) and now considering 1696/1796 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1696 rows 2494 cols
[2023-03-19 10:51:10] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-19 10:51:10] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:51:11] [INFO ] [Nat]Absence check using 1098 positive place invariants in 232 ms returned sat
[2023-03-19 10:51:14] [INFO ] After 2711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:51:14] [INFO ] After 3563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-19 10:51:15] [INFO ] After 4408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p1) (NOT p2) p3))]
Knowledge based reduction with 5 factoid took 519 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 6 out of 2494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 163 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:51:16] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-19 10:51:17] [INFO ] Implicit Places using invariants in 1843 ms returned []
[2023-03-19 10:51:17] [INFO ] Invariant cache hit.
[2023-03-19 10:51:23] [INFO ] Implicit Places using invariants and state equation in 5079 ms returned []
Implicit Place search using SMT with State Equation took 6924 ms to find 0 implicit places.
[2023-03-19 10:51:23] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-19 10:51:23] [INFO ] Invariant cache hit.
[2023-03-19 10:51:26] [INFO ] Dead Transitions using invariants and state equation in 3209 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10395 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 116439 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 116439 steps, saw 115335 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 10:51:30] [INFO ] Invariant cache hit.
[2023-03-19 10:51:31] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:51:32] [INFO ] [Nat]Absence check using 1098 positive place invariants in 234 ms returned sat
[2023-03-19 10:51:34] [INFO ] After 2655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:51:34] [INFO ] After 2924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1757 ms.
[2023-03-19 10:51:36] [INFO ] After 5728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 164 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 397 times.
Drop transitions removed 397 transitions
Iterating global reduction 0 with 397 rules applied. Total rules applied 397 place count 2494 transition count 1796
Applied a total of 397 rules in 305 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125920 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125920 steps, saw 120290 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:51:40] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-19 10:51:40] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:51:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 252 ms returned sat
[2023-03-19 10:51:45] [INFO ] After 4004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:51:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:51:46] [INFO ] After 895ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 10:51:47] [INFO ] After 1763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-19 10:51:47] [INFO ] After 6805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 187 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 177 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 117 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-19 10:51:48] [INFO ] Invariant cache hit.
[2023-03-19 10:51:50] [INFO ] Implicit Places using invariants in 1739 ms returned []
[2023-03-19 10:51:50] [INFO ] Invariant cache hit.
[2023-03-19 10:51:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 10:52:00] [INFO ] Implicit Places using invariants and state equation in 10087 ms returned []
Implicit Place search using SMT with State Equation took 11842 ms to find 0 implicit places.
[2023-03-19 10:52:00] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-19 10:52:00] [INFO ] Invariant cache hit.
[2023-03-19 10:52:01] [INFO ] Dead Transitions using invariants and state equation in 1415 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13438 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 2494 transition count 1796
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 2494 transition count 1696
Applied a total of 200 rules in 349 ms. Remains 2494 /2494 variables (removed 0) and now considering 1696/1796 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1696 rows 2494 cols
[2023-03-19 10:52:01] [INFO ] Computed 1098 place invariants in 10 ms
[2023-03-19 10:52:02] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:52:03] [INFO ] [Nat]Absence check using 1098 positive place invariants in 274 ms returned sat
[2023-03-19 10:52:06] [INFO ] After 2901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:52:07] [INFO ] After 3738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-19 10:52:07] [INFO ] After 4735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p1) (NOT p2) p3))]
Knowledge based reduction with 5 factoid took 445 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 1659 ms.
Product exploration explored 100000 steps with 0 reset in 2037 ms.
Built C files in :
/tmp/ltsmin8415096727659299553
[2023-03-19 10:52:12] [INFO ] Too many transitions (1796) to apply POR reductions. Disabling POR matrices.
[2023-03-19 10:52:12] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8415096727659299553
Running compilation step : cd /tmp/ltsmin8415096727659299553;'/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/ltsmin8415096727659299553;'/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/ltsmin8415096727659299553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 2494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 141 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:52:15] [INFO ] Computed 1098 place invariants in 10 ms
[2023-03-19 10:52:16] [INFO ] Implicit Places using invariants in 1578 ms returned []
[2023-03-19 10:52:16] [INFO ] Invariant cache hit.
[2023-03-19 10:52:22] [INFO ] Implicit Places using invariants and state equation in 5229 ms returned []
Implicit Place search using SMT with State Equation took 6849 ms to find 0 implicit places.
[2023-03-19 10:52:22] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-19 10:52:22] [INFO ] Invariant cache hit.
[2023-03-19 10:52:23] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8423 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Built C files in :
/tmp/ltsmin7183918138076265130
[2023-03-19 10:52:23] [INFO ] Too many transitions (1796) to apply POR reductions. Disabling POR matrices.
[2023-03-19 10:52:23] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7183918138076265130
Running compilation step : cd /tmp/ltsmin7183918138076265130;'/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/ltsmin7183918138076265130;'/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/ltsmin7183918138076265130;'/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 10:52:26] [INFO ] Flatten gal took : 109 ms
[2023-03-19 10:52:27] [INFO ] Flatten gal took : 105 ms
[2023-03-19 10:52:27] [INFO ] Time to serialize gal into /tmp/LTL17014805563149178355.gal : 19 ms
[2023-03-19 10:52:27] [INFO ] Time to serialize properties into /tmp/LTL3687900835945250852.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17014805563149178355.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8595700648486042324.hoa' '-atoms' '/tmp/LTL3687900835945250852.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/LTL3687900835945250852.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8595700648486042324.hoa
Detected timeout of ITS tools.
[2023-03-19 10:52:42] [INFO ] Flatten gal took : 110 ms
[2023-03-19 10:52:42] [INFO ] Flatten gal took : 135 ms
[2023-03-19 10:52:42] [INFO ] Time to serialize gal into /tmp/LTL14999407937598035842.gal : 20 ms
[2023-03-19 10:52:42] [INFO ] Time to serialize properties into /tmp/LTL2573308032882989887.ltl : 13 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/LTL14999407937598035842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2573308032882989887.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((G("((p388==0)||(p402==0))"))||(F((("((p1018==1)&&(p1025==1))")||(X("((p388==1)&&(p402==1))")))||(G("((p1666==1)&&(p1677==1))")))...159
Formula 0 simplified : F(F!"((p388==0)||(p402==0))" & G(!"((p1018==1)&&(p1025==1))" & X!"((p388==1)&&(p402==1))" & F!"((p1666==1)&&(p1677==1))"))
Detected timeout of ITS tools.
[2023-03-19 10:52:57] [INFO ] Flatten gal took : 105 ms
[2023-03-19 10:52:57] [INFO ] Applying decomposition
[2023-03-19 10:52:57] [INFO ] Flatten gal took : 102 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/graph1012926924259078137.txt' '-o' '/tmp/graph1012926924259078137.bin' '-w' '/tmp/graph1012926924259078137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1012926924259078137.bin' '-l' '-1' '-v' '-w' '/tmp/graph1012926924259078137.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:52:58] [INFO ] Decomposing Gal with order
[2023-03-19 10:52:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:52:58] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-19 10:52:58] [INFO ] Flatten gal took : 176 ms
[2023-03-19 10:52:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 350 ms.
[2023-03-19 10:52:59] [INFO ] Time to serialize gal into /tmp/LTL1371804370079957479.gal : 32 ms
[2023-03-19 10:52:59] [INFO ] Time to serialize properties into /tmp/LTL10862509155767088328.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/LTL1371804370079957479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10862509155767088328.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((G("((i5.u123.p388==0)||(i5.u128.p402==0))"))||(F((("((i16.u324.p1018==1)&&(i15.u327.p1025==1))")||(X("((i5.u123.p388==1)&&(i5.u1...236
Formula 0 simplified : F(F!"((i5.u123.p388==0)||(i5.u128.p402==0))" & G(!"((i16.u324.p1018==1)&&(i15.u327.p1025==1))" & X!"((i5.u123.p388==1)&&(i5.u128.p40...222
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7819894300230615102
[2023-03-19 10:53:14] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7819894300230615102
Running compilation step : cd /tmp/ltsmin7819894300230615102;'/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/ltsmin7819894300230615102;'/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/ltsmin7819894300230615102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-09 finished in 195282 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 U p1)||(G(p0)&&X(p2))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 347 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:53:17] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-19 10:53:19] [INFO ] Implicit Places using invariants in 1494 ms returned []
[2023-03-19 10:53:19] [INFO ] Invariant cache hit.
[2023-03-19 10:53:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 10:53:25] [INFO ] Implicit Places using invariants and state equation in 6508 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8029 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 161 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-19 10:53:25] [INFO ] Computed 1100 place invariants in 9 ms
[2023-03-19 10:53:28] [INFO ] Implicit Places using invariants in 2597 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2603 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 294 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:53:28] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-19 10:53:31] [INFO ] Implicit Places using invariants in 2502 ms returned []
[2023-03-19 10:53:31] [INFO ] Invariant cache hit.
[2023-03-19 10:53:38] [INFO ] Implicit Places using invariants and state equation in 6828 ms returned []
Implicit Place search using SMT with State Equation took 9332 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20766 ms. Remains : 2494/2503 places, 1796/1802 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1326 1), p0:(AND (EQ s1882 1) (EQ s1884 1)), p2:(AND (EQ s2415 1) (EQ s2449 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1626 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-10 finished in 22847 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||F(p1)) U X(X((!p2 U (G(!p2)||(!p2&&G(!p3))))))))'
Support contains 8 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 143 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-19 10:53:40] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-19 10:53:42] [INFO ] Implicit Places using invariants in 1897 ms returned []
[2023-03-19 10:53:42] [INFO ] Invariant cache hit.
[2023-03-19 10:53:48] [INFO ] Implicit Places using invariants and state equation in 5793 ms returned []
Implicit Place search using SMT with State Equation took 7705 ms to find 0 implicit places.
[2023-03-19 10:53:48] [INFO ] Invariant cache hit.
[2023-03-19 10:53:50] [INFO ] Dead Transitions using invariants and state equation in 2344 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10217 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 812 ms :[p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (NOT p1), (AND (NOT p1) p2 p3), (AND (NOT p1) p2 p3), (AND p2 p3), (AND (NOT p1) p3)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=p2, acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p1), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=9 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={0} source=9 dest: 5}, { cond=(AND p3 p2), acceptance={0, 1} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p3) p2), acceptance={1} source=9 dest: 9}], [{ cond=(AND (NOT p1) p3), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (EQ s1141 1) (EQ s1152 1)), p1:(AND (EQ s718 1) (EQ s725 1)), p3:(AND (EQ s2493 1) (EQ s2500 1)), p2:(AND (EQ s2440 1) (EQ s2474 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1594 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-11 finished in 12712 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(p0)||(p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 144 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-19 10:53:52] [INFO ] Invariant cache hit.
[2023-03-19 10:53:54] [INFO ] Implicit Places using invariants in 1800 ms returned []
[2023-03-19 10:53:54] [INFO ] Invariant cache hit.
[2023-03-19 10:53:56] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned []
Implicit Place search using SMT with State Equation took 3956 ms to find 0 implicit places.
[2023-03-19 10:53:56] [INFO ] Invariant cache hit.
[2023-03-19 10:53:59] [INFO ] Dead Transitions using invariants and state equation in 2188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6290 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s2391 1) (EQ s2402 1)), p1:(EQ s1149 1), p2:(NEQ s1647 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1586 ms.
Stack based approach found an accepted trace after 137 steps with 0 reset with depth 138 and stack size 138 in 3 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-12 finished in 8122 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((F(G(p1))&&p0)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 117 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-19 10:54:01] [INFO ] Invariant cache hit.
[2023-03-19 10:54:03] [INFO ] Implicit Places using invariants in 2787 ms returned []
[2023-03-19 10:54:03] [INFO ] Invariant cache hit.
[2023-03-19 10:54:08] [INFO ] Implicit Places using invariants and state equation in 4358 ms returned []
Implicit Place search using SMT with State Equation took 7177 ms to find 0 implicit places.
[2023-03-19 10:54:08] [INFO ] Invariant cache hit.
[2023-03-19 10:54:10] [INFO ] Dead Transitions using invariants and state equation in 2719 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10023 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s136 1) (EQ s146 1)), p1:(AND (EQ s987 1) (EQ s989 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 0 reset in 1573 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-14 finished in 12066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1&&F(p0)))))))'
Support contains 1 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 391 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-19 10:54:13] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-19 10:54:16] [INFO ] Implicit Places using invariants in 2751 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2766 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 170 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-19 10:54:16] [INFO ] Computed 1100 place invariants in 10 ms
[2023-03-19 10:54:18] [INFO ] Implicit Places using invariants in 2506 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2528 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 314 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-19 10:54:19] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-19 10:54:22] [INFO ] Implicit Places using invariants in 2974 ms returned []
[2023-03-19 10:54:22] [INFO ] Invariant cache hit.
[2023-03-19 10:54:27] [INFO ] Implicit Places using invariants and state equation in 5103 ms returned []
Implicit Place search using SMT with State Equation took 8083 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 14254 ms. Remains : 2494/2503 places, 1796/1802 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2022 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 0 reset in 1532 ms.
Product exploration explored 100000 steps with 0 reset in 2048 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 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 98 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7963 steps, run visited all 1 properties in 169 ms. (steps per millisecond=47 )
Probabilistic random walk after 7963 steps, saw 7740 distinct states, run finished after 170 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 320 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 118 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2494 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 145 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-19 10:54:32] [INFO ] Invariant cache hit.
[2023-03-19 10:54:35] [INFO ] Implicit Places using invariants in 2522 ms returned []
[2023-03-19 10:54:35] [INFO ] Invariant cache hit.
[2023-03-19 10:54:39] [INFO ] Implicit Places using invariants and state equation in 4445 ms returned []
Implicit Place search using SMT with State Equation took 6985 ms to find 0 implicit places.
[2023-03-19 10:54:39] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-19 10:54:39] [INFO ] Invariant cache hit.
[2023-03-19 10:54:40] [INFO ] Dead Transitions using invariants and state equation in 1301 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8522 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7963 steps, run visited all 1 properties in 176 ms. (steps per millisecond=45 )
Probabilistic random walk after 7963 steps, saw 7740 distinct states, run finished after 178 ms. (steps per millisecond=44 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 1136 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 245 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1575 ms.
Product exploration explored 100000 steps with 0 reset in 2022 ms.
Built C files in :
/tmp/ltsmin11105014731836936464
[2023-03-19 10:54:47] [INFO ] Too many transitions (1796) to apply POR reductions. Disabling POR matrices.
[2023-03-19 10:54:47] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11105014731836936464
Running compilation step : cd /tmp/ltsmin11105014731836936464;'/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/ltsmin11105014731836936464;'/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/ltsmin11105014731836936464;'/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 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 155 ms. Remains 2493 /2494 variables (removed 1) and now considering 1795/1796 (removed 1) transitions.
// Phase 1: matrix 1795 rows 2493 cols
[2023-03-19 10:54:50] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-19 10:54:52] [INFO ] Implicit Places using invariants in 1952 ms returned []
[2023-03-19 10:54:52] [INFO ] Invariant cache hit.
[2023-03-19 10:54:56] [INFO ] Implicit Places using invariants and state equation in 4386 ms returned []
Implicit Place search using SMT with State Equation took 6373 ms to find 0 implicit places.
[2023-03-19 10:54:56] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-19 10:54:56] [INFO ] Invariant cache hit.
[2023-03-19 10:54:58] [INFO ] Dead Transitions using invariants and state equation in 1650 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8230 ms. Remains : 2493/2494 places, 1795/1796 transitions.
Built C files in :
/tmp/ltsmin16931880213581054921
[2023-03-19 10:54:58] [INFO ] Too many transitions (1795) to apply POR reductions. Disabling POR matrices.
[2023-03-19 10:54:58] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16931880213581054921
Running compilation step : cd /tmp/ltsmin16931880213581054921;'/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/ltsmin16931880213581054921;'/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/ltsmin16931880213581054921;'/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 10:55:01] [INFO ] Flatten gal took : 59 ms
[2023-03-19 10:55:01] [INFO ] Flatten gal took : 57 ms
[2023-03-19 10:55:01] [INFO ] Time to serialize gal into /tmp/LTL11534923695802012449.gal : 8 ms
[2023-03-19 10:55:01] [INFO ] Time to serialize properties into /tmp/LTL7646721374023267112.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/LTL11534923695802012449.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10767322804476789748.hoa' '-atoms' '/tmp/LTL7646721374023267112.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7646721374023267112.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10767322804476789748.hoa
Detected timeout of ITS tools.
[2023-03-19 10:55:17] [INFO ] Flatten gal took : 202 ms
[2023-03-19 10:55:17] [INFO ] Flatten gal took : 127 ms
[2023-03-19 10:55:17] [INFO ] Time to serialize gal into /tmp/LTL5338948055858451271.gal : 19 ms
[2023-03-19 10:55:17] [INFO ] Time to serialize properties into /tmp/LTL4305721619908780070.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/LTL5338948055858451271.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4305721619908780070.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p2022==0)")||(G(("((p1406==0)||(p1421==0))")&&(F("(p2022==0)"))))))))
Formula 0 simplified : FG!"(p2022==0)"
Detected timeout of ITS tools.
[2023-03-19 10:55:32] [INFO ] Flatten gal took : 94 ms
[2023-03-19 10:55:32] [INFO ] Applying decomposition
[2023-03-19 10:55:32] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11220801091744268361.txt' '-o' '/tmp/graph11220801091744268361.bin' '-w' '/tmp/graph11220801091744268361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11220801091744268361.bin' '-l' '-1' '-v' '-w' '/tmp/graph11220801091744268361.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:55:32] [INFO ] Decomposing Gal with order
[2023-03-19 10:55:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:55:32] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-19 10:55:32] [INFO ] Flatten gal took : 103 ms
[2023-03-19 10:55:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 252 ms.
[2023-03-19 10:55:33] [INFO ] Time to serialize gal into /tmp/LTL15125097881033839571.gal : 30 ms
[2023-03-19 10:55:33] [INFO ] Time to serialize properties into /tmp/LTL2704583520736771478.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/LTL15125097881033839571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2704583520736771478.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(("(i24.u646.p2022==0)")||(G(("((i16.u450.p1406==0)||(i16.u453.p1421==0))")&&(F("(i24.u646.p2022==0)"))))))))
Formula 0 simplified : FG!"(i24.u646.p2022==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16882081798528207437
[2023-03-19 10:55:48] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16882081798528207437
Running compilation step : cd /tmp/ltsmin16882081798528207437;'/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/ltsmin16882081798528207437;'/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/ltsmin16882081798528207437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-15 finished in 98423 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((G(p0)||F((p1||X(p2)||G(p3))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1&&F(p0)))))))'
[2023-03-19 10:55:52] [INFO ] Flatten gal took : 110 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14818893579332765214
[2023-03-19 10:55:52] [INFO ] Too many transitions (1802) to apply POR reductions. Disabling POR matrices.
[2023-03-19 10:55:52] [INFO ] Applying decomposition
[2023-03-19 10:55:52] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14818893579332765214
Running compilation step : cd /tmp/ltsmin14818893579332765214;'/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 10:55:52] [INFO ] Flatten gal took : 102 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/graph7110645548701531565.txt' '-o' '/tmp/graph7110645548701531565.bin' '-w' '/tmp/graph7110645548701531565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7110645548701531565.bin' '-l' '-1' '-v' '-w' '/tmp/graph7110645548701531565.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:55:52] [INFO ] Decomposing Gal with order
[2023-03-19 10:55:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:55:52] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 10:55:52] [INFO ] Flatten gal took : 127 ms
[2023-03-19 10:55:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 165 ms.
[2023-03-19 10:55:52] [INFO ] Time to serialize gal into /tmp/LTLFireability17236264736318584409.gal : 23 ms
[2023-03-19 10:55:52] [INFO ] Time to serialize properties into /tmp/LTLFireability5950979605799869827.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/LTLFireability17236264736318584409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5950979605799869827.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((G("((i5.u123.p388==0)||(i5.u128.p402==0))"))||(F((("((i13.u324.p1018==1)&&(i13.u327.p1025==1))")||(X("((i5.u123.p388==1)&&(i5.u1...227
Formula 0 simplified : F(F!"((i5.u123.p388==0)||(i5.u128.p402==0))" & G(!"((i13.u324.p1018==1)&&(i13.u327.p1025==1))" & X!"((i5.u123.p388==1)&&(i5.u128.p40...213
Compilation finished in 4784 ms.
Running link step : cd /tmp/ltsmin14818893579332765214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 192 ms.
Running LTSmin : cd /tmp/ltsmin14818893579332765214;'/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))||<>(((LTLAPp1==true)||X((LTLAPp2==true))||[]((LTLAPp3==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.051: LTL layer: formula: [](([]((LTLAPp0==true))||<>(((LTLAPp1==true)||X((LTLAPp2==true))||[]((LTLAPp3==true))))))
pins2lts-mc-linux64( 1/ 8), 0.051: "[](([]((LTLAPp0==true))||<>(((LTLAPp1==true)||X((LTLAPp2==true))||[]((LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.052: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.132: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.262: There are 1809 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.262: State length is 2504, there are 1808 groups
pins2lts-mc-linux64( 0/ 8), 1.262: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.262: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.262: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.262: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.467: [Blue] ~119 levels ~960 states ~4048 transitions
pins2lts-mc-linux64( 0/ 8), 1.660: [Blue] ~237 levels ~1920 states ~8600 transitions
pins2lts-mc-linux64( 0/ 8), 2.041: [Blue] ~474 levels ~3840 states ~18040 transitions
pins2lts-mc-linux64( 4/ 8), 2.675: [Blue] ~944 levels ~7680 states ~38640 transitions
pins2lts-mc-linux64( 4/ 8), 3.907: [Blue] ~1901 levels ~15360 states ~82176 transitions
pins2lts-mc-linux64( 4/ 8), 6.215: [Blue] ~3812 levels ~30720 states ~178368 transitions
pins2lts-mc-linux64( 4/ 8), 10.588: [Blue] ~7634 levels ~61440 states ~371968 transitions
pins2lts-mc-linux64( 0/ 8), 19.453: [Blue] ~15159 levels ~122880 states ~696856 transitions
pins2lts-mc-linux64( 4/ 8), 36.286: [Blue] ~30600 levels ~245760 states ~1607744 transitions
pins2lts-mc-linux64( 4/ 8), 69.623: [Blue] ~61193 levels ~491520 states ~3319280 transitions
pins2lts-mc-linux64( 0/ 8), 136.280: [Blue] ~121769 levels ~983040 states ~6373072 transitions
pins2lts-mc-linux64( 4/ 8), 270.280: [Blue] ~245021 levels ~1966080 states ~14387696 transitions
pins2lts-mc-linux64( 2/ 8), 351.694: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 352.200:
pins2lts-mc-linux64( 0/ 8), 352.200: Explored 2237966 states 16380950 transitions, fanout: 7.320
pins2lts-mc-linux64( 0/ 8), 352.200: Total exploration time 350.910 sec (350.420 sec minimum, 350.563 sec on average)
pins2lts-mc-linux64( 0/ 8), 352.200: States per second: 6378, Transitions per second: 46681
pins2lts-mc-linux64( 0/ 8), 352.200:
pins2lts-mc-linux64( 0/ 8), 352.200: State space has 8957863 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 352.200: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 352.200: blue states: 2237966 (24.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 352.200: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 352.200: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 352.200:
pins2lts-mc-linux64( 0/ 8), 352.200: Total memory used for local state coloring: 34.0MB
pins2lts-mc-linux64( 0/ 8), 352.200:
pins2lts-mc-linux64( 0/ 8), 352.200: Queue width: 8B, total height: 2230654, memory: 17.02MB
pins2lts-mc-linux64( 0/ 8), 352.200: Tree memory: 324.3MB, 38.0 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 352.200: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 352.200: Stored 1829 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 352.200: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 352.200: Est. total memory use: 341.4MB (~1041.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14818893579332765214;'/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))||<>(((LTLAPp1==true)||X((LTLAPp2==true))||[]((LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14818893579332765214;'/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))||<>(((LTLAPp1==true)||X((LTLAPp2==true))||[]((LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
96082 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,961.101,8062912,1,0,1.26956e+07,726,5047,4.86689e+07,82,4169,553722
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-100A-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("(i27.u646.p2022==0)")||(G(("((i20.u450.p1406==0)||(i20.u453.p1421==0))")&&(F("(i27.u646.p2022==0)"))))))))
Formula 1 simplified : FG!"(i27.u646.p2022==0)"
Detected timeout of ITS tools.
[2023-03-19 11:19:00] [INFO ] Applying decomposition
[2023-03-19 11:19:00] [INFO ] Flatten gal took : 128 ms
[2023-03-19 11:19:00] [INFO ] Decomposing Gal with order
[2023-03-19 11:19:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:19:00] [INFO ] Removed a total of 600 redundant transitions.
[2023-03-19 11:19:00] [INFO ] Flatten gal took : 114 ms
[2023-03-19 11:19:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 61 ms.
[2023-03-19 11:19:00] [INFO ] Time to serialize gal into /tmp/LTLFireability13820341601732681559.gal : 27 ms
[2023-03-19 11:19:00] [INFO ] Time to serialize properties into /tmp/LTLFireability15364612243189130758.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/LTLFireability13820341601732681559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15364612243189130758.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...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("(u1133.p2022==0)")||(G(("((i450.u788.p1406==0)||(u796.p1421==0))")&&(F("(u1133.p2022==0)"))))))))
Formula 0 simplified : FG!"(u1133.p2022==0)"
ITS-tools command line returned an error code 137
[2023-03-19 11:29:13] [INFO ] Flatten gal took : 4621 ms
[2023-03-19 11:29:19] [INFO ] Input system was already deterministic with 1802 transitions.
[2023-03-19 11:29:19] [INFO ] Transformed 2503 places.
[2023-03-19 11:29:19] [INFO ] Transformed 1802 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 11:29:20] [INFO ] Time to serialize gal into /tmp/LTLFireability931718133277267829.gal : 61 ms
[2023-03-19 11:29:20] [INFO ] Time to serialize properties into /tmp/LTLFireability752524979519534011.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability931718133277267829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability752524979519534011.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...340
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(p2022==0)")||(G(("((p1406==0)||(p1421==0))")&&(F("(p2022==0)"))))))))
Formula 0 simplified : FG!"(p2022==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
16094 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,161.513,2453196,1,0,7,1.7079e+07,20,0,37655,1.41897e+06,23
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-100A-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2734309 ms.

BK_STOP 1679225524516

--------------------
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="ShieldPPPt-PT-100A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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