Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 868K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679269011692

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:36:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 23:36:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:36:54] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-19 23:36:54] [INFO ] Transformed 2503 places.
[2023-03-19 23:36:54] [INFO ] Transformed 2403 transitions.
[2023-03-19 23:36:54] [INFO ] Found NUPN structural information;
[2023-03-19 23:36:54] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 313 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:36:55] [INFO ] Computed 901 place invariants in 34 ms
[2023-03-19 23:36:56] [INFO ] Implicit Places using invariants in 696 ms returned []
[2023-03-19 23:36:56] [INFO ] Invariant cache hit.
[2023-03-19 23:36:59] [INFO ] Implicit Places using invariants and state equation in 3301 ms returned []
Implicit Place search using SMT with State Equation took 4029 ms to find 0 implicit places.
[2023-03-19 23:36:59] [INFO ] Invariant cache hit.
[2023-03-19 23:37:02] [INFO ] Dead Transitions using invariants and state equation in 2918 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7277 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Support contains 30 out of 2503 places after structural reductions.
[2023-03-19 23:37:03] [INFO ] Flatten gal took : 356 ms
[2023-03-19 23:37:03] [INFO ] Flatten gal took : 244 ms
[2023-03-19 23:37:03] [INFO ] Input system was already deterministic with 2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 23:37:05] [INFO ] Invariant cache hit.
[2023-03-19 23:37:06] [INFO ] After 911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:37:08] [INFO ] [Nat]Absence check using 901 positive place invariants in 410 ms returned sat
[2023-03-19 23:37:10] [INFO ] After 2496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:37:11] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 2 ms to minimize.
[2023-03-19 23:37:11] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2023-03-19 23:37:11] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 3 ms to minimize.
[2023-03-19 23:37:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 857 ms
[2023-03-19 23:37:12] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-19 23:37:12] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-19 23:37:12] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 26 ms to minimize.
[2023-03-19 23:37:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1013 ms
[2023-03-19 23:37:14] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-19 23:37:14] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2023-03-19 23:37:15] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 29 ms to minimize.
[2023-03-19 23:37:15] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-19 23:37:15] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2023-03-19 23:37:15] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-19 23:37:16] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 0 ms to minimize.
[2023-03-19 23:37:16] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-19 23:37:16] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-19 23:37:16] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2023-03-19 23:37:17] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-19 23:37:17] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2023-03-19 23:37:17] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2023-03-19 23:37:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3322 ms
[2023-03-19 23:37:17] [INFO ] After 9063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1042 ms.
[2023-03-19 23:37:18] [INFO ] After 11748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 2055 ms.
Support contains 15 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 685 times.
Drop transitions removed 685 transitions
Iterating global reduction 0 with 685 rules applied. Total rules applied 689 place count 2501 transition count 2401
Applied a total of 689 rules in 408 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 70449 steps, run timeout after 3005 ms. (steps per millisecond=23 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 70449 steps, saw 69232 distinct states, run finished after 3009 ms. (steps per millisecond=23 ) properties seen :3
Running SMT prover for 4 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:37:25] [INFO ] Computed 901 place invariants in 121 ms
[2023-03-19 23:37:26] [INFO ] [Real]Absence check using 896 positive place invariants in 317 ms returned sat
[2023-03-19 23:37:26] [INFO ] [Real]Absence check using 896 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-19 23:37:29] [INFO ] After 2622ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-19 23:37:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:37:29] [INFO ] After 153ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:37:29] [INFO ] After 3936ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:37:30] [INFO ] [Nat]Absence check using 896 positive place invariants in 188 ms returned sat
[2023-03-19 23:37:30] [INFO ] [Nat]Absence check using 896 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-19 23:37:33] [INFO ] After 2516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:37:33] [INFO ] After 438ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 23:37:34] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
[2023-03-19 23:37:34] [INFO ] Deduced a trap composed of 18 places in 391 ms of which 0 ms to minimize.
[2023-03-19 23:37:35] [INFO ] Deduced a trap composed of 6 places in 471 ms of which 0 ms to minimize.
[2023-03-19 23:37:35] [INFO ] Deduced a trap composed of 19 places in 432 ms of which 1 ms to minimize.
[2023-03-19 23:37:36] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 1 ms to minimize.
[2023-03-19 23:37:36] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 0 ms to minimize.
[2023-03-19 23:37:37] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 1 ms to minimize.
[2023-03-19 23:37:37] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 0 ms to minimize.
[2023-03-19 23:37:37] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 0 ms to minimize.
[2023-03-19 23:37:38] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 1 ms to minimize.
[2023-03-19 23:37:38] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-19 23:37:38] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 1 ms to minimize.
[2023-03-19 23:37:39] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 4 ms to minimize.
[2023-03-19 23:37:39] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 0 ms to minimize.
[2023-03-19 23:37:39] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 0 ms to minimize.
[2023-03-19 23:37:40] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 0 ms to minimize.
[2023-03-19 23:37:40] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2023-03-19 23:37:40] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-19 23:37:41] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-19 23:37:41] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2023-03-19 23:37:41] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 1 ms to minimize.
[2023-03-19 23:37:42] [INFO ] Deduced a trap composed of 9 places in 446 ms of which 9 ms to minimize.
[2023-03-19 23:37:42] [INFO ] Deduced a trap composed of 18 places in 326 ms of which 0 ms to minimize.
[2023-03-19 23:37:43] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 0 ms to minimize.
[2023-03-19 23:37:44] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
[2023-03-19 23:37:44] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2023-03-19 23:37:44] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2023-03-19 23:37:45] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 4 ms to minimize.
[2023-03-19 23:37:45] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 0 ms to minimize.
[2023-03-19 23:37:45] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 13 ms to minimize.
[2023-03-19 23:37:46] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-19 23:37:46] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-19 23:37:46] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 13 ms to minimize.
[2023-03-19 23:37:46] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-19 23:37:47] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 4 ms to minimize.
[2023-03-19 23:37:47] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2023-03-19 23:37:47] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2023-03-19 23:37:48] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-19 23:37:48] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-19 23:37:48] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 0 ms to minimize.
[2023-03-19 23:37:48] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14828 ms
[2023-03-19 23:37:49] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
[2023-03-19 23:37:50] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 0 ms to minimize.
[2023-03-19 23:37:50] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 13 ms to minimize.
[2023-03-19 23:37:51] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2023-03-19 23:37:51] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 1 ms to minimize.
[2023-03-19 23:37:51] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 12 ms to minimize.
[2023-03-19 23:37:52] [INFO ] Deduced a trap composed of 6 places in 468 ms of which 25 ms to minimize.
[2023-03-19 23:37:52] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-19 23:37:53] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
[2023-03-19 23:37:53] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 21 ms to minimize.
[2023-03-19 23:37:54] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
[2023-03-19 23:37:54] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2023-03-19 23:37:54] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:37:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:37:54] [INFO ] After 25156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 984 ms.
Support contains 8 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 2501 transition count 2401
Applied a total of 7 rules in 198 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 76709 steps, run timeout after 3003 ms. (steps per millisecond=25 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 76709 steps, saw 75421 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:38:00] [INFO ] Computed 901 place invariants in 51 ms
[2023-03-19 23:38:00] [INFO ] [Real]Absence check using 900 positive place invariants in 261 ms returned sat
[2023-03-19 23:38:00] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 19 ms returned sat
[2023-03-19 23:38:02] [INFO ] After 2605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:38:03] [INFO ] [Nat]Absence check using 900 positive place invariants in 339 ms returned sat
[2023-03-19 23:38:03] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 23:38:05] [INFO ] After 1889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:38:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:38:06] [INFO ] After 314ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 23:38:06] [INFO ] Deduced a trap composed of 6 places in 496 ms of which 1 ms to minimize.
[2023-03-19 23:38:07] [INFO ] Deduced a trap composed of 5 places in 388 ms of which 1 ms to minimize.
[2023-03-19 23:38:07] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-19 23:38:07] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 0 ms to minimize.
[2023-03-19 23:38:08] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 0 ms to minimize.
[2023-03-19 23:38:08] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2023-03-19 23:38:08] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:38:08] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-19 23:38:09] [INFO ] Deduced a trap composed of 18 places in 321 ms of which 0 ms to minimize.
[2023-03-19 23:38:09] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2023-03-19 23:38:10] [INFO ] Deduced a trap composed of 12 places in 398 ms of which 0 ms to minimize.
[2023-03-19 23:38:10] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 0 ms to minimize.
[2023-03-19 23:38:10] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 0 ms to minimize.
[2023-03-19 23:38:11] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 0 ms to minimize.
[2023-03-19 23:38:11] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2023-03-19 23:38:11] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2023-03-19 23:38:12] [INFO ] Deduced a trap composed of 18 places in 387 ms of which 0 ms to minimize.
[2023-03-19 23:38:12] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 0 ms to minimize.
[2023-03-19 23:38:12] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 0 ms to minimize.
[2023-03-19 23:38:13] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 1 ms to minimize.
[2023-03-19 23:38:13] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7065 ms
[2023-03-19 23:38:13] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2023-03-19 23:38:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2023-03-19 23:38:13] [INFO ] After 8022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 252 ms.
[2023-03-19 23:38:13] [INFO ] After 11309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 565 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 238 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 85028 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85028 steps, saw 83648 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:38:18] [INFO ] Computed 901 place invariants in 17 ms
[2023-03-19 23:38:19] [INFO ] [Real]Absence check using 900 positive place invariants in 242 ms returned sat
[2023-03-19 23:38:19] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-19 23:38:20] [INFO ] After 2331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:38:21] [INFO ] [Nat]Absence check using 900 positive place invariants in 393 ms returned sat
[2023-03-19 23:38:21] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 23:38:23] [INFO ] After 1863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:38:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:38:23] [INFO ] After 379ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 23:38:24] [INFO ] Deduced a trap composed of 12 places in 439 ms of which 1 ms to minimize.
[2023-03-19 23:38:24] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 0 ms to minimize.
[2023-03-19 23:38:25] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
[2023-03-19 23:38:25] [INFO ] Deduced a trap composed of 6 places in 411 ms of which 1 ms to minimize.
[2023-03-19 23:38:26] [INFO ] Deduced a trap composed of 6 places in 410 ms of which 1 ms to minimize.
[2023-03-19 23:38:26] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 1 ms to minimize.
[2023-03-19 23:38:27] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 2 ms to minimize.
[2023-03-19 23:38:27] [INFO ] Deduced a trap composed of 12 places in 349 ms of which 1 ms to minimize.
[2023-03-19 23:38:27] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 1 ms to minimize.
[2023-03-19 23:38:28] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-19 23:38:28] [INFO ] Deduced a trap composed of 5 places in 431 ms of which 1 ms to minimize.
[2023-03-19 23:38:29] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 1 ms to minimize.
[2023-03-19 23:38:29] [INFO ] Deduced a trap composed of 9 places in 488 ms of which 0 ms to minimize.
[2023-03-19 23:38:30] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-19 23:38:30] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 0 ms to minimize.
[2023-03-19 23:38:30] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 1 ms to minimize.
[2023-03-19 23:38:31] [INFO ] Deduced a trap composed of 15 places in 453 ms of which 1 ms to minimize.
[2023-03-19 23:38:31] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 1 ms to minimize.
[2023-03-19 23:38:32] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2023-03-19 23:38:32] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 0 ms to minimize.
[2023-03-19 23:38:32] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 0 ms to minimize.
[2023-03-19 23:38:33] [INFO ] Deduced a trap composed of 18 places in 286 ms of which 0 ms to minimize.
[2023-03-19 23:38:33] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 0 ms to minimize.
[2023-03-19 23:38:33] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2023-03-19 23:38:33] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 0 ms to minimize.
[2023-03-19 23:38:34] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2023-03-19 23:38:34] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 0 ms to minimize.
[2023-03-19 23:38:34] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 2 ms to minimize.
[2023-03-19 23:38:34] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 0 ms to minimize.
[2023-03-19 23:38:35] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 0 ms to minimize.
[2023-03-19 23:38:35] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-19 23:38:35] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 1 ms to minimize.
[2023-03-19 23:38:36] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2023-03-19 23:38:36] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2023-03-19 23:38:36] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2023-03-19 23:38:36] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2023-03-19 23:38:36] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 1 ms to minimize.
[2023-03-19 23:38:37] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 13173 ms
[2023-03-19 23:38:37] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2023-03-19 23:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2023-03-19 23:38:37] [INFO ] After 14238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 329 ms.
[2023-03-19 23:38:38] [INFO ] After 17448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 490 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 110 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 107 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:38:38] [INFO ] Invariant cache hit.
[2023-03-19 23:38:42] [INFO ] Implicit Places using invariants in 3377 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3396 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 96 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3599 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 99359 steps, run timeout after 3002 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99359 steps, saw 97816 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:38:46] [INFO ] Computed 900 place invariants in 45 ms
[2023-03-19 23:38:47] [INFO ] [Real]Absence check using 899 positive place invariants in 346 ms returned sat
[2023-03-19 23:38:47] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 23:38:49] [INFO ] After 3163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:38:49] [INFO ] [Nat]Absence check using 899 positive place invariants in 209 ms returned sat
[2023-03-19 23:38:49] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 23:38:52] [INFO ] After 2102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:38:52] [INFO ] Deduced a trap composed of 5 places in 423 ms of which 0 ms to minimize.
[2023-03-19 23:38:53] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 1 ms to minimize.
[2023-03-19 23:38:53] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2023-03-19 23:38:54] [INFO ] Deduced a trap composed of 6 places in 577 ms of which 1 ms to minimize.
[2023-03-19 23:38:54] [INFO ] Deduced a trap composed of 6 places in 399 ms of which 1 ms to minimize.
[2023-03-19 23:38:55] [INFO ] Deduced a trap composed of 5 places in 415 ms of which 1 ms to minimize.
[2023-03-19 23:38:56] [INFO ] Deduced a trap composed of 5 places in 553 ms of which 28 ms to minimize.
[2023-03-19 23:38:56] [INFO ] Deduced a trap composed of 5 places in 364 ms of which 1 ms to minimize.
[2023-03-19 23:38:57] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 1 ms to minimize.
[2023-03-19 23:38:57] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2023-03-19 23:38:57] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 0 ms to minimize.
[2023-03-19 23:38:58] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 0 ms to minimize.
[2023-03-19 23:38:58] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 16 ms to minimize.
[2023-03-19 23:38:59] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2023-03-19 23:38:59] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 1 ms to minimize.
[2023-03-19 23:38:59] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 1 ms to minimize.
[2023-03-19 23:39:00] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2023-03-19 23:39:00] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 0 ms to minimize.
[2023-03-19 23:39:01] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 0 ms to minimize.
[2023-03-19 23:39:01] [INFO ] Deduced a trap composed of 8 places in 326 ms of which 1 ms to minimize.
[2023-03-19 23:39:01] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 1 ms to minimize.
[2023-03-19 23:39:02] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 0 ms to minimize.
[2023-03-19 23:39:02] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-19 23:39:02] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 1 ms to minimize.
[2023-03-19 23:39:03] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 2 ms to minimize.
[2023-03-19 23:39:03] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-19 23:39:03] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 11414 ms
[2023-03-19 23:39:04] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2023-03-19 23:39:04] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 0 ms to minimize.
[2023-03-19 23:39:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 742 ms
[2023-03-19 23:39:04] [INFO ] After 14524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-19 23:39:04] [INFO ] After 15706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 598 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 91 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 103 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:39:05] [INFO ] Invariant cache hit.
[2023-03-19 23:39:09] [INFO ] Implicit Places using invariants in 3665 ms returned []
[2023-03-19 23:39:09] [INFO ] Invariant cache hit.
[2023-03-19 23:39:15] [INFO ] Implicit Places using invariants and state equation in 6472 ms returned []
Implicit Place search using SMT with State Equation took 10158 ms to find 0 implicit places.
[2023-03-19 23:39:16] [INFO ] Redundant transitions in 192 ms returned []
[2023-03-19 23:39:16] [INFO ] Invariant cache hit.
[2023-03-19 23:39:18] [INFO ] Dead Transitions using invariants and state equation in 2661 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13132 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 16 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 240 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:39:19] [INFO ] Computed 901 place invariants in 14 ms
[2023-03-19 23:39:21] [INFO ] Implicit Places using invariants in 2027 ms returned []
[2023-03-19 23:39:21] [INFO ] Invariant cache hit.
[2023-03-19 23:39:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:39:28] [INFO ] Implicit Places using invariants and state equation in 6629 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8677 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 164 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9082 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s316 0) (EQ s1264 1) (AND (EQ s952 0) (EQ s2142 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19 reset in 1832 ms.
Product exploration explored 100000 steps with 19 reset in 2420 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93625 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93625 steps, saw 87497 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:39:36] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-19 23:39:37] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:39:37] [INFO ] [Nat]Absence check using 900 positive place invariants in 200 ms returned sat
[2023-03-19 23:39:40] [INFO ] After 1974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:39:40] [INFO ] Deduced a trap composed of 18 places in 479 ms of which 1 ms to minimize.
[2023-03-19 23:39:41] [INFO ] Deduced a trap composed of 24 places in 573 ms of which 1 ms to minimize.
[2023-03-19 23:39:41] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 1 ms to minimize.
[2023-03-19 23:39:42] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 1 ms to minimize.
[2023-03-19 23:39:42] [INFO ] Deduced a trap composed of 18 places in 422 ms of which 1 ms to minimize.
[2023-03-19 23:39:43] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 0 ms to minimize.
[2023-03-19 23:39:43] [INFO ] Deduced a trap composed of 30 places in 452 ms of which 1 ms to minimize.
[2023-03-19 23:39:44] [INFO ] Deduced a trap composed of 18 places in 422 ms of which 1 ms to minimize.
[2023-03-19 23:39:44] [INFO ] Deduced a trap composed of 18 places in 389 ms of which 0 ms to minimize.
[2023-03-19 23:39:45] [INFO ] Deduced a trap composed of 15 places in 439 ms of which 1 ms to minimize.
[2023-03-19 23:39:45] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 1 ms to minimize.
[2023-03-19 23:39:46] [INFO ] Deduced a trap composed of 18 places in 349 ms of which 1 ms to minimize.
[2023-03-19 23:39:46] [INFO ] Deduced a trap composed of 24 places in 567 ms of which 2 ms to minimize.
[2023-03-19 23:39:47] [INFO ] Deduced a trap composed of 18 places in 488 ms of which 6 ms to minimize.
[2023-03-19 23:39:47] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 1 ms to minimize.
[2023-03-19 23:39:48] [INFO ] Deduced a trap composed of 18 places in 432 ms of which 1 ms to minimize.
[2023-03-19 23:39:48] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 1 ms to minimize.
[2023-03-19 23:39:49] [INFO ] Deduced a trap composed of 18 places in 347 ms of which 1 ms to minimize.
[2023-03-19 23:39:49] [INFO ] Deduced a trap composed of 18 places in 493 ms of which 2 ms to minimize.
[2023-03-19 23:39:50] [INFO ] Deduced a trap composed of 15 places in 360 ms of which 1 ms to minimize.
[2023-03-19 23:39:50] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 0 ms to minimize.
[2023-03-19 23:39:51] [INFO ] Deduced a trap composed of 18 places in 506 ms of which 0 ms to minimize.
[2023-03-19 23:39:52] [INFO ] Deduced a trap composed of 18 places in 693 ms of which 1 ms to minimize.
[2023-03-19 23:39:52] [INFO ] Deduced a trap composed of 18 places in 474 ms of which 1 ms to minimize.
[2023-03-19 23:39:53] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 0 ms to minimize.
[2023-03-19 23:39:53] [INFO ] Deduced a trap composed of 21 places in 352 ms of which 0 ms to minimize.
[2023-03-19 23:39:54] [INFO ] Deduced a trap composed of 18 places in 390 ms of which 0 ms to minimize.
[2023-03-19 23:39:54] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 1 ms to minimize.
[2023-03-19 23:39:55] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 0 ms to minimize.
[2023-03-19 23:39:55] [INFO ] Deduced a trap composed of 30 places in 387 ms of which 0 ms to minimize.
[2023-03-19 23:39:56] [INFO ] Deduced a trap composed of 36 places in 394 ms of which 1 ms to minimize.
[2023-03-19 23:39:56] [INFO ] Deduced a trap composed of 9 places in 367 ms of which 1 ms to minimize.
[2023-03-19 23:39:56] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2023-03-19 23:39:57] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 1 ms to minimize.
[2023-03-19 23:39:57] [INFO ] Deduced a trap composed of 24 places in 329 ms of which 1 ms to minimize.
[2023-03-19 23:39:58] [INFO ] Deduced a trap composed of 30 places in 403 ms of which 1 ms to minimize.
[2023-03-19 23:39:58] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 0 ms to minimize.
[2023-03-19 23:39:58] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 1 ms to minimize.
[2023-03-19 23:39:58] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 18861 ms
[2023-03-19 23:39:59] [INFO ] After 21019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-19 23:39:59] [INFO ] After 21929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 137 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2500 transition count 2401
Applied a total of 695 rules in 180 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 45912 steps, run visited all 1 properties in 948 ms. (steps per millisecond=48 )
Probabilistic random walk after 45912 steps, saw 44945 distinct states, run finished after 961 ms. (steps per millisecond=47 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 115 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:40:01] [INFO ] Invariant cache hit.
[2023-03-19 23:40:03] [INFO ] Implicit Places using invariants in 2006 ms returned []
[2023-03-19 23:40:03] [INFO ] Invariant cache hit.
[2023-03-19 23:40:08] [INFO ] Implicit Places using invariants and state equation in 5234 ms returned []
Implicit Place search using SMT with State Equation took 7243 ms to find 0 implicit places.
[2023-03-19 23:40:09] [INFO ] Redundant transitions in 539 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-19 23:40:09] [INFO ] Computed 900 place invariants in 23 ms
[2023-03-19 23:40:11] [INFO ] Dead Transitions using invariants and state equation in 2715 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 100 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10754 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85722 steps, run timeout after 3040 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85722 steps, saw 79934 distinct states, run finished after 3040 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:40:15] [INFO ] Invariant cache hit.
[2023-03-19 23:40:16] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:40:17] [INFO ] [Nat]Absence check using 900 positive place invariants in 364 ms returned sat
[2023-03-19 23:40:19] [INFO ] After 1879ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:40:19] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-19 23:40:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-19 23:40:19] [INFO ] After 2267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-19 23:40:19] [INFO ] After 3185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 91 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2500 transition count 2400
Applied a total of 695 rules in 245 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45912 steps, run visited all 1 properties in 908 ms. (steps per millisecond=50 )
Probabilistic random walk after 45912 steps, saw 44945 distinct states, run finished after 910 ms. (steps per millisecond=50 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 1659 ms.
Product exploration explored 100000 steps with 19 reset in 1954 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 121 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-19 23:40:25] [INFO ] Invariant cache hit.
[2023-03-19 23:40:26] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2023-03-19 23:40:27] [INFO ] Invariant cache hit.
[2023-03-19 23:40:29] [INFO ] Implicit Places using invariants and state equation in 2524 ms returned []
Implicit Place search using SMT with State Equation took 3929 ms to find 0 implicit places.
[2023-03-19 23:40:29] [INFO ] Redundant transitions in 361 ms returned []
[2023-03-19 23:40:29] [INFO ] Invariant cache hit.
[2023-03-19 23:40:32] [INFO ] Dead Transitions using invariants and state equation in 2374 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6824 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-00 finished in 73609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 76 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:40:32] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-19 23:40:35] [INFO ] Implicit Places using invariants in 2502 ms returned []
[2023-03-19 23:40:35] [INFO ] Invariant cache hit.
[2023-03-19 23:40:39] [INFO ] Implicit Places using invariants and state equation in 4643 ms returned []
Implicit Place search using SMT with State Equation took 7195 ms to find 0 implicit places.
[2023-03-19 23:40:39] [INFO ] Invariant cache hit.
[2023-03-19 23:40:42] [INFO ] Dead Transitions using invariants and state equation in 2076 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9363 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (NEQ s179 0) (NEQ s2039 1)), p0:(AND (NEQ s180 0) (NEQ s436 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 6592 ms.
Product exploration explored 100000 steps with 33333 reset in 7274 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-03 finished in 23730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 109 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:40:56] [INFO ] Invariant cache hit.
[2023-03-19 23:40:59] [INFO ] Implicit Places using invariants in 2652 ms returned []
[2023-03-19 23:40:59] [INFO ] Invariant cache hit.
[2023-03-19 23:41:01] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 5485 ms to find 0 implicit places.
[2023-03-19 23:41:01] [INFO ] Invariant cache hit.
[2023-03-19 23:41:03] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7296 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s459 0) (EQ s1512 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 9411 ms.
Product exploration explored 100000 steps with 50000 reset in 9228 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-04 finished in 26180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(G(p0)) U p1))))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 115 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:41:22] [INFO ] Invariant cache hit.
[2023-03-19 23:41:24] [INFO ] Implicit Places using invariants in 1421 ms returned []
[2023-03-19 23:41:24] [INFO ] Invariant cache hit.
[2023-03-19 23:41:28] [INFO ] Implicit Places using invariants and state equation in 4605 ms returned []
Implicit Place search using SMT with State Equation took 6042 ms to find 0 implicit places.
[2023-03-19 23:41:28] [INFO ] Invariant cache hit.
[2023-03-19 23:41:31] [INFO ] Dead Transitions using invariants and state equation in 2312 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8506 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s800 0) (EQ s227 1)), p0:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 2358 ms.
Product exploration explored 100000 steps with 19 reset in 2411 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 561 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 83503 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83503 steps, saw 77855 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:41:40] [INFO ] Invariant cache hit.
[2023-03-19 23:41:41] [INFO ] [Real]Absence check using 901 positive place invariants in 590 ms returned sat
[2023-03-19 23:41:43] [INFO ] After 2974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:41:44] [INFO ] [Nat]Absence check using 901 positive place invariants in 211 ms returned sat
[2023-03-19 23:41:46] [INFO ] After 2404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:41:47] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:41:47] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-19 23:41:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-19 23:41:47] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-19 23:41:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 738 ms
[2023-03-19 23:41:47] [INFO ] After 3460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 250 ms.
[2023-03-19 23:41:48] [INFO ] After 4542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 348 ms.
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 12 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Applied a total of 699 rules in 273 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Finished probabilistic random walk after 89126 steps, run visited all 2 properties in 2271 ms. (steps per millisecond=39 )
Probabilistic random walk after 89126 steps, saw 87708 distinct states, run finished after 2273 ms. (steps per millisecond=39 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 283 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 531 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 392 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 126 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:41:53] [INFO ] Invariant cache hit.
[2023-03-19 23:41:55] [INFO ] Implicit Places using invariants in 2660 ms returned []
[2023-03-19 23:41:55] [INFO ] Invariant cache hit.
[2023-03-19 23:42:01] [INFO ] Implicit Places using invariants and state equation in 5461 ms returned []
Implicit Place search using SMT with State Equation took 8142 ms to find 0 implicit places.
[2023-03-19 23:42:01] [INFO ] Invariant cache hit.
[2023-03-19 23:42:03] [INFO ] Dead Transitions using invariants and state equation in 2355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10648 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 83111 steps, run timeout after 3006 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83111 steps, saw 77477 distinct states, run finished after 3006 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:42:07] [INFO ] Invariant cache hit.
[2023-03-19 23:42:08] [INFO ] [Real]Absence check using 901 positive place invariants in 369 ms returned sat
[2023-03-19 23:42:10] [INFO ] After 2846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:42:11] [INFO ] [Nat]Absence check using 901 positive place invariants in 307 ms returned sat
[2023-03-19 23:42:14] [INFO ] After 2822ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:42:14] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-19 23:42:14] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:42:14] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-19 23:42:15] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-19 23:42:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 781 ms
[2023-03-19 23:42:15] [INFO ] After 3962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 341 ms.
[2023-03-19 23:42:15] [INFO ] After 5272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 468 ms.
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 12 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 86 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Applied a total of 699 rules in 325 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Finished probabilistic random walk after 89126 steps, run visited all 2 properties in 1994 ms. (steps per millisecond=44 )
Probabilistic random walk after 89126 steps, saw 87708 distinct states, run finished after 1996 ms. (steps per millisecond=44 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 502 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 334 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 19 reset in 1680 ms.
Product exploration explored 100000 steps with 19 reset in 2062 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 373 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 11 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 2403
Deduced a syphon composed of 2 places in 14 ms
Applied a total of 2 rules in 348 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:42:25] [INFO ] Redundant transitions in 332 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2503 cols
[2023-03-19 23:42:25] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-19 23:42:26] [INFO ] Dead Transitions using invariants and state equation in 1291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 2402/2403 transitions.
Deduced a syphon composed of 2 places in 27 ms
Applied a total of 0 rules in 105 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2084 ms. Remains : 2503/2503 places, 2402/2403 transitions.
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 91 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:42:27] [INFO ] Computed 901 place invariants in 13 ms
[2023-03-19 23:42:29] [INFO ] Implicit Places using invariants in 2162 ms returned []
[2023-03-19 23:42:29] [INFO ] Invariant cache hit.
[2023-03-19 23:42:33] [INFO ] Implicit Places using invariants and state equation in 4816 ms returned []
Implicit Place search using SMT with State Equation took 6982 ms to find 0 implicit places.
[2023-03-19 23:42:33] [INFO ] Invariant cache hit.
[2023-03-19 23:42:36] [INFO ] Dead Transitions using invariants and state equation in 2371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9445 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-05 finished in 73986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(!p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 29 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 258 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:42:36] [INFO ] Computed 901 place invariants in 13 ms
[2023-03-19 23:42:39] [INFO ] Implicit Places using invariants in 2290 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2308 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 87 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2653 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s1552 0) (EQ s33 1)), p1:(OR (EQ s1194 0) (EQ s1268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-09 finished in 2871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(p1)||p0)))))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 106 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:42:39] [INFO ] Computed 901 place invariants in 25 ms
[2023-03-19 23:42:41] [INFO ] Implicit Places using invariants in 2269 ms returned []
[2023-03-19 23:42:41] [INFO ] Invariant cache hit.
[2023-03-19 23:42:47] [INFO ] Implicit Places using invariants and state equation in 5601 ms returned []
Implicit Place search using SMT with State Equation took 7933 ms to find 0 implicit places.
[2023-03-19 23:42:47] [INFO ] Invariant cache hit.
[2023-03-19 23:42:50] [INFO ] Dead Transitions using invariants and state equation in 2879 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10923 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(EQ s2341 1), p0:(OR (EQ s2341 1) (EQ s1164 0) (EQ s1998 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2640 steps with 0 reset in 79 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-10 finished in 11391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 85 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:42:50] [INFO ] Invariant cache hit.
[2023-03-19 23:42:52] [INFO ] Implicit Places using invariants in 1839 ms returned []
[2023-03-19 23:42:52] [INFO ] Invariant cache hit.
[2023-03-19 23:42:58] [INFO ] Implicit Places using invariants and state equation in 5645 ms returned []
Implicit Place search using SMT with State Equation took 7487 ms to find 0 implicit places.
[2023-03-19 23:42:58] [INFO ] Invariant cache hit.
[2023-03-19 23:43:00] [INFO ] Dead Transitions using invariants and state equation in 2606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10184 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s2121 0) (EQ s89 1)), p0:(OR (EQ s749 0) (EQ s580 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8863 ms.
Product exploration explored 100000 steps with 50000 reset in 8894 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-11 finished in 28317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 24 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 205 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:43:19] [INFO ] Computed 901 place invariants in 13 ms
[2023-03-19 23:43:21] [INFO ] Implicit Places using invariants in 1710 ms returned []
[2023-03-19 23:43:21] [INFO ] Invariant cache hit.
[2023-03-19 23:43:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:43:27] [INFO ] Implicit Places using invariants and state equation in 6216 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7942 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 94 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8241 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s2148 0) (EQ s1108 1)), p0:(OR (EQ s2104 0) (EQ s2230 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 101 reset in 1726 ms.
Stuttering criterion allowed to conclude after 95189 steps with 100 reset in 1901 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-14 finished in 12054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 26 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 269 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-19 23:43:31] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-19 23:43:33] [INFO ] Implicit Places using invariants in 1971 ms returned []
[2023-03-19 23:43:33] [INFO ] Invariant cache hit.
[2023-03-19 23:43:35] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 4033 ms to find 0 implicit places.
[2023-03-19 23:43:35] [INFO ] Redundant transitions in 461 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-19 23:43:35] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-19 23:43:37] [INFO ] Dead Transitions using invariants and state equation in 1487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2503 places, 2399/2403 transitions.
Applied a total of 0 rules in 88 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6357 ms. Remains : 2499/2503 places, 2399/2403 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s681 0) (EQ s1830 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19 reset in 1720 ms.
Stuttering criterion allowed to conclude after 60216 steps with 11 reset in 1199 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-15 finished in 9381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(G(p0)) U p1))))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100A-LTLCardinality-05
Stuttering acceptance computed with spot in 449 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 16 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 192 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:43:41] [INFO ] Computed 901 place invariants in 13 ms
[2023-03-19 23:43:43] [INFO ] Implicit Places using invariants in 2277 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2280 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 111 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2584 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s800 0) (EQ s227 1)), p0:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1582 ms.
Product exploration explored 100000 steps with 19 reset in 1952 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 81117 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81117 steps, saw 75538 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:43:51] [INFO ] Computed 900 place invariants in 8 ms
[2023-03-19 23:43:51] [INFO ] [Real]Absence check using 900 positive place invariants in 202 ms returned sat
[2023-03-19 23:43:54] [INFO ] After 2752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:43:54] [INFO ] [Nat]Absence check using 900 positive place invariants in 303 ms returned sat
[2023-03-19 23:43:56] [INFO ] After 1735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:43:56] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
[2023-03-19 23:43:57] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 1 ms to minimize.
[2023-03-19 23:43:57] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-19 23:43:57] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 0 ms to minimize.
[2023-03-19 23:43:58] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-19 23:43:58] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2023-03-19 23:43:58] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2023-03-19 23:43:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2000 ms
[2023-03-19 23:43:58] [INFO ] After 4017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 270 ms.
[2023-03-19 23:43:59] [INFO ] After 5209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 333 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2500 transition count 2401
Applied a total of 695 rules in 197 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Finished probabilistic random walk after 89126 steps, run visited all 2 properties in 2170 ms. (steps per millisecond=41 )
Probabilistic random walk after 89126 steps, saw 87707 distinct states, run finished after 2172 ms. (steps per millisecond=41 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 410 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 127 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:44:03] [INFO ] Invariant cache hit.
[2023-03-19 23:44:05] [INFO ] Implicit Places using invariants in 2007 ms returned []
[2023-03-19 23:44:05] [INFO ] Invariant cache hit.
[2023-03-19 23:44:07] [INFO ] Implicit Places using invariants and state equation in 2154 ms returned []
Implicit Place search using SMT with State Equation took 4177 ms to find 0 implicit places.
[2023-03-19 23:44:07] [INFO ] Invariant cache hit.
[2023-03-19 23:44:10] [INFO ] Dead Transitions using invariants and state equation in 3013 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7330 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 86577 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86577 steps, saw 80756 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:44:14] [INFO ] Invariant cache hit.
[2023-03-19 23:44:15] [INFO ] [Real]Absence check using 900 positive place invariants in 247 ms returned sat
[2023-03-19 23:44:17] [INFO ] After 2810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:44:18] [INFO ] [Nat]Absence check using 900 positive place invariants in 264 ms returned sat
[2023-03-19 23:44:20] [INFO ] After 1677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:44:20] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2023-03-19 23:44:20] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2023-03-19 23:44:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 590 ms
[2023-03-19 23:44:21] [INFO ] After 2607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 304 ms.
[2023-03-19 23:44:21] [INFO ] After 3836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 454 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2500 transition count 2401
Applied a total of 695 rules in 168 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Finished probabilistic random walk after 89126 steps, run visited all 2 properties in 1988 ms. (steps per millisecond=44 )
Probabilistic random walk after 89126 steps, saw 87707 distinct states, run finished after 1990 ms. (steps per millisecond=44 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 360 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 19 reset in 1634 ms.
Product exploration explored 100000 steps with 19 reset in 2021 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 376 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 121 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:44:30] [INFO ] Redundant transitions in 525 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-19 23:44:30] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-19 23:44:32] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 96 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2444 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 92 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:44:32] [INFO ] Computed 900 place invariants in 11 ms
[2023-03-19 23:44:34] [INFO ] Implicit Places using invariants in 1999 ms returned []
[2023-03-19 23:44:34] [INFO ] Invariant cache hit.
[2023-03-19 23:44:38] [INFO ] Implicit Places using invariants and state equation in 4193 ms returned []
Implicit Place search using SMT with State Equation took 6206 ms to find 0 implicit places.
[2023-03-19 23:44:38] [INFO ] Invariant cache hit.
[2023-03-19 23:44:41] [INFO ] Dead Transitions using invariants and state equation in 2550 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8849 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-05 finished in 60814 ms.
[2023-03-19 23:44:41] [INFO ] Flatten gal took : 174 ms
[2023-03-19 23:44:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 23:44:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2503 places, 2403 transitions and 10806 arcs took 17 ms.
Total runtime 467153 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-100A
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

BK_STOP 1679269617718

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:427
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPs-PT-100A-LTLCardinality-00
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/1799 3/32 ShieldIIPs-PT-100A-LTLCardinality-00 236351 m, 47270 m/sec, 294506 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/1799 5/32 ShieldIIPs-PT-100A-LTLCardinality-00 537831 m, 60296 m/sec, 708541 t fired, .

Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/1799 8/32 ShieldIIPs-PT-100A-LTLCardinality-00 851048 m, 62643 m/sec, 1138524 t fired, .

Time elapsed: 15 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/1799 10/32 ShieldIIPs-PT-100A-LTLCardinality-00 1139964 m, 57783 m/sec, 1535493 t fired, .

Time elapsed: 20 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/1799 12/32 ShieldIIPs-PT-100A-LTLCardinality-00 1443865 m, 60780 m/sec, 1952911 t fired, .

Time elapsed: 25 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/1799 15/32 ShieldIIPs-PT-100A-LTLCardinality-00 1745788 m, 60384 m/sec, 2367698 t fired, .

Time elapsed: 30 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/1799 17/32 ShieldIIPs-PT-100A-LTLCardinality-00 2044646 m, 59771 m/sec, 2778069 t fired, .

Time elapsed: 35 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/1799 20/32 ShieldIIPs-PT-100A-LTLCardinality-00 2347487 m, 60568 m/sec, 3194169 t fired, .

Time elapsed: 40 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/1799 22/32 ShieldIIPs-PT-100A-LTLCardinality-00 2652700 m, 61042 m/sec, 3590898 t fired, .

Time elapsed: 45 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/1799 25/32 ShieldIIPs-PT-100A-LTLCardinality-00 2959810 m, 61422 m/sec, 4016361 t fired, .

Time elapsed: 50 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/1799 27/32 ShieldIIPs-PT-100A-LTLCardinality-00 3256254 m, 59288 m/sec, 4427021 t fired, .

Time elapsed: 55 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/1799 30/32 ShieldIIPs-PT-100A-LTLCardinality-00 3560222 m, 60793 m/sec, 4848090 t fired, .

Time elapsed: 60 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/1799 32/32 ShieldIIPs-PT-100A-LTLCardinality-00 3853609 m, 58677 m/sec, 5254533 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for ShieldIIPs-PT-100A-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPs-PT-100A-LTLCardinality-05
lola: time limit : 3530 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3530 4/32 ShieldIIPs-PT-100A-LTLCardinality-05 114994 m, 22998 m/sec, 576055 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3530 6/32 ShieldIIPs-PT-100A-LTLCardinality-05 216630 m, 20327 m/sec, 1163745 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3530 9/32 ShieldIIPs-PT-100A-LTLCardinality-05 316280 m, 19930 m/sec, 1741442 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3530 11/32 ShieldIIPs-PT-100A-LTLCardinality-05 410030 m, 18750 m/sec, 2314266 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3530 14/32 ShieldIIPs-PT-100A-LTLCardinality-05 503714 m, 18736 m/sec, 2894718 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3530 17/32 ShieldIIPs-PT-100A-LTLCardinality-05 601441 m, 19545 m/sec, 3477556 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3530 19/32 ShieldIIPs-PT-100A-LTLCardinality-05 694554 m, 18622 m/sec, 4060100 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3530 22/32 ShieldIIPs-PT-100A-LTLCardinality-05 793131 m, 19715 m/sec, 4628677 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3530 24/32 ShieldIIPs-PT-100A-LTLCardinality-05 885809 m, 18535 m/sec, 5202255 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3530 27/32 ShieldIIPs-PT-100A-LTLCardinality-05 978163 m, 18470 m/sec, 5779297 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3530 29/32 ShieldIIPs-PT-100A-LTLCardinality-05 1070966 m, 18560 m/sec, 6356603 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3530 31/32 ShieldIIPs-PT-100A-LTLCardinality-05 1158693 m, 17545 m/sec, 6933465 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for ShieldIIPs-PT-100A-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-100A-LTLCardinality-00: LTL unknown AGGR
ShieldIIPs-PT-100A-LTLCardinality-05: LTL unknown AGGR


Time elapsed: 135 secs. Pages in use: 32

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPs-PT-100A, 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 r391-oct2-167903714900163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100A.tgz
mv ShieldIIPs-PT-100A 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 ;