Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024800171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.5K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.7M May 10 09:34 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 ShieldIIPs-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652948514759

Running Version 202205111006
[2022-05-19 08:21:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 08:21:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 08:21:56] [INFO ] Load time of PNML (sax parser for PT used): 271 ms
[2022-05-19 08:21:56] [INFO ] Transformed 6003 places.
[2022-05-19 08:21:56] [INFO ] Transformed 5903 transitions.
[2022-05-19 08:21:56] [INFO ] Found NUPN structural information;
[2022-05-19 08:21:56] [INFO ] Parsed PT model containing 6003 places and 5903 transitions in 620 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 694 places :
Symmetric choice reduction at 0 with 694 rule applications. Total rules 694 place count 5309 transition count 5209
Iterating global reduction 0 with 694 rules applied. Total rules applied 1388 place count 5309 transition count 5209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1389 place count 5308 transition count 5208
Iterating global reduction 0 with 1 rules applied. Total rules applied 1390 place count 5308 transition count 5208
Applied a total of 1390 rules in 1904 ms. Remains 5308 /6003 variables (removed 695) and now considering 5208/5903 (removed 695) transitions.
// Phase 1: matrix 5208 rows 5308 cols
[2022-05-19 08:21:58] [INFO ] Computed 901 place invariants in 66 ms
[2022-05-19 08:22:00] [INFO ] Implicit Places using invariants in 1907 ms returned []
// Phase 1: matrix 5208 rows 5308 cols
[2022-05-19 08:22:00] [INFO ] Computed 901 place invariants in 27 ms
[2022-05-19 08:22:02] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 3685 ms to find 0 implicit places.
// Phase 1: matrix 5208 rows 5308 cols
[2022-05-19 08:22:02] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:22:05] [INFO ] Dead Transitions using invariants and state equation in 3420 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5308/6003 places, 5208/5903 transitions.
Finished structural reductions, in 1 iterations. Remains : 5308/6003 places, 5208/5903 transitions.
Support contains 32 out of 5308 places after structural reductions.
[2022-05-19 08:22:06] [INFO ] Flatten gal took : 397 ms
[2022-05-19 08:22:06] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 08:22:06] [INFO ] Flatten gal took : 232 ms
[2022-05-19 08:22:06] [INFO ] Input system was already deterministic with 5208 transitions.
Support contains 27 out of 5308 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 5208 rows 5308 cols
[2022-05-19 08:22:07] [INFO ] Computed 901 place invariants in 19 ms
[2022-05-19 08:22:09] [INFO ] [Real]Absence check using 901 positive place invariants in 528 ms returned sat
[2022-05-19 08:22:09] [INFO ] After 1729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 08:22:10] [INFO ] [Nat]Absence check using 901 positive place invariants in 537 ms returned sat
[2022-05-19 08:22:16] [INFO ] After 4884ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 08:22:18] [INFO ] Deduced a trap composed of 23 places in 1895 ms of which 9 ms to minimize.
[2022-05-19 08:22:20] [INFO ] Deduced a trap composed of 24 places in 1821 ms of which 5 ms to minimize.
[2022-05-19 08:22:22] [INFO ] Deduced a trap composed of 18 places in 1870 ms of which 6 ms to minimize.
[2022-05-19 08:22:24] [INFO ] Deduced a trap composed of 24 places in 1876 ms of which 3 ms to minimize.
[2022-05-19 08:22:26] [INFO ] Deduced a trap composed of 31 places in 1878 ms of which 3 ms to minimize.
[2022-05-19 08:22:28] [INFO ] Deduced a trap composed of 28 places in 1788 ms of which 3 ms to minimize.
[2022-05-19 08:22:30] [INFO ] Deduced a trap composed of 36 places in 1782 ms of which 3 ms to minimize.
[2022-05-19 08:22:32] [INFO ] Deduced a trap composed of 17 places in 1843 ms of which 3 ms to minimize.
[2022-05-19 08:22:34] [INFO ] Deduced a trap composed of 17 places in 1754 ms of which 3 ms to minimize.
[2022-05-19 08:22:36] [INFO ] Deduced a trap composed of 16 places in 1788 ms of which 3 ms to minimize.
[2022-05-19 08:22:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 08:22:36] [INFO ] After 26852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 1 properties in 1228 ms.
Support contains 13 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Drop transitions removed 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 498 rules applied. Total rules applied 498 place count 5308 transition count 4710
Reduce places removed 498 places and 0 transitions.
Iterating post reduction 1 with 498 rules applied. Total rules applied 996 place count 4810 transition count 4710
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 996 place count 4810 transition count 4210
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1996 place count 4310 transition count 4210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1999 place count 4307 transition count 4207
Iterating global reduction 2 with 3 rules applied. Total rules applied 2002 place count 4307 transition count 4207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2002 place count 4307 transition count 4206
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2004 place count 4306 transition count 4206
Performed 1789 Post agglomeration using F-continuation condition.Transition count delta: 1789
Deduced a syphon composed of 1789 places in 48 ms
Reduce places removed 1789 places and 0 transitions.
Iterating global reduction 2 with 3578 rules applied. Total rules applied 5582 place count 2517 transition count 2417
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 693 times.
Drop transitions removed 693 transitions
Iterating global reduction 2 with 693 rules applied. Total rules applied 6275 place count 2517 transition count 2417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6276 place count 2516 transition count 2416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6277 place count 2515 transition count 2416
Applied a total of 6277 rules in 1822 ms. Remains 2515 /5308 variables (removed 2793) and now considering 2416/5208 (removed 2792) transitions.
Finished structural reductions, in 1 iterations. Remains : 2515/5308 places, 2416/5208 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2416 rows 2515 cols
[2022-05-19 08:22:40] [INFO ] Computed 900 place invariants in 203 ms
[2022-05-19 08:22:40] [INFO ] [Real]Absence check using 898 positive place invariants in 149 ms returned sat
[2022-05-19 08:22:40] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 08:22:40] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 08:22:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 165 ms returned sat
[2022-05-19 08:22:41] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 08:22:42] [INFO ] After 1448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 08:22:43] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2022-05-19 08:22:43] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2022-05-19 08:22:43] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-19 08:22:43] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-05-19 08:22:43] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-19 08:22:44] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2022-05-19 08:22:44] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-05-19 08:22:44] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2022-05-19 08:22:44] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2022-05-19 08:22:44] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2022-05-19 08:22:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-05-19 08:22:44] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2022-05-19 08:22:45] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2022-05-19 08:22:45] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2022-05-19 08:22:45] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2022-05-19 08:22:45] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2451 ms
[2022-05-19 08:22:45] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2022-05-19 08:22:46] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2022-05-19 08:22:46] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2022-05-19 08:22:46] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2022-05-19 08:22:47] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2022-05-19 08:22:47] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 0 ms to minimize.
[2022-05-19 08:22:47] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 0 ms to minimize.
[2022-05-19 08:22:48] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2022-05-19 08:22:48] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 5 ms to minimize.
[2022-05-19 08:22:48] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2022-05-19 08:22:49] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2022-05-19 08:22:49] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2022-05-19 08:22:49] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2022-05-19 08:22:50] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2022-05-19 08:22:50] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2022-05-19 08:22:50] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2022-05-19 08:22:50] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2022-05-19 08:22:50] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5401 ms
[2022-05-19 08:22:51] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2022-05-19 08:22:51] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2022-05-19 08:22:51] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-19 08:22:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 515 ms
[2022-05-19 08:22:51] [INFO ] After 10077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 269 ms.
[2022-05-19 08:22:51] [INFO ] After 10949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 220 ms.
Support contains 8 out of 2515 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2515/2515 places, 2416/2416 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2515 transition count 2415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2514 transition count 2415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 2514 transition count 2414
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2513 transition count 2414
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 2509 transition count 2410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 2508 transition count 2409
Applied a total of 13 rules in 247 ms. Remains 2508 /2515 variables (removed 7) and now considering 2409/2416 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 2508/2515 places, 2409/2416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2409 rows 2508 cols
[2022-05-19 08:22:52] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:22:53] [INFO ] [Real]Absence check using 898 positive place invariants in 161 ms returned sat
[2022-05-19 08:22:53] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 08:22:53] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 08:22:53] [INFO ] [Nat]Absence check using 898 positive place invariants in 172 ms returned sat
[2022-05-19 08:22:53] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 08:22:55] [INFO ] After 1492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 08:22:55] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2022-05-19 08:22:55] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2022-05-19 08:22:55] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-19 08:22:56] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:22:56] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2022-05-19 08:22:56] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2022-05-19 08:22:56] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2022-05-19 08:22:56] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2022-05-19 08:22:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1419 ms
[2022-05-19 08:22:57] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2022-05-19 08:22:57] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 4 ms to minimize.
[2022-05-19 08:22:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2022-05-19 08:22:57] [INFO ] After 3461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 231 ms.
[2022-05-19 08:22:57] [INFO ] After 4225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 138 ms.
Support contains 6 out of 2508 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2508/2508 places, 2409/2409 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 2506 transition count 2407
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 2506 transition count 2407
Applied a total of 6 rules in 208 ms. Remains 2506 /2508 variables (removed 2) and now considering 2407/2409 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2506/2508 places, 2407/2409 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 114707 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{0=1}
Probabilistic random walk after 114707 steps, saw 112813 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2407 rows 2506 cols
[2022-05-19 08:23:01] [INFO ] Computed 900 place invariants in 17 ms
[2022-05-19 08:23:01] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:23:02] [INFO ] [Nat]Absence check using 899 positive place invariants in 162 ms returned sat
[2022-05-19 08:23:02] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:23:03] [INFO ] After 1376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:23:03] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2022-05-19 08:23:04] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2022-05-19 08:23:04] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2022-05-19 08:23:04] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2022-05-19 08:23:04] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2022-05-19 08:23:04] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2022-05-19 08:23:05] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2022-05-19 08:23:05] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2022-05-19 08:23:05] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2022-05-19 08:23:05] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:23:05] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2022-05-19 08:23:06] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2022-05-19 08:23:06] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2022-05-19 08:23:06] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-19 08:23:06] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-19 08:23:06] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3125 ms
[2022-05-19 08:23:06] [INFO ] After 4595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-19 08:23:06] [INFO ] After 5154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 2506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2505 transition count 2406
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 2505 transition count 2406
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2504 transition count 2405
Applied a total of 4 rules in 285 ms. Remains 2504 /2506 variables (removed 2) and now considering 2405/2407 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2506 places, 2405/2407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 150032 steps, run timeout after 3002 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 150032 steps, saw 147799 distinct states, run finished after 3003 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:23:10] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:23:10] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:23:11] [INFO ] [Nat]Absence check using 899 positive place invariants in 161 ms returned sat
[2022-05-19 08:23:11] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-19 08:23:12] [INFO ] After 1230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:23:12] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2022-05-19 08:23:12] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2022-05-19 08:23:12] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2022-05-19 08:23:13] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2022-05-19 08:23:13] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2022-05-19 08:23:13] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2022-05-19 08:23:13] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:23:13] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2022-05-19 08:23:14] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2022-05-19 08:23:14] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-19 08:23:14] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-19 08:23:14] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-05-19 08:23:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2250 ms
[2022-05-19 08:23:14] [INFO ] After 3553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-05-19 08:23:14] [INFO ] After 4055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 2504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 68 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 70 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:23:14] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 08:23:16] [INFO ] Implicit Places using invariants in 1638 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:23:16] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 08:23:20] [INFO ] Implicit Places using invariants and state equation in 4025 ms returned []
Implicit Place search using SMT with State Equation took 5665 ms to find 0 implicit places.
[2022-05-19 08:23:20] [INFO ] Redundant transitions in 175 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:23:20] [INFO ] Computed 900 place invariants in 20 ms
[2022-05-19 08:23:22] [INFO ] Dead Transitions using invariants and state equation in 1430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 70 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:23:22] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:23:22] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:23:23] [INFO ] [Nat]Absence check using 899 positive place invariants in 163 ms returned sat
[2022-05-19 08:23:23] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:23:24] [INFO ] After 1255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:23:24] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2022-05-19 08:23:24] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2022-05-19 08:23:24] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2022-05-19 08:23:25] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2022-05-19 08:23:25] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2022-05-19 08:23:25] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2022-05-19 08:23:25] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2022-05-19 08:23:25] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2022-05-19 08:23:26] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2022-05-19 08:23:26] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-19 08:23:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-19 08:23:26] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-19 08:23:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2283 ms
[2022-05-19 08:23:26] [INFO ] After 3616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-19 08:23:26] [INFO ] After 4160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldIIPs-PT-100B-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1201 stabilizing places and 1201 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(p0)))))'
Support contains 2 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5307 transition count 4706
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4806 transition count 4706
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1002 place count 4806 transition count 4206
Deduced a syphon composed of 500 places in 18 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2002 place count 4306 transition count 4206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2007 place count 4301 transition count 4201
Iterating global reduction 2 with 5 rules applied. Total rules applied 2012 place count 4301 transition count 4201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2012 place count 4301 transition count 4200
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2014 place count 4300 transition count 4200
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 11 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5606 place count 2504 transition count 2404
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5608 place count 2502 transition count 2402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5609 place count 2501 transition count 2402
Applied a total of 5609 rules in 1160 ms. Remains 2501 /5308 variables (removed 2807) and now considering 2402/5208 (removed 2806) transitions.
// Phase 1: matrix 2402 rows 2501 cols
[2022-05-19 08:23:28] [INFO ] Computed 900 place invariants in 9 ms
[2022-05-19 08:23:29] [INFO ] Implicit Places using invariants in 1274 ms returned []
// Phase 1: matrix 2402 rows 2501 cols
[2022-05-19 08:23:29] [INFO ] Computed 900 place invariants in 14 ms
[2022-05-19 08:23:32] [INFO ] Implicit Places using invariants and state equation in 3206 ms returned []
Implicit Place search using SMT with State Equation took 4482 ms to find 0 implicit places.
[2022-05-19 08:23:33] [INFO ] Redundant transitions in 786 ms returned [2401]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:23:33] [INFO ] Computed 900 place invariants in 3 ms
[2022-05-19 08:23:34] [INFO ] Dead Transitions using invariants and state equation in 1371 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/5308 places, 2401/5208 transitions.
Applied a total of 0 rules in 79 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/5308 places, 2401/5208 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1668 0) (EQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5126 steps with 0 reset in 122 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-01 finished in 8239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5307 transition count 4706
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4806 transition count 4706
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4806 transition count 4205
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4305 transition count 4205
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2009 place count 4300 transition count 4200
Iterating global reduction 2 with 5 rules applied. Total rules applied 2014 place count 4300 transition count 4200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2014 place count 4300 transition count 4199
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2016 place count 4299 transition count 4199
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5604 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5606 place count 2503 transition count 2403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5607 place count 2502 transition count 2403
Applied a total of 5607 rules in 1144 ms. Remains 2502 /5308 variables (removed 2806) and now considering 2403/5208 (removed 2805) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:23:36] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 08:23:37] [INFO ] Implicit Places using invariants in 1364 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:23:37] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:23:41] [INFO ] Implicit Places using invariants and state equation in 3210 ms returned []
Implicit Place search using SMT with State Equation took 4576 ms to find 0 implicit places.
[2022-05-19 08:23:41] [INFO ] Redundant transitions in 243 ms returned [2402]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:23:41] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:23:42] [INFO ] Dead Transitions using invariants and state equation in 1354 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2502/5308 places, 2402/5208 transitions.
Applied a total of 0 rules in 75 ms. Remains 2502 /2502 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2502/5308 places, 2402/5208 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1204 0) (NEQ s422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5002 steps with 0 reset in 97 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-02 finished in 7566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(G(F(p0))))))))'
Support contains 2 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5307 transition count 4706
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4806 transition count 4706
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4806 transition count 4205
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4305 transition count 4205
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2010 place count 4299 transition count 4199
Iterating global reduction 2 with 6 rules applied. Total rules applied 2016 place count 4299 transition count 4199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2016 place count 4299 transition count 4198
Deduced a syphon composed of 1 places in 34 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2018 place count 4298 transition count 4198
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5606 place count 2504 transition count 2404
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5608 place count 2502 transition count 2402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5609 place count 2501 transition count 2402
Applied a total of 5609 rules in 1094 ms. Remains 2501 /5308 variables (removed 2807) and now considering 2402/5208 (removed 2806) transitions.
// Phase 1: matrix 2402 rows 2501 cols
[2022-05-19 08:23:43] [INFO ] Computed 900 place invariants in 12 ms
[2022-05-19 08:23:45] [INFO ] Implicit Places using invariants in 1380 ms returned []
// Phase 1: matrix 2402 rows 2501 cols
[2022-05-19 08:23:45] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:23:48] [INFO ] Implicit Places using invariants and state equation in 3049 ms returned []
Implicit Place search using SMT with State Equation took 4434 ms to find 0 implicit places.
[2022-05-19 08:23:48] [INFO ] Redundant transitions in 363 ms returned [2401]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:23:48] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:23:50] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/5308 places, 2401/5208 transitions.
Applied a total of 0 rules in 85 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/5308 places, 2401/5208 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2382 0) (EQ s1389 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4983 steps with 0 reset in 82 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-09 finished in 7548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(!p1)&&p1)))'
Support contains 4 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5307 transition count 4707
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4807 transition count 4707
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1000 place count 4807 transition count 4206
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2002 place count 4306 transition count 4206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2007 place count 4301 transition count 4201
Iterating global reduction 2 with 5 rules applied. Total rules applied 2012 place count 4301 transition count 4201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2012 place count 4301 transition count 4200
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2014 place count 4300 transition count 4200
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 11 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5600 place count 2507 transition count 2407
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5602 place count 2505 transition count 2405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5603 place count 2504 transition count 2405
Applied a total of 5603 rules in 1047 ms. Remains 2504 /5308 variables (removed 2804) and now considering 2405/5208 (removed 2803) transitions.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:23:51] [INFO ] Computed 900 place invariants in 9 ms
[2022-05-19 08:23:52] [INFO ] Implicit Places using invariants in 1274 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:23:52] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:23:56] [INFO ] Implicit Places using invariants and state equation in 3252 ms returned []
Implicit Place search using SMT with State Equation took 4529 ms to find 0 implicit places.
[2022-05-19 08:23:56] [INFO ] Redundant transitions in 252 ms returned [2404]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2404 rows 2504 cols
[2022-05-19 08:23:56] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:23:57] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2504/5308 places, 2404/5208 transitions.
Applied a total of 0 rules in 80 ms. Remains 2504 /2504 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2504/5308 places, 2404/5208 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, true, p1]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1867 0) (EQ s553 1)), p0:(OR (EQ s980 0) (EQ s1450 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, null, null][true, true, true]]
Product exploration explored 100000 steps with 90 reset in 1449 ms.
Product exploration explored 100000 steps with 91 reset in 1760 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 276 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
Finished random walk after 961 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 251 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[p1]
Stuttering acceptance computed with spot in 35 ms :[p1]
// Phase 1: matrix 2404 rows 2504 cols
[2022-05-19 08:24:01] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:24:05] [INFO ] [Real]Absence check using 900 positive place invariants in 977 ms returned sat
[2022-05-19 08:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:24:16] [INFO ] [Real]Absence check using state equation in 11397 ms returned unknown
Could not prove EG p1
Support contains 2 out of 2504 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 : 2504/2504 places, 2404/2404 transitions.
Applied a total of 0 rules in 83 ms. Remains 2504 /2504 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
// Phase 1: matrix 2404 rows 2504 cols
[2022-05-19 08:24:16] [INFO ] Computed 900 place invariants in 6 ms
[2022-05-19 08:24:18] [INFO ] Implicit Places using invariants in 1243 ms returned []
// Phase 1: matrix 2404 rows 2504 cols
[2022-05-19 08:24:18] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:24:21] [INFO ] Implicit Places using invariants and state equation in 3323 ms returned []
Implicit Place search using SMT with State Equation took 4567 ms to find 0 implicit places.
[2022-05-19 08:24:21] [INFO ] Redundant transitions in 418 ms returned []
// Phase 1: matrix 2404 rows 2504 cols
[2022-05-19 08:24:21] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:24:23] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2404/2404 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p1]
Finished random walk after 1101 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=64 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[p1]
Stuttering acceptance computed with spot in 24 ms :[p1]
// Phase 1: matrix 2404 rows 2504 cols
[2022-05-19 08:24:23] [INFO ] Computed 900 place invariants in 6 ms
[2022-05-19 08:24:27] [INFO ] [Real]Absence check using 900 positive place invariants in 964 ms returned sat
[2022-05-19 08:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:24:38] [INFO ] [Real]Absence check using state equation in 11438 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 123 ms :[p1]
Product exploration explored 100000 steps with 91 reset in 1403 ms.
Product exploration explored 100000 steps with 91 reset in 1742 ms.
Built C files in :
/tmp/ltsmin12923228179978893301
[2022-05-19 08:24:42] [INFO ] Too many transitions (2404) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:24:42] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12923228179978893301
Running compilation step : cd /tmp/ltsmin12923228179978893301;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12923228179978893301;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12923228179978893301;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2504/2504 places, 2404/2404 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 2501 transition count 2401
Applied a total of 3 rules in 221 ms. Remains 2501 /2504 variables (removed 3) and now considering 2401/2404 (removed 3) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:24:45] [INFO ] Computed 900 place invariants in 17 ms
[2022-05-19 08:24:46] [INFO ] Implicit Places using invariants in 1348 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:24:46] [INFO ] Computed 900 place invariants in 31 ms
[2022-05-19 08:24:49] [INFO ] Implicit Places using invariants and state equation in 3093 ms returned []
Implicit Place search using SMT with State Equation took 4443 ms to find 0 implicit places.
[2022-05-19 08:24:50] [INFO ] Redundant transitions in 234 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:24:50] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:24:51] [INFO ] Dead Transitions using invariants and state equation in 1343 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2504 places, 2401/2404 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2504 places, 2401/2404 transitions.
Built C files in :
/tmp/ltsmin2925972714914069860
[2022-05-19 08:24:51] [INFO ] Too many transitions (2401) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:24:51] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2925972714914069860
Running compilation step : cd /tmp/ltsmin2925972714914069860;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2925972714914069860;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2925972714914069860;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 08:24:54] [INFO ] Flatten gal took : 108 ms
[2022-05-19 08:24:54] [INFO ] Flatten gal took : 108 ms
[2022-05-19 08:24:54] [INFO ] Time to serialize gal into /tmp/LTL14626318249627578382.gal : 19 ms
[2022-05-19 08:24:55] [INFO ] Time to serialize properties into /tmp/LTL17392430066123952990.ltl : 254 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14626318249627578382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17392430066123952990.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1462631...268
Read 1 LTL properties
Checking formula 0 : !((("((p2409==0)||(p3507==1))")U((F(!("((p4492==0)||(p1402==1))")))&&("((p4492==0)||(p1402==1))"))))
Formula 0 simplified : !("((p2409==0)||(p3507==1))" U ("((p4492==0)||(p1402==1))" & F!"((p4492==0)||(p1402==1))"))
Detected timeout of ITS tools.
[2022-05-19 08:25:10] [INFO ] Flatten gal took : 97 ms
[2022-05-19 08:25:10] [INFO ] Applying decomposition
[2022-05-19 08:25:10] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14255361997213732632.txt' '-o' '/tmp/graph14255361997213732632.bin' '-w' '/tmp/graph14255361997213732632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14255361997213732632.bin' '-l' '-1' '-v' '-w' '/tmp/graph14255361997213732632.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:25:10] [INFO ] Decomposing Gal with order
[2022-05-19 08:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:25:11] [INFO ] Removed a total of 1595 redundant transitions.
[2022-05-19 08:25:11] [INFO ] Flatten gal took : 878 ms
[2022-05-19 08:25:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1528 labels/synchronizations in 47 ms.
[2022-05-19 08:25:12] [INFO ] Time to serialize gal into /tmp/LTL2778216950123783208.gal : 30 ms
[2022-05-19 08:25:12] [INFO ] Time to serialize properties into /tmp/LTL500032806189491280.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2778216950123783208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL500032806189491280.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2778216...244
Read 1 LTL properties
Checking formula 0 : !((("((i16.i0.i0.u353.p2409==0)||(i23.i1.i2.u523.p3507==1))")U((F(!("((i31.i0.i1.u673.p4492==0)||(i8.u199.p1402==1))")))&&("((i31.i0.i...197
Formula 0 simplified : !("((i16.i0.i0.u353.p2409==0)||(i23.i1.i2.u523.p3507==1))" U ("((i31.i0.i1.u673.p4492==0)||(i8.u199.p1402==1))" & F!"((i31.i0.i1.u67...190
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14647960888780530206
[2022-05-19 08:25:27] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14647960888780530206
Running compilation step : cd /tmp/ltsmin14647960888780530206;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14647960888780530206;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14647960888780530206;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-10 finished in 99792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&p1))))'
Support contains 4 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5303 transition count 5203
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5303 transition count 5203
Applied a total of 10 rules in 837 ms. Remains 5303 /5308 variables (removed 5) and now considering 5203/5208 (removed 5) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:25:31] [INFO ] Computed 901 place invariants in 26 ms
[2022-05-19 08:25:32] [INFO ] Implicit Places using invariants in 1706 ms returned []
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:25:32] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 08:25:34] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 3427 ms to find 0 implicit places.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:25:34] [INFO ] Computed 901 place invariants in 28 ms
[2022-05-19 08:25:37] [INFO ] Dead Transitions using invariants and state equation in 3254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5308 places, 5203/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5303/5308 places, 5203/5208 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s4407 1) (OR (EQ s4223 0) (EQ s138 1))), p1:(EQ s3377 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 16737 steps with 1 reset in 252 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-11 finished in 7937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U X((G(p1) U p2))))'
Support contains 6 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5303 transition count 5203
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5303 transition count 5203
Applied a total of 10 rules in 830 ms. Remains 5303 /5308 variables (removed 5) and now considering 5203/5208 (removed 5) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:25:39] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 08:25:40] [INFO ] Implicit Places using invariants in 1720 ms returned []
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:25:40] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 08:25:42] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 3389 ms to find 0 implicit places.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:25:42] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 08:25:45] [INFO ] Dead Transitions using invariants and state equation in 3345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5308 places, 5203/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5303/5308 places, 5203/5208 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s4442 0) (EQ s3168 1)), p0:(OR (EQ s3180 0) (EQ s5297 1)), p1:(OR (EQ s4442 0) (EQ s3168 1) (EQ s687 0) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2433 ms.
Product exploration explored 100000 steps with 50000 reset in 2418 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X p1)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1 (NOT p0))))
Knowledge based reduction with 20 factoid took 452 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-12 finished in 13255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(X(p1))&&X(p2)&&p0))))'
Support contains 6 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5303 transition count 5203
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5303 transition count 5203
Applied a total of 10 rules in 817 ms. Remains 5303 /5308 variables (removed 5) and now considering 5203/5208 (removed 5) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:25:52] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:25:53] [INFO ] Implicit Places using invariants in 1754 ms returned []
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:25:54] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 08:25:55] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 3425 ms to find 0 implicit places.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:25:55] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 08:25:58] [INFO ] Dead Transitions using invariants and state equation in 3330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5308 places, 5203/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5303/5308 places, 5203/5208 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (AND p0 (NOT p2)) (AND (NOT p1) p2)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3061 0) (EQ s1930 1)), p2:(AND (EQ s1756 0) (EQ s992 1)), p1:(AND (EQ s2104 0) (EQ s2266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-15 finished in 7820 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(!p1)&&p1)))'
[2022-05-19 08:25:59] [INFO ] Flatten gal took : 163 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7251785663677536690
[2022-05-19 08:25:59] [INFO ] Too many transitions (5208) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:25:59] [INFO ] Applying decomposition
[2022-05-19 08:25:59] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7251785663677536690
Running compilation step : cd /tmp/ltsmin7251785663677536690;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 08:25:59] [INFO ] Flatten gal took : 167 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12769238711298194352.txt' '-o' '/tmp/graph12769238711298194352.bin' '-w' '/tmp/graph12769238711298194352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12769238711298194352.bin' '-l' '-1' '-v' '-w' '/tmp/graph12769238711298194352.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:26:00] [INFO ] Decomposing Gal with order
[2022-05-19 08:26:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:26:01] [INFO ] Removed a total of 2300 redundant transitions.
[2022-05-19 08:26:01] [INFO ] Flatten gal took : 269 ms
[2022-05-19 08:26:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2022-05-19 08:26:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality3780274767323783362.gal : 41 ms
[2022-05-19 08:26:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality1616441966153604934.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3780274767323783362.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1616441966153604934.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 1 LTL properties
Checking formula 0 : !((("((i27.u806.p2409==0)||(i38.i0.i6.u1174.p3507==1))")U((F(!("((i49.i0.i6.u1505.p4492==0)||(i16.i0.i0.u470.p1402==1))")))&&("((i49.i...208
Formula 0 simplified : !("((i27.u806.p2409==0)||(i38.i0.i6.u1174.p3507==1))" U ("((i49.i0.i6.u1505.p4492==0)||(i16.i0.i0.u470.p1402==1))" & F!"((i49.i0.i6....201
Compilation finished in 18897 ms.
Running link step : cd /tmp/ltsmin7251785663677536690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin7251785663677536690;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((LTLAPp0==true) U (<>(!(LTLAPp1==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 08:47:23] [INFO ] Applying decomposition
[2022-05-19 08:47:24] [INFO ] Flatten gal took : 324 ms
[2022-05-19 08:47:24] [INFO ] Decomposing Gal with order
[2022-05-19 08:47:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:47:29] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 08:47:29] [INFO ] Flatten gal took : 568 ms
[2022-05-19 08:47:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2000 labels/synchronizations in 285 ms.
[2022-05-19 08:47:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality178405909611975359.gal : 70 ms
[2022-05-19 08:47:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality18002559340266662420.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality178405909611975359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18002559340266662420.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 1 LTL properties
Checking formula 0 : !((("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...1132
Formula 0 simplified : !("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...1125
Detected timeout of ITS tools.
[2022-05-19 09:09:12] [INFO ] Flatten gal took : 1246 ms
[2022-05-19 09:09:20] [INFO ] Input system was already deterministic with 5208 transitions.
[2022-05-19 09:09:21] [INFO ] Transformed 5308 places.
[2022-05-19 09:09:21] [INFO ] Transformed 5208 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-19 09:09:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality3882267499845029563.gal : 98 ms
[2022-05-19 09:09:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality3880312505541006535.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3882267499845029563.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3880312505541006535.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((("((p2409==0)||(p3507==1))")U((F(!("((p4492==0)||(p1402==1))")))&&("((p4492==0)||(p1402==1))"))))
Formula 0 simplified : !("((p2409==0)||(p3507==1))" U ("((p4492==0)||(p1402==1))" & F!"((p4492==0)||(p1402==1))"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldIIPs-PT-100B"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286024800171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-PT-100B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;