Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 13:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 13:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 185K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653020656048

Running Version 202205111006
[2022-05-20 04:24:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 04:24:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 04:24:17] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2022-05-20 04:24:17] [INFO ] Transformed 783 places.
[2022-05-20 04:24:17] [INFO ] Transformed 713 transitions.
[2022-05-20 04:24:17] [INFO ] Found NUPN structural information;
[2022-05-20 04:24:17] [INFO ] Parsed PT model containing 783 places and 713 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 106 place count 677 transition count 607
Iterating global reduction 0 with 106 rules applied. Total rules applied 212 place count 677 transition count 607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 213 place count 676 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 214 place count 676 transition count 606
Applied a total of 214 rules in 168 ms. Remains 676 /783 variables (removed 107) and now considering 606/713 (removed 107) transitions.
// Phase 1: matrix 606 rows 676 cols
[2022-05-20 04:24:17] [INFO ] Computed 111 place invariants in 29 ms
[2022-05-20 04:24:18] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 606 rows 676 cols
[2022-05-20 04:24:18] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-20 04:24:18] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
// Phase 1: matrix 606 rows 676 cols
[2022-05-20 04:24:18] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:24:18] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 676/783 places, 606/713 transitions.
Finished structural reductions, in 1 iterations. Remains : 676/783 places, 606/713 transitions.
Support contains 23 out of 676 places after structural reductions.
[2022-05-20 04:24:19] [INFO ] Flatten gal took : 69 ms
[2022-05-20 04:24:19] [INFO ] Flatten gal took : 34 ms
[2022-05-20 04:24:19] [INFO ] Input system was already deterministic with 606 transitions.
Support contains 21 out of 676 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 606 rows 676 cols
[2022-05-20 04:24:19] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-20 04:24:19] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 04:24:20] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2022-05-20 04:24:20] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-20 04:24:20] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 3 ms to minimize.
[2022-05-20 04:24:20] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2022-05-20 04:24:20] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-05-20 04:24:20] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2022-05-20 04:24:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1355 ms
[2022-05-20 04:24:21] [INFO ] After 1812ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-05-20 04:24:22] [INFO ] After 2151ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 7 out of 676 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 676/676 places, 606/606 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 676 transition count 473
Reduce places removed 133 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 136 rules applied. Total rules applied 269 place count 543 transition count 470
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 272 place count 540 transition count 470
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 272 place count 540 transition count 391
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 430 place count 461 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 432 place count 459 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 434 place count 459 transition count 389
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 434 place count 459 transition count 387
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 438 place count 457 transition count 387
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 1 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 776 place count 288 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 288 transition count 217
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 779 place count 287 transition count 216
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 833 place count 260 transition count 216
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 834 place count 260 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 835 place count 259 transition count 215
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 862 place count 259 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 863 place count 258 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 864 place count 257 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 864 place count 257 transition count 212
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 868 place count 255 transition count 212
Applied a total of 868 rules in 135 ms. Remains 255 /676 variables (removed 421) and now considering 212/606 (removed 394) transitions.
Finished structural reductions, in 1 iterations. Remains : 255/676 places, 212/606 transitions.
Finished random walk after 9468 steps, including 2 resets, run visited all 4 properties in 95 ms. (steps per millisecond=99 )
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 159 stabilizing places and 159 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 676 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 676/676 places, 606/606 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 671 transition count 601
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 671 transition count 601
Applied a total of 10 rules in 68 ms. Remains 671 /676 variables (removed 5) and now considering 601/606 (removed 5) transitions.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:24:22] [INFO ] Computed 111 place invariants in 7 ms
[2022-05-20 04:24:22] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:24:22] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:24:23] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:24:23] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:24:23] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/676 places, 601/606 transitions.
Finished structural reductions, in 1 iterations. Remains : 671/676 places, 601/606 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-00 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:(NEQ s581 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 33333 reset in 398 ms.
Product exploration explored 100000 steps with 33333 reset in 331 ms.
Computed a total of 158 stabilizing places and 158 stable transitions
Computed a total of 158 stabilizing places and 158 stable transitions
Detected a total of 158/671 stabilizing places and 158/601 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-00 finished in 1932 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U !F((X(p1)&&G(p0)))))'
Support contains 4 out of 676 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 676/676 places, 606/606 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 673 transition count 603
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 673 transition count 603
Applied a total of 6 rules in 25 ms. Remains 673 /676 variables (removed 3) and now considering 603/606 (removed 3) transitions.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:24:24] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-20 04:24:24] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:24:24] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:24:25] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:24:25] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:24:25] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 673/676 places, 603/606 transitions.
Finished structural reductions, in 1 iterations. Remains : 673/676 places, 603/606 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s640 0) (EQ s138 1)), p1:(OR (EQ s99 0) (EQ s670 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20079 reset in 296 ms.
Product exploration explored 100000 steps with 20016 reset in 268 ms.
Computed a total of 159 stabilizing places and 159 stable transitions
Computed a total of 159 stabilizing places and 159 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X p0), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 457 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 237 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:24:26] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:24:27] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 04:24:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2022-05-20 04:24:27] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 04:24:27] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2022-05-20 04:24:27] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2022-05-20 04:24:27] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2022-05-20 04:24:27] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2022-05-20 04:24:28] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2022-05-20 04:24:28] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2022-05-20 04:24:28] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2022-05-20 04:24:28] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-05-20 04:24:28] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2022-05-20 04:24:28] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2022-05-20 04:24:28] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-05-20 04:24:28] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2022-05-20 04:24:29] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-20 04:24:29] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2022-05-20 04:24:29] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-20 04:24:29] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2022-05-20 04:24:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1919 ms
[2022-05-20 04:24:29] [INFO ] After 2217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-20 04:24:29] [INFO ] After 2399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 673/673 places, 603/603 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 673 transition count 466
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 536 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 535 transition count 465
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 276 place count 535 transition count 385
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 436 place count 455 transition count 385
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 774 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 775 place count 286 transition count 215
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 777 place count 285 transition count 214
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 833 place count 257 transition count 214
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 862 place count 257 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 863 place count 256 transition count 213
Applied a total of 863 rules in 69 ms. Remains 256 /673 variables (removed 417) and now considering 213/603 (removed 390) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/673 places, 213/603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 291012 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 291012 steps, saw 215162 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 213 rows 256 cols
[2022-05-20 04:24:32] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:24:32] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 04:24:32] [INFO ] [Nat]Absence check using 111 positive place invariants in 11 ms returned sat
[2022-05-20 04:24:32] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 04:24:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 04:24:32] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 04:24:32] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-20 04:24:33] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 213/213 transitions.
Applied a total of 0 rules in 17 ms. Remains 256 /256 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 213/213 transitions.
Applied a total of 0 rules in 10 ms. Remains 256 /256 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 256 cols
[2022-05-20 04:24:33] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:24:33] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 213 rows 256 cols
[2022-05-20 04:24:33] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:24:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 04:24:33] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2022-05-20 04:24:33] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 213 rows 256 cols
[2022-05-20 04:24:33] [INFO ] Computed 111 place invariants in 0 ms
[2022-05-20 04:24:33] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 213/213 transitions.
Graph (complete) has 652 edges and 256 vertex of which 255 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 255 transition count 211
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 253 transition count 211
Partial Free-agglomeration rule applied 56 times.
Drop transitions removed 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 61 place count 253 transition count 211
Applied a total of 61 rules in 28 ms. Remains 253 /256 variables (removed 3) and now considering 211/213 (removed 2) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 211 rows 253 cols
[2022-05-20 04:24:33] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-20 04:24:33] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 04:24:33] [INFO ] [Nat]Absence check using 110 positive place invariants in 13 ms returned sat
[2022-05-20 04:24:33] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 04:24:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-20 04:24:33] [INFO ] After 36ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 04:24:33] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 12 ms to minimize.
[2022-05-20 04:24:33] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2022-05-20 04:24:34] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2022-05-20 04:24:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 209 ms
[2022-05-20 04:24:34] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 04:24:34] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 04:24:34] [INFO ] Flatten gal took : 15 ms
[2022-05-20 04:24:34] [INFO ] Flatten gal took : 14 ms
[2022-05-20 04:24:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3920169941340702321.gal : 10 ms
[2022-05-20 04:24:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15448208298664503507.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15257119810479557481;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3920169941340702321.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15448208298664503507.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality15448208298664503507.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 27
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :27 after 62
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :62 after 226
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :226 after 8540
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8540 after 53274
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :53274 after 2.00307e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.00307e+06 after 1.32107e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.32107e+07 after 5.4911e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.4911e+08 after 1.63879e+10
Detected timeout of ITS tools.
[2022-05-20 04:24:49] [INFO ] Flatten gal took : 21 ms
[2022-05-20 04:24:49] [INFO ] Applying decomposition
[2022-05-20 04:24:49] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10912705020850944612.txt' '-o' '/tmp/graph10912705020850944612.bin' '-w' '/tmp/graph10912705020850944612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10912705020850944612.bin' '-l' '-1' '-v' '-w' '/tmp/graph10912705020850944612.weights' '-q' '0' '-e' '0.001'
[2022-05-20 04:24:49] [INFO ] Decomposing Gal with order
[2022-05-20 04:24:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 04:24:49] [INFO ] Removed a total of 53 redundant transitions.
[2022-05-20 04:24:49] [INFO ] Flatten gal took : 79 ms
[2022-05-20 04:24:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 5 ms.
[2022-05-20 04:24:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7012765652280021418.gal : 5 ms
[2022-05-20 04:24:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16756876346594990616.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15257119810479557481;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7012765652280021418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16756876346594990616.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality16756876346594990616.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 187
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.04767e+07,0.076399,6704,640,174,4048,529,405,7974,111,2392,0
Total reachable state count : 10476699

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,159552,0.077319,6704,236,110,4048,529,428,7974,120,2392,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,159552,0.077685,6704,236,110,4048,529,428,7974,120,2392,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X p0), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 540 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 201 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Stuttering acceptance computed with spot in 193 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:24:50] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:24:50] [INFO ] [Real]Absence check using 111 positive place invariants in 61 ms returned sat
[2022-05-20 04:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 04:24:51] [INFO ] [Real]Absence check using state equation in 1000 ms returned sat
[2022-05-20 04:24:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 04:24:52] [INFO ] [Nat]Absence check using 111 positive place invariants in 50 ms returned sat
[2022-05-20 04:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 04:24:53] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2022-05-20 04:24:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2022-05-20 04:24:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-20 04:24:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2022-05-20 04:24:53] [INFO ] Computed and/alt/rep : 602/893/602 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-20 04:25:01] [INFO ] Added : 602 causal constraints over 121 iterations in 8476 ms. Result :sat
Could not prove EG (AND p0 p1)
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Applied a total of 0 rules in 18 ms. Remains 673 /673 variables (removed 0) and now considering 603/603 (removed 0) transitions.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:25:01] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:25:02] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:25:02] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:25:02] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:25:02] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:25:02] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 673/673 places, 603/603 transitions.
Computed a total of 159 stabilizing places and 159 stable transitions
Computed a total of 159 stabilizing places and 159 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X p0), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 438 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 216 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:25:03] [INFO ] Computed 111 place invariants in 6 ms
[2022-05-20 04:25:03] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 04:25:04] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2022-05-20 04:25:04] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 04:25:04] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2022-05-20 04:25:04] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2022-05-20 04:25:04] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2022-05-20 04:25:04] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2022-05-20 04:25:04] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2022-05-20 04:25:05] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2022-05-20 04:25:05] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2022-05-20 04:25:05] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 0 ms to minimize.
[2022-05-20 04:25:05] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2022-05-20 04:25:05] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2022-05-20 04:25:05] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-20 04:25:05] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2022-05-20 04:25:05] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2022-05-20 04:25:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1614 ms
[2022-05-20 04:25:06] [INFO ] After 1976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-20 04:25:06] [INFO ] After 2206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 673/673 places, 603/603 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 673 transition count 466
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 536 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 535 transition count 465
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 276 place count 535 transition count 385
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 436 place count 455 transition count 385
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 774 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 775 place count 286 transition count 215
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 777 place count 285 transition count 214
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 833 place count 257 transition count 214
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 862 place count 257 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 863 place count 256 transition count 213
Applied a total of 863 rules in 46 ms. Remains 256 /673 variables (removed 417) and now considering 213/603 (removed 390) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/673 places, 213/603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Finished Best-First random walk after 7552 steps, including 2 resets, run visited all 2 properties in 28 ms. (steps per millisecond=269 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X p0), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 503 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 176 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Stuttering acceptance computed with spot in 174 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:25:07] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:25:07] [INFO ] [Real]Absence check using 111 positive place invariants in 47 ms returned sat
[2022-05-20 04:25:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 04:25:08] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2022-05-20 04:25:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 04:25:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 49 ms returned sat
[2022-05-20 04:25:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 04:25:09] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2022-05-20 04:25:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2022-05-20 04:25:09] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 7 ms to minimize.
[2022-05-20 04:25:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2022-05-20 04:25:10] [INFO ] Computed and/alt/rep : 602/893/602 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-20 04:25:18] [INFO ] Added : 602 causal constraints over 121 iterations in 8444 ms. Result :sat
Could not prove EG (AND p0 p1)
Stuttering acceptance computed with spot in 176 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Product exploration explored 100000 steps with 19913 reset in 216 ms.
Product exploration explored 100000 steps with 20058 reset in 263 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 207 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 673 transition count 603
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 138 place count 673 transition count 644
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 190 place count 673 transition count 644
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 377 places in 1 ms
Iterating global reduction 1 with 187 rules applied. Total rules applied 377 place count 673 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 378 place count 673 transition count 643
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 448 place count 603 transition count 573
Deduced a syphon composed of 307 places in 1 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 518 place count 603 transition count 573
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 308 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 519 place count 603 transition count 573
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 521 place count 601 transition count 571
Deduced a syphon composed of 306 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 523 place count 601 transition count 571
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -159
Deduced a syphon composed of 344 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 561 place count 601 transition count 730
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 600 place count 562 transition count 652
Deduced a syphon composed of 305 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 639 place count 562 transition count 652
Deduced a syphon composed of 305 places in 0 ms
Applied a total of 639 rules in 177 ms. Remains 562 /673 variables (removed 111) and now considering 652/603 (removed -49) transitions.
[2022-05-20 04:25:19] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 652 rows 562 cols
[2022-05-20 04:25:19] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:25:19] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/673 places, 652/603 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/673 places, 652/603 transitions.
Product exploration explored 100000 steps with 21017 reset in 1122 ms.
Product exploration explored 100000 steps with 21149 reset in 1049 ms.
Built C files in :
/tmp/ltsmin16652025284025877465
[2022-05-20 04:25:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16652025284025877465
Running compilation step : cd /tmp/ltsmin16652025284025877465;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 902 ms.
Running link step : cd /tmp/ltsmin16652025284025877465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16652025284025877465;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12505988608849007683.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 603/603 transitions.
Applied a total of 0 rules in 21 ms. Remains 673 /673 variables (removed 0) and now considering 603/603 (removed 0) transitions.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:25:37] [INFO ] Computed 111 place invariants in 6 ms
[2022-05-20 04:25:37] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:25:37] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:25:37] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:25:37] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:25:38] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 673/673 places, 603/603 transitions.
Built C files in :
/tmp/ltsmin8822388092958207936
[2022-05-20 04:25:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8822388092958207936
Running compilation step : cd /tmp/ltsmin8822388092958207936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 843 ms.
Running link step : cd /tmp/ltsmin8822388092958207936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8822388092958207936;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15695691459394781242.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 04:25:53] [INFO ] Flatten gal took : 23 ms
[2022-05-20 04:25:53] [INFO ] Flatten gal took : 22 ms
[2022-05-20 04:25:53] [INFO ] Time to serialize gal into /tmp/LTL14680561637429041105.gal : 3 ms
[2022-05-20 04:25:53] [INFO ] Time to serialize properties into /tmp/LTL3717111275167910049.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14680561637429041105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3717111275167910049.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1468056...267
Read 1 LTL properties
Checking formula 0 : !(((("((p738==0)||(p157==1))")U("((p110==0)||(p778==1))"))U(!(F((X("((p110==0)||(p778==1))"))&&(G("((p738==0)||(p157==1))")))))))
Formula 0 simplified : !(("((p738==0)||(p157==1))" U "((p110==0)||(p778==1))") U !F(X"((p110==0)||(p778==1))" & G"((p738==0)||(p157==1))"))
Detected timeout of ITS tools.
[2022-05-20 04:26:08] [INFO ] Flatten gal took : 25 ms
[2022-05-20 04:26:08] [INFO ] Applying decomposition
[2022-05-20 04:26:08] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11368367399448891028.txt' '-o' '/tmp/graph11368367399448891028.bin' '-w' '/tmp/graph11368367399448891028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11368367399448891028.bin' '-l' '-1' '-v' '-w' '/tmp/graph11368367399448891028.weights' '-q' '0' '-e' '0.001'
[2022-05-20 04:26:08] [INFO ] Decomposing Gal with order
[2022-05-20 04:26:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 04:26:08] [INFO ] Removed a total of 99 redundant transitions.
[2022-05-20 04:26:08] [INFO ] Flatten gal took : 44 ms
[2022-05-20 04:26:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 04:26:08] [INFO ] Time to serialize gal into /tmp/LTL13624282775181052020.gal : 7 ms
[2022-05-20 04:26:08] [INFO ] Time to serialize properties into /tmp/LTL10970422470957883018.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13624282775181052020.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10970422470957883018.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1362428...247
Read 1 LTL properties
Checking formula 0 : !(((("((i18.u226.p738==0)||(i3.u49.p157==1))")U("((i3.u35.p110==0)||(i18.u236.p778==1))"))U(!(F((X("((i3.u35.p110==0)||(i18.u236.p778=...214
Formula 0 simplified : !(("((i18.u226.p738==0)||(i3.u49.p157==1))" U "((i3.u35.p110==0)||(i18.u236.p778==1))") U !F(X"((i3.u35.p110==0)||(i18.u236.p778==1)...203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17420302778432787905
[2022-05-20 04:26:23] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17420302778432787905
Running compilation step : cd /tmp/ltsmin17420302778432787905;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 839 ms.
Running link step : cd /tmp/ltsmin17420302778432787905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17420302778432787905;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true)) U !<>((X((LTLAPp1==true))&&[]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-01 finished in 134285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 676 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 676/676 places, 606/606 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 671 transition count 601
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 671 transition count 601
Applied a total of 10 rules in 30 ms. Remains 671 /676 variables (removed 5) and now considering 601/606 (removed 5) transitions.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:26:38] [INFO ] Computed 111 place invariants in 6 ms
[2022-05-20 04:26:38] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:26:38] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:26:39] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:26:39] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:26:39] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/676 places, 601/606 transitions.
Finished structural reductions, in 1 iterations. Remains : 671/676 places, 601/606 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s463 0) (EQ s235 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 13 reset in 284 ms.
Stack based approach found an accepted trace after 1001 steps with 0 reset with depth 1002 and stack size 1002 in 3 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-02 finished in 1308 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((F(p0) U p0)&&F(p1)&&X(G(p2))))))'
Support contains 5 out of 676 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 676/676 places, 606/606 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 673 transition count 603
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 673 transition count 603
Applied a total of 6 rules in 27 ms. Remains 673 /676 variables (removed 3) and now considering 603/606 (removed 3) transitions.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:26:40] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-20 04:26:40] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:26:40] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-20 04:26:40] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 673 cols
[2022-05-20 04:26:40] [INFO ] Computed 111 place invariants in 6 ms
[2022-05-20 04:26:40] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 673/676 places, 603/606 transitions.
Finished structural reductions, in 1 iterations. Remains : 673/676 places, 603/606 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s512 0) (EQ s116 1)), p1:(AND (NEQ s354 0) (NEQ s270 1)), p2:(EQ s320 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 93 reset in 275 ms.
Stack based approach found an accepted trace after 297 steps with 0 reset with depth 298 and stack size 298 in 1 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-04 finished in 1458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 676 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 676/676 places, 606/606 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 675 transition count 466
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 536 transition count 466
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 278 place count 536 transition count 388
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 434 place count 458 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 436 place count 456 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 456 transition count 386
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 438 place count 456 transition count 384
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 442 place count 454 transition count 384
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 784 place count 283 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 785 place count 283 transition count 212
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 787 place count 282 transition count 211
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 845 place count 253 transition count 211
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 847 place count 251 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 848 place count 250 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 848 place count 250 transition count 207
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 852 place count 248 transition count 207
Applied a total of 852 rules in 152 ms. Remains 248 /676 variables (removed 428) and now considering 207/606 (removed 399) transitions.
// Phase 1: matrix 207 rows 248 cols
[2022-05-20 04:26:41] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-20 04:26:41] [INFO ] Implicit Places using invariants in 116 ms returned [231, 235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 118 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/676 places, 207/606 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 205
Applied a total of 4 rules in 37 ms. Remains 244 /246 variables (removed 2) and now considering 205/207 (removed 2) transitions.
// Phase 1: matrix 205 rows 244 cols
[2022-05-20 04:26:41] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 04:26:41] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 205 rows 244 cols
[2022-05-20 04:26:41] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 04:26:42] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 244/676 places, 205/606 transitions.
Finished structural reductions, in 2 iterations. Remains : 244/676 places, 205/606 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 311 reset in 299 ms.
Stack based approach found an accepted trace after 2028 steps with 5 reset with depth 652 and stack size 635 in 16 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-06 finished in 1264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 2 out of 676 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 676/676 places, 606/606 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 675 transition count 467
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 537 transition count 467
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 276 place count 537 transition count 388
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 434 place count 458 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 436 place count 456 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 456 transition count 386
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 438 place count 456 transition count 384
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 442 place count 454 transition count 384
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 1 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 780 place count 285 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 781 place count 285 transition count 214
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 783 place count 284 transition count 213
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 841 place count 255 transition count 213
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 843 place count 253 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 844 place count 252 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 844 place count 252 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 848 place count 250 transition count 209
Applied a total of 848 rules in 80 ms. Remains 250 /676 variables (removed 426) and now considering 209/606 (removed 397) transitions.
// Phase 1: matrix 209 rows 250 cols
[2022-05-20 04:26:42] [INFO ] Computed 110 place invariants in 2 ms
[2022-05-20 04:26:42] [INFO ] Implicit Places using invariants in 129 ms returned [233, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 131 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/676 places, 209/606 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 208
Applied a total of 2 rules in 7 ms. Remains 247 /248 variables (removed 1) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 247 cols
[2022-05-20 04:26:42] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 04:26:43] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 208 rows 247 cols
[2022-05-20 04:26:43] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 04:26:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 04:26:43] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/676 places, 208/606 transitions.
Finished structural reductions, in 2 iterations. Remains : 247/676 places, 208/606 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s234 0) (NEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7706 reset in 303 ms.
Stack based approach found an accepted trace after 1718 steps with 125 reset with depth 14 and stack size 14 in 6 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-07 finished in 925 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 3 out of 676 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 676/676 places, 606/606 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 675 transition count 467
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 537 transition count 467
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 276 place count 537 transition count 388
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 434 place count 458 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 436 place count 456 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 456 transition count 386
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 438 place count 456 transition count 384
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 442 place count 454 transition count 384
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 780 place count 285 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 781 place count 285 transition count 214
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 783 place count 284 transition count 213
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 839 place count 256 transition count 213
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 841 place count 254 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 842 place count 253 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 842 place count 253 transition count 209
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 846 place count 251 transition count 209
Applied a total of 846 rules in 63 ms. Remains 251 /676 variables (removed 425) and now considering 209/606 (removed 397) transitions.
// Phase 1: matrix 209 rows 251 cols
[2022-05-20 04:26:43] [INFO ] Computed 110 place invariants in 1 ms
[2022-05-20 04:26:43] [INFO ] Implicit Places using invariants in 124 ms returned [234, 238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 125 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/676 places, 209/606 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 247 transition count 207
Applied a total of 4 rules in 7 ms. Remains 247 /249 variables (removed 2) and now considering 207/209 (removed 2) transitions.
// Phase 1: matrix 207 rows 247 cols
[2022-05-20 04:26:43] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 04:26:44] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 207 rows 247 cols
[2022-05-20 04:26:44] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 04:26:44] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 247/676 places, 207/606 transitions.
Finished structural reductions, in 2 iterations. Remains : 247/676 places, 207/606 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s224 1), p0:(OR (EQ s6 0) (EQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 11560 steps with 0 reset in 41 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-12 finished in 643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 676 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 676/676 places, 606/606 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 671 transition count 601
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 671 transition count 601
Applied a total of 10 rules in 32 ms. Remains 671 /676 variables (removed 5) and now considering 601/606 (removed 5) transitions.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:26:44] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-20 04:26:44] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:26:44] [INFO ] Computed 111 place invariants in 7 ms
[2022-05-20 04:26:44] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2022-05-20 04:26:44] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-20 04:26:45] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 671/676 places, 601/606 transitions.
Finished structural reductions, in 1 iterations. Remains : 671/676 places, 601/606 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s126 0) (NEQ s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-15 finished in 977 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U !F((X(p1)&&G(p0)))))'
Found a SL insensitive property : ShieldPPPt-PT-010B-LTLCardinality-01
Stuttering acceptance computed with spot in 212 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Support contains 4 out of 676 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 676/676 places, 606/606 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 675 transition count 467
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 537 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 536 transition count 466
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 278 place count 536 transition count 388
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 434 place count 458 transition count 388
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 435 place count 457 transition count 387
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 457 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 436 place count 457 transition count 386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 438 place count 456 transition count 386
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 776 place count 287 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 287 transition count 216
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 779 place count 286 transition count 215
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 835 place count 258 transition count 215
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 837 place count 256 transition count 213
Applied a total of 837 rules in 40 ms. Remains 256 /676 variables (removed 420) and now considering 213/606 (removed 393) transitions.
// Phase 1: matrix 213 rows 256 cols
[2022-05-20 04:26:45] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:26:45] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 213 rows 256 cols
[2022-05-20 04:26:45] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:26:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 04:26:45] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 256 cols
[2022-05-20 04:26:45] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-20 04:26:46] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 256/676 places, 213/606 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/676 places, 213/606 transitions.
Running random walk in product with property : ShieldPPPt-PT-010B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s246 0) (EQ s51 1)), p1:(OR (EQ s35 0) (EQ s255 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16881 reset in 295 ms.
Stack based approach found an accepted trace after 18590 steps with 3135 reset with depth 13 and stack size 13 in 62 ms.
Treatment of property ShieldPPPt-PT-010B-LTLCardinality-01 finished in 1117 ms.
FORMULA ShieldPPPt-PT-010B-LTLCardinality-01 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-20 04:26:46] [INFO ] Flatten gal took : 19 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 149270 ms.

BK_STOP 1653020806550

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-010B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025500619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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