Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679186656975

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 00:44:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 00:44:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:44:19] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-19 00:44:19] [INFO ] Transformed 1403 places.
[2023-03-19 00:44:19] [INFO ] Transformed 1303 transitions.
[2023-03-19 00:44:19] [INFO ] Found NUPN structural information;
[2023-03-19 00:44:19] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 212 place count 1191 transition count 1091
Iterating global reduction 0 with 212 rules applied. Total rules applied 424 place count 1191 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1190 transition count 1090
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1190 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 427 place count 1189 transition count 1089
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 1189 transition count 1089
Applied a total of 428 rules in 610 ms. Remains 1189 /1403 variables (removed 214) and now considering 1089/1303 (removed 214) transitions.
// Phase 1: matrix 1089 rows 1189 cols
[2023-03-19 00:44:20] [INFO ] Computed 181 place invariants in 18 ms
[2023-03-19 00:44:21] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2023-03-19 00:44:21] [INFO ] Invariant cache hit.
[2023-03-19 00:44:23] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 2670 ms to find 0 implicit places.
[2023-03-19 00:44:23] [INFO ] Invariant cache hit.
[2023-03-19 00:44:24] [INFO ] Dead Transitions using invariants and state equation in 1145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1189/1403 places, 1089/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4445 ms. Remains : 1189/1403 places, 1089/1303 transitions.
Support contains 28 out of 1189 places after structural reductions.
[2023-03-19 00:44:24] [INFO ] Flatten gal took : 137 ms
[2023-03-19 00:44:24] [INFO ] Flatten gal took : 43 ms
[2023-03-19 00:44:24] [INFO ] Input system was already deterministic with 1089 transitions.
Support contains 26 out of 1189 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-19 00:44:25] [INFO ] Invariant cache hit.
[2023-03-19 00:44:25] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 00:44:26] [INFO ] [Nat]Absence check using 181 positive place invariants in 83 ms returned sat
[2023-03-19 00:44:27] [INFO ] After 1093ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 00:44:28] [INFO ] Deduced a trap composed of 24 places in 384 ms of which 20 ms to minimize.
[2023-03-19 00:44:28] [INFO ] Deduced a trap composed of 25 places in 568 ms of which 2 ms to minimize.
[2023-03-19 00:44:29] [INFO ] Deduced a trap composed of 29 places in 332 ms of which 2 ms to minimize.
[2023-03-19 00:44:29] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 1 ms to minimize.
[2023-03-19 00:44:29] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 1 ms to minimize.
[2023-03-19 00:44:30] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-19 00:44:30] [INFO ] Deduced a trap composed of 22 places in 303 ms of which 1 ms to minimize.
[2023-03-19 00:44:30] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 0 ms to minimize.
[2023-03-19 00:44:31] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2023-03-19 00:44:31] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2023-03-19 00:44:31] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2023-03-19 00:44:31] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2023-03-19 00:44:31] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2023-03-19 00:44:32] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 1 ms to minimize.
[2023-03-19 00:44:32] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 1 ms to minimize.
[2023-03-19 00:44:32] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2023-03-19 00:44:32] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 1 ms to minimize.
[2023-03-19 00:44:33] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 3 ms to minimize.
[2023-03-19 00:44:33] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2023-03-19 00:44:33] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 6 ms to minimize.
[2023-03-19 00:44:33] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2023-03-19 00:44:33] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 14 ms to minimize.
[2023-03-19 00:44:34] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 0 ms to minimize.
[2023-03-19 00:44:34] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6457 ms
[2023-03-19 00:44:34] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-03-19 00:44:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-19 00:44:35] [INFO ] After 8483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 473 ms.
[2023-03-19 00:44:35] [INFO ] After 9683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 139 ms.
Support contains 11 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 1189 transition count 855
Reduce places removed 234 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 236 rules applied. Total rules applied 470 place count 955 transition count 853
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 472 place count 953 transition count 853
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 472 place count 953 transition count 698
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 782 place count 798 transition count 698
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 787 place count 793 transition count 693
Iterating global reduction 3 with 5 rules applied. Total rules applied 792 place count 793 transition count 693
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 792 place count 793 transition count 689
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 800 place count 789 transition count 689
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1476 place count 451 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1477 place count 451 transition count 350
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1479 place count 450 transition count 349
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1591 place count 394 transition count 385
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1592 place count 394 transition count 384
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1593 place count 394 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1594 place count 393 transition count 383
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 1613 place count 393 transition count 383
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1614 place count 392 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1616 place count 390 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1616 place count 390 transition count 381
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1618 place count 389 transition count 381
Applied a total of 1618 rules in 222 ms. Remains 389 /1189 variables (removed 800) and now considering 381/1089 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 389/1189 places, 381/1089 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 381 rows 389 cols
[2023-03-19 00:44:36] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-19 00:44:36] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:44:36] [INFO ] [Nat]Absence check using 179 positive place invariants in 21 ms returned sat
[2023-03-19 00:44:36] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:44:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 00:44:36] [INFO ] After 118ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:44:37] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-19 00:44:37] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 62 ms.
Support contains 8 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 381/381 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 389 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 388 transition count 380
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 387 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 386 transition count 380
Applied a total of 6 rules in 43 ms. Remains 386 /389 variables (removed 3) and now considering 380/381 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 386/389 places, 380/381 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 165402 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165402 steps, saw 110786 distinct states, run finished after 3007 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 380 rows 386 cols
[2023-03-19 00:44:40] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-19 00:44:40] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:44:41] [INFO ] [Nat]Absence check using 179 positive place invariants in 57 ms returned sat
[2023-03-19 00:44:41] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:44:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 00:44:41] [INFO ] After 111ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:44:41] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-19 00:44:41] [INFO ] After 883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 198 ms.
Support contains 8 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 380/380 transitions.
Applied a total of 0 rules in 9 ms. Remains 386 /386 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 386/386 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 380/380 transitions.
Applied a total of 0 rules in 8 ms. Remains 386 /386 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2023-03-19 00:44:42] [INFO ] Invariant cache hit.
[2023-03-19 00:44:42] [INFO ] Implicit Places using invariants in 551 ms returned [375]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 555 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 385/386 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 384 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 384 transition count 379
Applied a total of 2 rules in 12 ms. Remains 384 /385 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 384 cols
[2023-03-19 00:44:42] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:44:42] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-19 00:44:42] [INFO ] Invariant cache hit.
[2023-03-19 00:44:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 00:44:43] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 384/386 places, 379/380 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1534 ms. Remains : 384/386 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) 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 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 00:44:44] [INFO ] Invariant cache hit.
[2023-03-19 00:44:44] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:44:44] [INFO ] [Nat]Absence check using 178 positive place invariants in 68 ms returned sat
[2023-03-19 00:44:44] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:44:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 00:44:44] [INFO ] After 69ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:44:44] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-19 00:44:44] [INFO ] After 688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 379/379 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 384 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 383 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 382 transition count 377
Applied a total of 4 rules in 44 ms. Remains 382 /384 variables (removed 2) and now considering 377/379 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 382/384 places, 377/379 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 239179 steps, run timeout after 3006 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239179 steps, saw 160561 distinct states, run finished after 3007 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 377 rows 382 cols
[2023-03-19 00:44:48] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:44:48] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:44:48] [INFO ] [Nat]Absence check using 178 positive place invariants in 38 ms returned sat
[2023-03-19 00:44:48] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:44:48] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 00:44:48] [INFO ] After 85ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:44:48] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-19 00:44:49] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 56 ms.
Support contains 6 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 377/377 transitions.
Applied a total of 0 rules in 12 ms. Remains 382 /382 variables (removed 0) and now considering 377/377 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 382/382 places, 377/377 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 377/377 transitions.
Applied a total of 0 rules in 9 ms. Remains 382 /382 variables (removed 0) and now considering 377/377 (removed 0) transitions.
[2023-03-19 00:44:49] [INFO ] Invariant cache hit.
[2023-03-19 00:44:49] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-19 00:44:49] [INFO ] Invariant cache hit.
[2023-03-19 00:44:49] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 00:44:50] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2023-03-19 00:44:50] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-19 00:44:50] [INFO ] Invariant cache hit.
[2023-03-19 00:44:50] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1166 ms. Remains : 382/382 places, 377/377 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 382 transition count 377
Applied a total of 40 rules in 11 ms. Remains 382 /382 variables (removed 0) and now considering 377/377 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 377 rows 382 cols
[2023-03-19 00:44:50] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-19 00:44:50] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:44:50] [INFO ] [Nat]Absence check using 178 positive place invariants in 52 ms returned sat
[2023-03-19 00:44:50] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:44:50] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-19 00:44:50] [INFO ] After 147ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:44:51] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-19 00:44:51] [INFO ] After 891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 319 stabilizing places and 319 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1182 transition count 1082
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1182 transition count 1082
Applied a total of 14 rules in 133 ms. Remains 1182 /1189 variables (removed 7) and now considering 1082/1089 (removed 7) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:44:51] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-19 00:44:52] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-19 00:44:52] [INFO ] Invariant cache hit.
[2023-03-19 00:44:55] [INFO ] Implicit Places using invariants and state equation in 3161 ms returned []
Implicit Place search using SMT with State Equation took 3731 ms to find 0 implicit places.
[2023-03-19 00:44:55] [INFO ] Invariant cache hit.
[2023-03-19 00:44:56] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1189 places, 1082/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4495 ms. Remains : 1182/1189 places, 1082/1089 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s288 0) (EQ s703 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 6 reset in 588 ms.
Stack based approach found an accepted trace after 1820 steps with 0 reset with depth 1821 and stack size 1821 in 10 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-00 finished in 5546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 56 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-19 00:44:57] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-19 00:44:57] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-19 00:44:57] [INFO ] Invariant cache hit.
[2023-03-19 00:44:58] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2023-03-19 00:44:58] [INFO ] Invariant cache hit.
[2023-03-19 00:44:59] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1189 places, 1081/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2609 ms. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s649 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 10 reset in 510 ms.
Stack based approach found an accepted trace after 3195 steps with 1 reset with depth 1100 and stack size 1100 in 17 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-01 finished in 3368 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)||(G(F(p0))&&(G(p1) U G(p2))))))'
Support contains 4 out of 1189 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 1188 transition count 854
Reduce places removed 234 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 236 rules applied. Total rules applied 470 place count 954 transition count 852
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 472 place count 952 transition count 852
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 472 place count 952 transition count 694
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 788 place count 794 transition count 694
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 794 place count 788 transition count 688
Iterating global reduction 3 with 6 rules applied. Total rules applied 800 place count 788 transition count 688
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 800 place count 788 transition count 683
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 810 place count 783 transition count 683
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 332
Deduced a syphon composed of 332 places in 0 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 3 with 664 rules applied. Total rules applied 1474 place count 451 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1475 place count 451 transition count 350
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1477 place count 450 transition count 349
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1593 place count 392 transition count 386
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1595 place count 390 transition count 384
Applied a total of 1595 rules in 122 ms. Remains 390 /1189 variables (removed 799) and now considering 384/1089 (removed 705) transitions.
// Phase 1: matrix 384 rows 390 cols
[2023-03-19 00:45:00] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-19 00:45:00] [INFO ] Implicit Places using invariants in 224 ms returned [381, 382]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 239 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 388/1189 places, 384/1089 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 388 transition count 383
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 387 transition count 383
Applied a total of 2 rules in 21 ms. Remains 387 /388 variables (removed 1) and now considering 383/384 (removed 1) transitions.
// Phase 1: matrix 383 rows 387 cols
[2023-03-19 00:45:00] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-19 00:45:01] [INFO ] Implicit Places using invariants in 364 ms returned [375]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 377 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 386/1189 places, 383/1089 transitions.
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 2 place count 385 transition count 382
Applied a total of 2 rules in 29 ms. Remains 385 /386 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 385 cols
[2023-03-19 00:45:01] [INFO ] Computed 178 place invariants in 13 ms
[2023-03-19 00:45:01] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-19 00:45:01] [INFO ] Invariant cache hit.
[2023-03-19 00:45:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-19 00:45:02] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 385/1189 places, 382/1089 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1858 ms. Remains : 385/1189 places, 382/1089 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s91 0) (EQ s15 1)), p0:(OR (EQ s234 0) (EQ s285 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-06 finished in 2066 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(p0)))))'
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 72 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-19 00:45:02] [INFO ] Computed 181 place invariants in 9 ms
[2023-03-19 00:45:03] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-19 00:45:03] [INFO ] Invariant cache hit.
[2023-03-19 00:45:04] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2023-03-19 00:45:04] [INFO ] Invariant cache hit.
[2023-03-19 00:45:05] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1189 places, 1081/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2594 ms. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s217 0) (EQ s1081 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 428 ms.
Product exploration explored 100000 steps with 0 reset in 645 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 266110 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266110 steps, saw 136717 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:45:09] [INFO ] Invariant cache hit.
[2023-03-19 00:45:10] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:45:10] [INFO ] [Nat]Absence check using 181 positive place invariants in 131 ms returned sat
[2023-03-19 00:45:11] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:45:11] [INFO ] Deduced a trap composed of 22 places in 473 ms of which 1 ms to minimize.
[2023-03-19 00:45:11] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 0 ms to minimize.
[2023-03-19 00:45:12] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 0 ms to minimize.
[2023-03-19 00:45:12] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 4 ms to minimize.
[2023-03-19 00:45:12] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 1 ms to minimize.
[2023-03-19 00:45:12] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 0 ms to minimize.
[2023-03-19 00:45:13] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 0 ms to minimize.
[2023-03-19 00:45:13] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 0 ms to minimize.
[2023-03-19 00:45:13] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-19 00:45:13] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2023-03-19 00:45:14] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 0 ms to minimize.
[2023-03-19 00:45:14] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 1 ms to minimize.
[2023-03-19 00:45:14] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 0 ms to minimize.
[2023-03-19 00:45:14] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 1 ms to minimize.
[2023-03-19 00:45:15] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 1 ms to minimize.
[2023-03-19 00:45:15] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2023-03-19 00:45:15] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 0 ms to minimize.
[2023-03-19 00:45:16] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 0 ms to minimize.
[2023-03-19 00:45:16] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 0 ms to minimize.
[2023-03-19 00:45:16] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2023-03-19 00:45:16] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 13 ms to minimize.
[2023-03-19 00:45:17] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 1 ms to minimize.
[2023-03-19 00:45:17] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 1 ms to minimize.
[2023-03-19 00:45:17] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
[2023-03-19 00:45:17] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-19 00:45:17] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 24 ms to minimize.
[2023-03-19 00:45:18] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2023-03-19 00:45:18] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 1 ms to minimize.
[2023-03-19 00:45:18] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 1 ms to minimize.
[2023-03-19 00:45:18] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2023-03-19 00:45:18] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 0 ms to minimize.
[2023-03-19 00:45:18] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2023-03-19 00:45:19] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2023-03-19 00:45:19] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 13 ms to minimize.
[2023-03-19 00:45:19] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2023-03-19 00:45:19] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 0 ms to minimize.
[2023-03-19 00:45:19] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8775 ms
[2023-03-19 00:45:19] [INFO ] After 9298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-19 00:45:19] [INFO ] After 9753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1181 transition count 842
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 942 transition count 842
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 478 place count 942 transition count 681
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 800 place count 781 transition count 681
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1478 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1479 place count 442 transition count 341
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1481 place count 441 transition count 340
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1599 place count 382 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 382 transition count 378
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1620 place count 382 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1621 place count 381 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1623 place count 379 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1623 place count 379 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1625 place count 378 transition count 376
Applied a total of 1625 rules in 136 ms. Remains 378 /1181 variables (removed 803) and now considering 376/1081 (removed 705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 378/1181 places, 376/1081 transitions.
Finished random walk after 3943 steps, including 1 resets, run visited all 1 properties in 19 ms. (steps per millisecond=207 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Applied a total of 0 rules in 61 ms. Remains 1181 /1181 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
[2023-03-19 00:45:20] [INFO ] Invariant cache hit.
[2023-03-19 00:45:21] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-19 00:45:21] [INFO ] Invariant cache hit.
[2023-03-19 00:45:22] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
[2023-03-19 00:45:22] [INFO ] Invariant cache hit.
[2023-03-19 00:45:23] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2509 ms. Remains : 1181/1181 places, 1081/1081 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 257707 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257707 steps, saw 132749 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:45:26] [INFO ] Invariant cache hit.
[2023-03-19 00:45:26] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:45:27] [INFO ] [Nat]Absence check using 181 positive place invariants in 77 ms returned sat
[2023-03-19 00:45:27] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:45:28] [INFO ] Deduced a trap composed of 22 places in 347 ms of which 14 ms to minimize.
[2023-03-19 00:45:28] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 13 ms to minimize.
[2023-03-19 00:45:28] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 0 ms to minimize.
[2023-03-19 00:45:29] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 0 ms to minimize.
[2023-03-19 00:45:29] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 1 ms to minimize.
[2023-03-19 00:45:29] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 0 ms to minimize.
[2023-03-19 00:45:29] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 0 ms to minimize.
[2023-03-19 00:45:30] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 1 ms to minimize.
[2023-03-19 00:45:30] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 0 ms to minimize.
[2023-03-19 00:45:30] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 0 ms to minimize.
[2023-03-19 00:45:30] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 0 ms to minimize.
[2023-03-19 00:45:31] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 1 ms to minimize.
[2023-03-19 00:45:31] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 0 ms to minimize.
[2023-03-19 00:45:31] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 1 ms to minimize.
[2023-03-19 00:45:31] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2023-03-19 00:45:31] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2023-03-19 00:45:32] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 1 ms to minimize.
[2023-03-19 00:45:32] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 1 ms to minimize.
[2023-03-19 00:45:32] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2023-03-19 00:45:32] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2023-03-19 00:45:32] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 0 ms to minimize.
[2023-03-19 00:45:33] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2023-03-19 00:45:33] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2023-03-19 00:45:33] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2023-03-19 00:45:33] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 1 ms to minimize.
[2023-03-19 00:45:34] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 1 ms to minimize.
[2023-03-19 00:45:34] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2023-03-19 00:45:34] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 0 ms to minimize.
[2023-03-19 00:45:34] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 1 ms to minimize.
[2023-03-19 00:45:35] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 1 ms to minimize.
[2023-03-19 00:45:35] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2023-03-19 00:45:35] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2023-03-19 00:45:35] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 1 ms to minimize.
[2023-03-19 00:45:35] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-19 00:45:35] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 0 ms to minimize.
[2023-03-19 00:45:36] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2023-03-19 00:45:36] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8358 ms
[2023-03-19 00:45:36] [INFO ] After 9055ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-19 00:45:36] [INFO ] After 9418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1181 transition count 842
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 942 transition count 842
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 478 place count 942 transition count 681
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 800 place count 781 transition count 681
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1478 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1479 place count 442 transition count 341
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1481 place count 441 transition count 340
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1599 place count 382 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 382 transition count 378
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1620 place count 382 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1621 place count 381 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1623 place count 379 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1623 place count 379 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1625 place count 378 transition count 376
Applied a total of 1625 rules in 117 ms. Remains 378 /1181 variables (removed 803) and now considering 376/1081 (removed 705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 378/1181 places, 376/1081 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 494553 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494553 steps, saw 306456 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 378 cols
[2023-03-19 00:45:39] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-19 00:45:39] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:45:39] [INFO ] [Nat]Absence check using 179 positive place invariants in 83 ms returned sat
[2023-03-19 00:45:40] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:45:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:45:40] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:45:40] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 00:45:40] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 378/378 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-19 00:45:40] [INFO ] Invariant cache hit.
[2023-03-19 00:45:40] [INFO ] Implicit Places using invariants in 364 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 369 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 375
Applied a total of 2 rules in 11 ms. Remains 376 /377 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 376 cols
[2023-03-19 00:45:40] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:45:40] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-19 00:45:40] [INFO ] Invariant cache hit.
[2023-03-19 00:45:41] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 376/378 places, 375/376 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1147 ms. Remains : 376/378 places, 375/376 transitions.
Finished random walk after 3210 steps, including 0 resets, run visited all 1 properties in 36 ms. (steps per millisecond=89 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 502 ms.
Product exploration explored 100000 steps with 0 reset in 615 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1181 transition count 1081
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 239 place count 1181 transition count 1142
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 320 place count 1181 transition count 1142
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 719 places in 1 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 719 place count 1181 transition count 1142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 720 place count 1181 transition count 1141
Renaming transitions due to excessive name length > 1024 char.
Discarding 160 places :
Symmetric choice reduction at 2 with 160 rule applications. Total rules 880 place count 1021 transition count 981
Deduced a syphon composed of 559 places in 1 ms
Iterating global reduction 2 with 160 rules applied. Total rules applied 1040 place count 1021 transition count 981
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1041 place count 1021 transition count 981
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1043 place count 1019 transition count 979
Deduced a syphon composed of 558 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1045 place count 1019 transition count 979
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -419
Deduced a syphon composed of 637 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1124 place count 1019 transition count 1398
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1203 place count 940 transition count 1240
Deduced a syphon composed of 558 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1282 place count 940 transition count 1240
Deduced a syphon composed of 558 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1291 place count 940 transition count 1231
Deduced a syphon composed of 558 places in 1 ms
Applied a total of 1291 rules in 695 ms. Remains 940 /1181 variables (removed 241) and now considering 1231/1081 (removed -150) transitions.
[2023-03-19 00:45:44] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 1231 rows 940 cols
[2023-03-19 00:45:44] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-19 00:45:45] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1181 places, 1231/1081 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1352 ms. Remains : 940/1181 places, 1231/1081 transitions.
Built C files in :
/tmp/ltsmin6067256977752492321
[2023-03-19 00:45:45] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6067256977752492321
Running compilation step : cd /tmp/ltsmin6067256977752492321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1833 ms.
Running link step : cd /tmp/ltsmin6067256977752492321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin6067256977752492321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12551343717521486612.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Applied a total of 0 rules in 62 ms. Remains 1181 /1181 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-19 00:46:00] [INFO ] Computed 181 place invariants in 9 ms
[2023-03-19 00:46:00] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-19 00:46:00] [INFO ] Invariant cache hit.
[2023-03-19 00:46:02] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2023-03-19 00:46:02] [INFO ] Invariant cache hit.
[2023-03-19 00:46:03] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2717 ms. Remains : 1181/1181 places, 1081/1081 transitions.
Built C files in :
/tmp/ltsmin16694342646519431606
[2023-03-19 00:46:03] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16694342646519431606
Running compilation step : cd /tmp/ltsmin16694342646519431606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1757 ms.
Running link step : cd /tmp/ltsmin16694342646519431606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin16694342646519431606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18365625695081786550.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 00:46:18] [INFO ] Flatten gal took : 39 ms
[2023-03-19 00:46:18] [INFO ] Flatten gal took : 39 ms
[2023-03-19 00:46:18] [INFO ] Time to serialize gal into /tmp/LTL5705875566430157245.gal : 7 ms
[2023-03-19 00:46:18] [INFO ] Time to serialize properties into /tmp/LTL13719906748371308047.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5705875566430157245.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10589326969007878543.hoa' '-atoms' '/tmp/LTL13719906748371308047.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("((p250==0)||(p1279==1))"))))))
Formula 0 simplified : XXXF!"((p250==0)||(p1279==1))"
Detected timeout of ITS tools.
[2023-03-19 00:46:48] [INFO ] Flatten gal took : 65 ms
[2023-03-19 00:46:48] [INFO ] Applying decomposition
[2023-03-19 00:46:48] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9460705575995812659.txt' '-o' '/tmp/graph9460705575995812659.bin' '-w' '/tmp/graph9460705575995812659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9460705575995812659.bin' '-l' '-1' '-v' '-w' '/tmp/graph9460705575995812659.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:46:49] [INFO ] Decomposing Gal with order
[2023-03-19 00:46:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:46:49] [INFO ] Removed a total of 201 redundant transitions.
[2023-03-19 00:46:49] [INFO ] Flatten gal took : 86 ms
[2023-03-19 00:46:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-19 00:46:49] [INFO ] Time to serialize gal into /tmp/LTL9251823156062137561.gal : 14 ms
[2023-03-19 00:46:49] [INFO ] Time to serialize properties into /tmp/LTL3967879147881719516.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9251823156062137561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3967879147881719516.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("((i4.u80.p250==0)||(i18.u401.p1279==1))"))))))
Formula 0 simplified : XXXF!"((i4.u80.p250==0)||(i18.u401.p1279==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin195882527599094246
[2023-03-19 00:47:04] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin195882527599094246
Running compilation step : cd /tmp/ltsmin195882527599094246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1660 ms.
Running link step : cd /tmp/ltsmin195882527599094246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin195882527599094246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-07 finished in 137002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1188 transition count 851
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 951 transition count 851
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 157 Pre rules applied. Total rules applied 474 place count 951 transition count 694
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 788 place count 794 transition count 694
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 794 place count 788 transition count 688
Iterating global reduction 2 with 6 rules applied. Total rules applied 800 place count 788 transition count 688
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 800 place count 788 transition count 683
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 810 place count 783 transition count 683
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1482 place count 447 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1483 place count 447 transition count 346
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1485 place count 446 transition count 345
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1603 place count 387 transition count 384
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1604 place count 387 transition count 384
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1606 place count 385 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1608 place count 383 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1608 place count 383 transition count 381
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1610 place count 382 transition count 381
Applied a total of 1610 rules in 115 ms. Remains 382 /1189 variables (removed 807) and now considering 381/1089 (removed 708) transitions.
// Phase 1: matrix 381 rows 382 cols
[2023-03-19 00:47:19] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-19 00:47:19] [INFO ] Implicit Places using invariants in 294 ms returned [371]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 295 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 381/1189 places, 381/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 380 transition count 380
Applied a total of 2 rules in 10 ms. Remains 380 /381 variables (removed 1) and now considering 380/381 (removed 1) transitions.
// Phase 1: matrix 380 rows 380 cols
[2023-03-19 00:47:20] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:47:20] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-19 00:47:20] [INFO ] Invariant cache hit.
[2023-03-19 00:47:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 00:47:20] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 380/1189 places, 380/1089 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1066 ms. Remains : 380/1189 places, 380/1089 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s324 1), p1:(OR (EQ s36 0) (EQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-08 finished in 1234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(p1)))'
Support contains 6 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1183 transition count 1083
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1183 transition count 1083
Applied a total of 12 rules in 111 ms. Remains 1183 /1189 variables (removed 6) and now considering 1083/1089 (removed 6) transitions.
// Phase 1: matrix 1083 rows 1183 cols
[2023-03-19 00:47:20] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-19 00:47:21] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-19 00:47:21] [INFO ] Invariant cache hit.
[2023-03-19 00:47:22] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2023-03-19 00:47:22] [INFO ] Invariant cache hit.
[2023-03-19 00:47:23] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1083/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2567 ms. Remains : 1183/1189 places, 1083/1089 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s987 0) (EQ s1021 1)), p1:(OR (NOT (OR (EQ s589 0) (EQ s302 1))) (NOT (OR (EQ s862 0) (EQ s237 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-11 finished in 2848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 98 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-19 00:47:23] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-19 00:47:24] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-19 00:47:24] [INFO ] Invariant cache hit.
[2023-03-19 00:47:25] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
[2023-03-19 00:47:25] [INFO ] Invariant cache hit.
[2023-03-19 00:47:26] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1189 places, 1081/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2812 ms. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s52 0) (NEQ s642 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-12 finished in 2927 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(X(((p0 U !p1) U G(p2))))))))'
Support contains 5 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1181 transition count 1081
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1181 transition count 1081
Applied a total of 16 rules in 63 ms. Remains 1181 /1189 variables (removed 8) and now considering 1081/1089 (removed 8) transitions.
[2023-03-19 00:47:26] [INFO ] Invariant cache hit.
[2023-03-19 00:47:27] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-19 00:47:27] [INFO ] Invariant cache hit.
[2023-03-19 00:47:29] [INFO ] Implicit Places using invariants and state equation in 2491 ms returned []
Implicit Place search using SMT with State Equation took 3112 ms to find 0 implicit places.
[2023-03-19 00:47:29] [INFO ] Invariant cache hit.
[2023-03-19 00:47:30] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1189 places, 1081/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3919 ms. Remains : 1181/1189 places, 1081/1089 transitions.
Stuttering acceptance computed with spot in 576 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-15 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: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s618 1), p1:(OR (EQ s1033 0) (EQ s872 1)), p0:(OR (EQ s384 0) (EQ s1112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1415 reset in 310 ms.
Product exploration explored 100000 steps with 1385 reset in 298 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 583 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 00:47:32] [INFO ] Invariant cache hit.
[2023-03-19 00:47:33] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:47:33] [INFO ] [Nat]Absence check using 181 positive place invariants in 79 ms returned sat
[2023-03-19 00:47:34] [INFO ] After 874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:47:34] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 1 ms to minimize.
[2023-03-19 00:47:35] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 1 ms to minimize.
[2023-03-19 00:47:35] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 1 ms to minimize.
[2023-03-19 00:47:35] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 1 ms to minimize.
[2023-03-19 00:47:35] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 1 ms to minimize.
[2023-03-19 00:47:36] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 15 ms to minimize.
[2023-03-19 00:47:36] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 1 ms to minimize.
[2023-03-19 00:47:36] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 1 ms to minimize.
[2023-03-19 00:47:37] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 0 ms to minimize.
[2023-03-19 00:47:37] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 0 ms to minimize.
[2023-03-19 00:47:37] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 1 ms to minimize.
[2023-03-19 00:47:37] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 0 ms to minimize.
[2023-03-19 00:47:38] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 0 ms to minimize.
[2023-03-19 00:47:38] [INFO ] Deduced a trap composed of 27 places in 330 ms of which 2 ms to minimize.
[2023-03-19 00:47:38] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 0 ms to minimize.
[2023-03-19 00:47:39] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 14 ms to minimize.
[2023-03-19 00:47:39] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 1 ms to minimize.
[2023-03-19 00:47:39] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 1 ms to minimize.
[2023-03-19 00:47:41] [INFO ] Deduced a trap composed of 29 places in 1253 ms of which 1 ms to minimize.
[2023-03-19 00:47:41] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2023-03-19 00:47:41] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 0 ms to minimize.
[2023-03-19 00:47:41] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 0 ms to minimize.
[2023-03-19 00:47:41] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 0 ms to minimize.
[2023-03-19 00:47:42] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 1 ms to minimize.
[2023-03-19 00:47:42] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 0 ms to minimize.
[2023-03-19 00:47:42] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 0 ms to minimize.
[2023-03-19 00:47:42] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 0 ms to minimize.
[2023-03-19 00:47:42] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2023-03-19 00:47:43] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2023-03-19 00:47:43] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2023-03-19 00:47:43] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 0 ms to minimize.
[2023-03-19 00:47:43] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 1 ms to minimize.
[2023-03-19 00:47:43] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2023-03-19 00:47:43] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2023-03-19 00:47:44] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2023-03-19 00:47:44] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 9709 ms
[2023-03-19 00:47:44] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 0 ms to minimize.
[2023-03-19 00:47:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-19 00:47:44] [INFO ] After 11034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-19 00:47:44] [INFO ] After 11654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 98 ms.
Support contains 5 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1181 transition count 846
Reduce places removed 235 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 238 rules applied. Total rules applied 473 place count 946 transition count 843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 476 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 476 place count 943 transition count 683
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 796 place count 783 transition count 683
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 1468 place count 447 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 447 transition count 346
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1471 place count 446 transition count 345
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1587 place count 388 transition count 383
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1588 place count 388 transition count 382
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 1607 place count 388 transition count 382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1608 place count 387 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1610 place count 385 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1610 place count 385 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1612 place count 384 transition count 380
Applied a total of 1612 rules in 97 ms. Remains 384 /1181 variables (removed 797) and now considering 380/1081 (removed 701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 384/1181 places, 380/1081 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 179212 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179212 steps, saw 102641 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 380 rows 384 cols
[2023-03-19 00:47:48] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-19 00:47:48] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:47:48] [INFO ] [Nat]Absence check using 179 positive place invariants in 43 ms returned sat
[2023-03-19 00:47:48] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:47:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:47:48] [INFO ] After 55ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:47:48] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-19 00:47:49] [INFO ] After 727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 384/384 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 49 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2023-03-19 00:47:49] [INFO ] Invariant cache hit.
[2023-03-19 00:47:49] [INFO ] Implicit Places using invariants in 311 ms returned [373]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 383/384 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 382 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 379
Applied a total of 2 rules in 19 ms. Remains 382 /383 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 382 cols
[2023-03-19 00:47:49] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:47:49] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-19 00:47:49] [INFO ] Invariant cache hit.
[2023-03-19 00:47:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:47:50] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 382/384 places, 379/380 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1576 ms. Remains : 382/384 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:47:50] [INFO ] Invariant cache hit.
[2023-03-19 00:47:50] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:51] [INFO ] [Nat]Absence check using 178 positive place invariants in 48 ms returned sat
[2023-03-19 00:47:51] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:47:51] [INFO ] After 27ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:51] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-19 00:47:51] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 379/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 382/382 places, 379/379 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 513128 steps, run timeout after 3012 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 513128 steps, saw 296641 distinct states, run finished after 3013 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:47:54] [INFO ] Invariant cache hit.
[2023-03-19 00:47:54] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:54] [INFO ] [Nat]Absence check using 178 positive place invariants in 24 ms returned sat
[2023-03-19 00:47:54] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:47:54] [INFO ] After 56ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:55] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 00:47:55] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 379/379 transitions.
Applied a total of 0 rules in 21 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 382/382 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 379/379 transitions.
Applied a total of 0 rules in 20 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-19 00:47:55] [INFO ] Invariant cache hit.
[2023-03-19 00:47:55] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-19 00:47:55] [INFO ] Invariant cache hit.
[2023-03-19 00:47:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:47:55] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2023-03-19 00:47:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 00:47:56] [INFO ] Invariant cache hit.
[2023-03-19 00:47:56] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1159 ms. Remains : 382/382 places, 379/379 transitions.
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 41 place count 382 transition count 379
Applied a total of 41 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 379 rows 382 cols
[2023-03-19 00:47:56] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:47:56] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:56] [INFO ] [Nat]Absence check using 178 positive place invariants in 26 ms returned sat
[2023-03-19 00:47:56] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-19 00:47:56] [INFO ] After 50ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:56] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-19 00:47:56] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p1 p0), true]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (OR (AND p0 p2) (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p2)]
Knowledge based reduction with 2 factoid took 469 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 638 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 635 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-19 00:47:58] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-19 00:47:59] [INFO ] [Real]Absence check using 181 positive place invariants in 220 ms returned sat
[2023-03-19 00:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:48:03] [INFO ] [Real]Absence check using state equation in 3891 ms returned sat
[2023-03-19 00:48:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:48:04] [INFO ] [Nat]Absence check using 181 positive place invariants in 136 ms returned sat
[2023-03-19 00:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:48:07] [INFO ] [Nat]Absence check using state equation in 3638 ms returned sat
[2023-03-19 00:48:08] [INFO ] Computed and/alt/rep : 1080/1621/1080 causal constraints (skipped 0 transitions) in 116 ms.
[2023-03-19 00:48:18] [INFO ] Added : 455 causal constraints over 91 iterations in 10372 ms. Result :unknown
Could not prove EG (NOT p2)
Support contains 5 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Applied a total of 0 rules in 66 ms. Remains 1181 /1181 variables (removed 0) and now considering 1081/1081 (removed 0) transitions.
[2023-03-19 00:48:18] [INFO ] Invariant cache hit.
[2023-03-19 00:48:18] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-19 00:48:18] [INFO ] Invariant cache hit.
[2023-03-19 00:48:19] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
[2023-03-19 00:48:19] [INFO ] Invariant cache hit.
[2023-03-19 00:48:20] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2321 ms. Remains : 1181/1181 places, 1081/1081 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 672 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-19 00:48:21] [INFO ] Invariant cache hit.
[2023-03-19 00:48:22] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 00:48:22] [INFO ] [Nat]Absence check using 181 positive place invariants in 64 ms returned sat
[2023-03-19 00:48:23] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 00:48:24] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 1 ms to minimize.
[2023-03-19 00:48:24] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 1 ms to minimize.
[2023-03-19 00:48:24] [INFO ] Deduced a trap composed of 22 places in 445 ms of which 0 ms to minimize.
[2023-03-19 00:48:25] [INFO ] Deduced a trap composed of 15 places in 348 ms of which 1 ms to minimize.
[2023-03-19 00:48:25] [INFO ] Deduced a trap composed of 19 places in 417 ms of which 1 ms to minimize.
[2023-03-19 00:48:25] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 1 ms to minimize.
[2023-03-19 00:48:26] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 1 ms to minimize.
[2023-03-19 00:48:26] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 1 ms to minimize.
[2023-03-19 00:48:26] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 0 ms to minimize.
[2023-03-19 00:48:27] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 1 ms to minimize.
[2023-03-19 00:48:27] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 1 ms to minimize.
[2023-03-19 00:48:27] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 1 ms to minimize.
[2023-03-19 00:48:28] [INFO ] Deduced a trap composed of 36 places in 314 ms of which 0 ms to minimize.
[2023-03-19 00:48:28] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 0 ms to minimize.
[2023-03-19 00:48:28] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 1 ms to minimize.
[2023-03-19 00:48:29] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 0 ms to minimize.
[2023-03-19 00:48:29] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 1 ms to minimize.
[2023-03-19 00:48:29] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 0 ms to minimize.
[2023-03-19 00:48:29] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 1 ms to minimize.
[2023-03-19 00:48:30] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 0 ms to minimize.
[2023-03-19 00:48:30] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 1 ms to minimize.
[2023-03-19 00:48:30] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 1 ms to minimize.
[2023-03-19 00:48:30] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 0 ms to minimize.
[2023-03-19 00:48:31] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 1 ms to minimize.
[2023-03-19 00:48:31] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 0 ms to minimize.
[2023-03-19 00:48:31] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 25 ms to minimize.
[2023-03-19 00:48:31] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 1 ms to minimize.
[2023-03-19 00:48:32] [INFO ] Deduced a trap composed of 34 places in 313 ms of which 1 ms to minimize.
[2023-03-19 00:48:32] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 0 ms to minimize.
[2023-03-19 00:48:32] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 0 ms to minimize.
[2023-03-19 00:48:32] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 1 ms to minimize.
[2023-03-19 00:48:33] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 0 ms to minimize.
[2023-03-19 00:48:33] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 1 ms to minimize.
[2023-03-19 00:48:33] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 1 ms to minimize.
[2023-03-19 00:48:34] [INFO ] Deduced a trap composed of 26 places in 302 ms of which 1 ms to minimize.
[2023-03-19 00:48:34] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2023-03-19 00:48:34] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 10708 ms
[2023-03-19 00:48:34] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 1 ms to minimize.
[2023-03-19 00:48:34] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2023-03-19 00:48:35] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 1 ms to minimize.
[2023-03-19 00:48:35] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 2 ms to minimize.
[2023-03-19 00:48:35] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 0 ms to minimize.
[2023-03-19 00:48:35] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2023-03-19 00:48:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1386 ms
[2023-03-19 00:48:36] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2023-03-19 00:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-19 00:48:36] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2023-03-19 00:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-19 00:48:36] [INFO ] After 13815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 406 ms.
[2023-03-19 00:48:37] [INFO ] After 14745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 227 ms.
Support contains 5 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1181 transition count 846
Reduce places removed 235 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 238 rules applied. Total rules applied 473 place count 946 transition count 843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 476 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 476 place count 943 transition count 683
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 796 place count 783 transition count 683
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 1468 place count 447 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 447 transition count 346
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1471 place count 446 transition count 345
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1587 place count 388 transition count 383
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1588 place count 388 transition count 382
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 1607 place count 388 transition count 382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1608 place count 387 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1610 place count 385 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1610 place count 385 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1612 place count 384 transition count 380
Applied a total of 1612 rules in 70 ms. Remains 384 /1181 variables (removed 797) and now considering 380/1081 (removed 701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 384/1181 places, 380/1081 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 380 rows 384 cols
[2023-03-19 00:48:37] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-19 00:48:37] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:48:37] [INFO ] [Nat]Absence check using 179 positive place invariants in 34 ms returned sat
[2023-03-19 00:48:38] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:48:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:48:38] [INFO ] After 68ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:48:38] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-19 00:48:38] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 64 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 8 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 384/384 places, 380/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:48:38] [INFO ] Invariant cache hit.
[2023-03-19 00:48:38] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:48:38] [INFO ] [Nat]Absence check using 179 positive place invariants in 22 ms returned sat
[2023-03-19 00:48:39] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:48:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:48:39] [INFO ] After 20ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:48:39] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-19 00:48:39] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 6 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 384/384 places, 380/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 507620 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 507620 steps, saw 290730 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:48:42] [INFO ] Invariant cache hit.
[2023-03-19 00:48:42] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:48:42] [INFO ] [Nat]Absence check using 179 positive place invariants in 166 ms returned sat
[2023-03-19 00:48:42] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:48:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:48:42] [INFO ] After 26ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:48:42] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 00:48:42] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 384/384 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 4 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2023-03-19 00:48:42] [INFO ] Invariant cache hit.
[2023-03-19 00:48:43] [INFO ] Implicit Places using invariants in 343 ms returned [373]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 383/384 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 382 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 379
Applied a total of 2 rules in 8 ms. Remains 382 /383 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 382 cols
[2023-03-19 00:48:43] [INFO ] Computed 178 place invariants in 45 ms
[2023-03-19 00:48:43] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-19 00:48:43] [INFO ] Invariant cache hit.
[2023-03-19 00:48:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:48:44] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 382/384 places, 379/380 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1263 ms. Remains : 382/384 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 546985 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 546985 steps, saw 316918 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:48:47] [INFO ] Invariant cache hit.
[2023-03-19 00:48:47] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:48:47] [INFO ] [Nat]Absence check using 178 positive place invariants in 43 ms returned sat
[2023-03-19 00:48:47] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:48:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:48:47] [INFO ] After 47ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:48:47] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-19 00:48:47] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 379/379 transitions.
Applied a total of 0 rules in 12 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 382/382 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 379/379 transitions.
Applied a total of 0 rules in 11 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-19 00:48:47] [INFO ] Invariant cache hit.
[2023-03-19 00:48:48] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-19 00:48:48] [INFO ] Invariant cache hit.
[2023-03-19 00:48:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:48:48] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2023-03-19 00:48:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 00:48:48] [INFO ] Invariant cache hit.
[2023-03-19 00:48:49] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1382 ms. Remains : 382/382 places, 379/379 transitions.
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 41 place count 382 transition count 379
Applied a total of 41 rules in 9 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 379 rows 382 cols
[2023-03-19 00:48:49] [INFO ] Computed 178 place invariants in 53 ms
[2023-03-19 00:48:49] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:48:49] [INFO ] [Nat]Absence check using 178 positive place invariants in 81 ms returned sat
[2023-03-19 00:48:49] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:48:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-19 00:48:49] [INFO ] After 69ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:48:49] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-19 00:48:49] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2) p1), true]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (OR (AND p0 p2) (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p2)]
Knowledge based reduction with 2 factoid took 453 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 724 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 618 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-19 00:48:51] [INFO ] Computed 181 place invariants in 20 ms
[2023-03-19 00:48:52] [INFO ] [Real]Absence check using 181 positive place invariants in 131 ms returned sat
[2023-03-19 00:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:48:56] [INFO ] [Real]Absence check using state equation in 3569 ms returned sat
[2023-03-19 00:48:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:48:56] [INFO ] [Nat]Absence check using 181 positive place invariants in 113 ms returned sat
[2023-03-19 00:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:48:59] [INFO ] [Nat]Absence check using state equation in 3157 ms returned sat
[2023-03-19 00:49:00] [INFO ] Computed and/alt/rep : 1080/1621/1080 causal constraints (skipped 0 transitions) in 128 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 00:49:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 601 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Product exploration explored 100000 steps with 1392 reset in 248 ms.
Product exploration explored 100000 steps with 1386 reset in 322 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 653 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1, (NOT p2)]
Support contains 5 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1181 transition count 1081
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 80 Pre rules applied. Total rules applied 238 place count 1181 transition count 1141
Deduced a syphon composed of 318 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 318 place count 1181 transition count 1141
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 715 places in 1 ms
Iterating global reduction 1 with 397 rules applied. Total rules applied 715 place count 1181 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 716 place count 1181 transition count 1140
Renaming transitions due to excessive name length > 1024 char.
Discarding 159 places :
Symmetric choice reduction at 2 with 159 rule applications. Total rules 875 place count 1022 transition count 981
Deduced a syphon composed of 556 places in 1 ms
Iterating global reduction 2 with 159 rules applied. Total rules applied 1034 place count 1022 transition count 981
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 557 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1035 place count 1022 transition count 981
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1037 place count 1020 transition count 979
Deduced a syphon composed of 555 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1039 place count 1020 transition count 979
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -410
Deduced a syphon composed of 632 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1116 place count 1020 transition count 1389
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1193 place count 943 transition count 1235
Deduced a syphon composed of 555 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1270 place count 943 transition count 1235
Deduced a syphon composed of 555 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1279 place count 943 transition count 1226
Deduced a syphon composed of 555 places in 0 ms
Applied a total of 1279 rules in 308 ms. Remains 943 /1181 variables (removed 238) and now considering 1226/1081 (removed -145) transitions.
[2023-03-19 00:49:13] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1226 rows 943 cols
[2023-03-19 00:49:13] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-19 00:49:14] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 943/1181 places, 1226/1081 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 919 ms. Remains : 943/1181 places, 1226/1081 transitions.
Built C files in :
/tmp/ltsmin15901719021987282062
[2023-03-19 00:49:14] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15901719021987282062
Running compilation step : cd /tmp/ltsmin15901719021987282062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1799 ms.
Running link step : cd /tmp/ltsmin15901719021987282062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin15901719021987282062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17659351953923316722.hoa' '--buchi-type=spotba'
LTSmin run took 753 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-15 finished in 110402 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(p0)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-020B-LTLCardinality-07
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1189/1189 places, 1089/1089 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1188 transition count 850
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 950 transition count 850
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 157 Pre rules applied. Total rules applied 476 place count 950 transition count 693
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 790 place count 793 transition count 693
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 797 place count 786 transition count 686
Iterating global reduction 2 with 7 rules applied. Total rules applied 804 place count 786 transition count 686
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 804 place count 786 transition count 680
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 816 place count 780 transition count 680
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1490 place count 443 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1491 place count 443 transition count 342
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1493 place count 442 transition count 341
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1611 place count 383 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1613 place count 381 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1615 place count 379 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1615 place count 379 transition count 377
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1617 place count 378 transition count 377
Applied a total of 1617 rules in 123 ms. Remains 378 /1189 variables (removed 811) and now considering 377/1089 (removed 712) transitions.
// Phase 1: matrix 377 rows 378 cols
[2023-03-19 00:49:17] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-19 00:49:20] [INFO ] Implicit Places using invariants in 3222 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3245 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 377/1189 places, 377/1089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 376 transition count 376
Applied a total of 2 rules in 12 ms. Remains 376 /377 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 376 cols
[2023-03-19 00:49:20] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:49:21] [INFO ] Implicit Places using invariants in 920 ms returned []
[2023-03-19 00:49:21] [INFO ] Invariant cache hit.
[2023-03-19 00:49:22] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 376/1189 places, 376/1089 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5011 ms. Remains : 376/1189 places, 376/1089 transitions.
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s67 0) (EQ s348 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 66454 steps with 0 reset in 309 ms.
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-07 finished in 5642 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 00:49:22] [INFO ] Flatten gal took : 26 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 303084 ms.

BK_STOP 1679186962995

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-020B, 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 r389-oct2-167903713400283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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