Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 376K May 5 16:52 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-020B-00
FORMULA_NAME ShieldPPPt-PT-020B-01
FORMULA_NAME ShieldPPPt-PT-020B-02
FORMULA_NAME ShieldPPPt-PT-020B-03
FORMULA_NAME ShieldPPPt-PT-020B-04
FORMULA_NAME ShieldPPPt-PT-020B-05
FORMULA_NAME ShieldPPPt-PT-020B-06
FORMULA_NAME ShieldPPPt-PT-020B-07
FORMULA_NAME ShieldPPPt-PT-020B-08
FORMULA_NAME ShieldPPPt-PT-020B-09
FORMULA_NAME ShieldPPPt-PT-020B-10
FORMULA_NAME ShieldPPPt-PT-020B-11
FORMULA_NAME ShieldPPPt-PT-020B-12
FORMULA_NAME ShieldPPPt-PT-020B-13
FORMULA_NAME ShieldPPPt-PT-020B-14
FORMULA_NAME ShieldPPPt-PT-020B-15

=== Now, execution of the tool begins

BK_START 1621178525091

Running Version 0
[2021-05-16 15:22:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2021-05-16 15:22:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:22:06] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2021-05-16 15:22:06] [INFO ] Transformed 1563 places.
[2021-05-16 15:22:06] [INFO ] Transformed 1423 transitions.
[2021-05-16 15:22:06] [INFO ] Found NUPN structural information;
[2021-05-16 15:22:06] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:22:07] [INFO ] Initial state test concluded for 1 properties.
Support contains 49 out of 1563 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 213 places :
Symmetric choice reduction at 0 with 213 rule applications. Total rules 213 place count 1350 transition count 1210
Iterating global reduction 0 with 213 rules applied. Total rules applied 426 place count 1350 transition count 1210
Applied a total of 426 rules in 319 ms. Remains 1350 /1563 variables (removed 213) and now considering 1210/1423 (removed 213) transitions.
// Phase 1: matrix 1210 rows 1350 cols
[2021-05-16 15:22:07] [INFO ] Computed 221 place invariants in 31 ms
[2021-05-16 15:22:08] [INFO ] Implicit Places using invariants in 553 ms returned []
// Phase 1: matrix 1210 rows 1350 cols
[2021-05-16 15:22:08] [INFO ] Computed 221 place invariants in 15 ms
[2021-05-16 15:22:08] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
// Phase 1: matrix 1210 rows 1350 cols
[2021-05-16 15:22:09] [INFO ] Computed 221 place invariants in 7 ms
[2021-05-16 15:22:09] [INFO ] Dead Transitions using invariants and state equation in 653 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1350/1563 places, 1210/1423 transitions.
[2021-05-16 15:22:09] [INFO ] Flatten gal took : 168 ms
[2021-05-16 15:22:10] [INFO ] Flatten gal took : 66 ms
[2021-05-16 15:22:10] [INFO ] Input system was already deterministic with 1210 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 767 ms. (steps per millisecond=130 ) properties (out of 38) seen :37
Running SMT prover for 1 properties.
// Phase 1: matrix 1210 rows 1350 cols
[2021-05-16 15:22:11] [INFO ] Computed 221 place invariants in 5 ms
[2021-05-16 15:22:11] [INFO ] [Real]Absence check using 221 positive place invariants in 62 ms returned sat
[2021-05-16 15:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:11] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2021-05-16 15:22:12] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 6 ms to minimize.
[2021-05-16 15:22:12] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 1 ms to minimize.
[2021-05-16 15:22:12] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 2 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 2 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 2 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 1 ms to minimize.
[2021-05-16 15:22:14] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 9 ms to minimize.
[2021-05-16 15:22:14] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 1 ms to minimize.
[2021-05-16 15:22:14] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 1 ms to minimize.
[2021-05-16 15:22:14] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 1 ms to minimize.
[2021-05-16 15:22:15] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 0 ms to minimize.
[2021-05-16 15:22:15] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 1 ms to minimize.
[2021-05-16 15:22:15] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 0 ms to minimize.
[2021-05-16 15:22:15] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 0 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 2 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 0 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 9 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 0 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6634 ms
[2021-05-16 15:22:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:22:18] [INFO ] [Nat]Absence check using 221 positive place invariants in 56 ms returned sat
[2021-05-16 15:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:19] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2021-05-16 15:22:19] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 1 ms to minimize.
[2021-05-16 15:22:19] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 1 ms to minimize.
[2021-05-16 15:22:20] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 1 ms to minimize.
[2021-05-16 15:22:20] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 1 ms to minimize.
[2021-05-16 15:22:20] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 4 ms to minimize.
[2021-05-16 15:22:20] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 1 ms to minimize.
[2021-05-16 15:22:21] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 0 ms to minimize.
[2021-05-16 15:22:21] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 1 ms to minimize.
[2021-05-16 15:22:21] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 1 ms to minimize.
[2021-05-16 15:22:21] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 1 ms to minimize.
[2021-05-16 15:22:22] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 2 ms to minimize.
[2021-05-16 15:22:22] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 1 ms to minimize.
[2021-05-16 15:22:22] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2021-05-16 15:22:22] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2021-05-16 15:22:23] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 1 ms to minimize.
[2021-05-16 15:22:23] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 0 ms to minimize.
[2021-05-16 15:22:23] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2021-05-16 15:22:23] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2021-05-16 15:22:23] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2021-05-16 15:22:24] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2021-05-16 15:22:24] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2021-05-16 15:22:24] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 0 ms to minimize.
[2021-05-16 15:22:24] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2021-05-16 15:22:24] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 1 ms to minimize.
[2021-05-16 15:22:24] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2021-05-16 15:22:25] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2021-05-16 15:22:25] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2021-05-16 15:22:25] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2021-05-16 15:22:25] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6081 ms
[2021-05-16 15:22:25] [INFO ] Computed and/alt/rep : 1209/1792/1209 causal constraints (skipped 0 transitions) in 78 ms.
[2021-05-16 15:22:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1344 transition count 1204
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1342 transition count 1202
Applied a total of 16 rules in 197 ms. Remains 1342 /1350 variables (removed 8) and now considering 1202/1210 (removed 8) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:22:38] [INFO ] Computed 221 place invariants in 4 ms
[2021-05-16 15:22:39] [INFO ] Implicit Places using invariants in 454 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:22:39] [INFO ] Computed 221 place invariants in 5 ms
[2021-05-16 15:22:40] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:22:40] [INFO ] Computed 221 place invariants in 4 ms
[2021-05-16 15:22:40] [INFO ] Dead Transitions using invariants and state equation in 613 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1342/1350 places, 1202/1210 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s1178 0), p1:(NEQ s476 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 101 reset in 636 ms.
Stack based approach found an accepted trace after 2220 steps with 2 reset with depth 488 and stack size 488 in 12 ms.
FORMULA ShieldPPPt-PT-020B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-00 finished in 3112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((G(p1)||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1349 transition count 929
Reduce places removed 280 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 283 rules applied. Total rules applied 563 place count 1069 transition count 926
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 565 place count 1067 transition count 926
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 565 place count 1067 transition count 769
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 879 place count 910 transition count 769
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 886 place count 903 transition count 762
Iterating global reduction 3 with 7 rules applied. Total rules applied 893 place count 903 transition count 762
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 893 place count 903 transition count 757
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 903 place count 898 transition count 757
Performed 331 Post agglomeration using F-continuation condition.Transition count delta: 331
Deduced a syphon composed of 331 places in 1 ms
Reduce places removed 331 places and 0 transitions.
Iterating global reduction 3 with 662 rules applied. Total rules applied 1565 place count 567 transition count 426
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1683 place count 508 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1684 place count 507 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1685 place count 506 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1685 place count 506 transition count 423
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 1689 place count 504 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1690 place count 503 transition count 422
Applied a total of 1690 rules in 302 ms. Remains 503 /1350 variables (removed 847) and now considering 422/1210 (removed 788) transitions.
// Phase 1: matrix 422 rows 503 cols
[2021-05-16 15:22:42] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:22:42] [INFO ] Implicit Places using invariants in 249 ms returned [485, 489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 251 ms to find 2 implicit places.
[2021-05-16 15:22:42] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 422 rows 501 cols
[2021-05-16 15:22:42] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:22:42] [INFO ] Dead Transitions using invariants and state equation in 212 ms returned []
Starting structural reductions, iteration 1 : 501/1350 places, 422/1210 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 499 transition count 420
Applied a total of 4 rules in 19 ms. Remains 499 /501 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 499 cols
[2021-05-16 15:22:42] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:22:42] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 420 rows 499 cols
[2021-05-16 15:22:42] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:22:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 15:22:43] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 499/1350 places, 420/1210 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s430 1), p1:(AND (EQ s481 1) (EQ s497 1)), p2:(EQ s452 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 490 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 81 in 1 ms.
FORMULA ShieldPPPt-PT-020B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-01 finished in 2148 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&((p1&&F(p2))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1343 transition count 1203
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1341 transition count 1201
Applied a total of 18 rules in 180 ms. Remains 1341 /1350 variables (removed 9) and now considering 1201/1210 (removed 9) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:22:44] [INFO ] Computed 221 place invariants in 4 ms
[2021-05-16 15:22:44] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:22:44] [INFO ] Computed 221 place invariants in 4 ms
[2021-05-16 15:22:45] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:22:45] [INFO ] Computed 221 place invariants in 7 ms
[2021-05-16 15:22:46] [INFO ] Dead Transitions using invariants and state equation in 631 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1341/1350 places, 1201/1210 transitions.
Stuttering acceptance computed with spot in 1109 ms :[true, (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(OR (NEQ s1241 1) (NEQ s1267 1)), p0:(OR (EQ s904 0) (EQ s946 0)), p1:(OR (NEQ s904 1) (NEQ s946 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1029 ms.
Product exploration explored 100000 steps with 50000 reset in 1030 ms.
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 1002 ms.
Product exploration explored 100000 steps with 50000 reset in 994 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1341 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1341 transition count 1201
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 98 Pre rules applied. Total rules applied 280 place count 1341 transition count 1279
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 378 place count 1341 transition count 1279
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 1 with 378 rules applied. Total rules applied 756 place count 1341 transition count 1279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 757 place count 1341 transition count 1278
Renaming transitions due to excessive name length > 1024 char.
Discarding 142 places :
Symmetric choice reduction at 2 with 142 rule applications. Total rules 899 place count 1199 transition count 1136
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 142 rules applied. Total rules applied 1041 place count 1199 transition count 1136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 615 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1042 place count 1199 transition count 1136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1044 place count 1197 transition count 1134
Deduced a syphon composed of 613 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1046 place count 1197 transition count 1134
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -331
Deduced a syphon composed of 692 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1125 place count 1197 transition count 1465
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1204 place count 1118 transition count 1307
Deduced a syphon composed of 613 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1283 place count 1118 transition count 1307
Deduced a syphon composed of 613 places in 0 ms
Applied a total of 1283 rules in 683 ms. Remains 1118 /1341 variables (removed 223) and now considering 1307/1201 (removed -106) transitions.
[2021-05-16 15:22:52] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 1307 rows 1118 cols
[2021-05-16 15:22:52] [INFO ] Computed 221 place invariants in 6 ms
[2021-05-16 15:22:53] [INFO ] Dead Transitions using invariants and state equation in 699 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1118/1341 places, 1307/1201 transitions.
Product exploration explored 100000 steps with 50000 reset in 4311 ms.
Product exploration explored 100000 steps with 50000 reset in 4116 ms.
[2021-05-16 15:23:01] [INFO ] Flatten gal took : 52 ms
[2021-05-16 15:23:01] [INFO ] Flatten gal took : 48 ms
[2021-05-16 15:23:01] [INFO ] Time to serialize gal into /tmp/LTL9778430098132053219.gal : 37 ms
[2021-05-16 15:23:01] [INFO ] Time to serialize properties into /tmp/LTL15825818382589677691.ltl : 10 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9778430098132053219.gal, -t, CGAL, -LTL, /tmp/LTL15825818382589677691.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9778430098132053219.gal -t CGAL -LTL /tmp/LTL15825818382589677691.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p1047==0)||(p1099==0))")&&((G("((p1047!=1)||(p1099!=1))"))||((F("((p1439!=1)||(p1472!=1))"))&&("((p1047!=1)||(p1099!=1))"))))))
Formula 0 simplified : !X("((p1047==0)||(p1099==0))" & (G"((p1047!=1)||(p1099!=1))" | ("((p1047!=1)||(p1099!=1))" & F"((p1439!=1)||(p1472!=1))")))
Detected timeout of ITS tools.
[2021-05-16 15:23:16] [INFO ] Flatten gal took : 54 ms
[2021-05-16 15:23:16] [INFO ] Applying decomposition
[2021-05-16 15:23:16] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15009769351496498220.txt, -o, /tmp/graph15009769351496498220.bin, -w, /tmp/graph15009769351496498220.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15009769351496498220.bin, -l, -1, -v, -w, /tmp/graph15009769351496498220.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:23:17] [INFO ] Decomposing Gal with order
[2021-05-16 15:23:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:23:17] [INFO ] Removed a total of 199 redundant transitions.
[2021-05-16 15:23:17] [INFO ] Flatten gal took : 111 ms
[2021-05-16 15:23:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-16 15:23:17] [INFO ] Time to serialize gal into /tmp/LTL1280029266060933808.gal : 21 ms
[2021-05-16 15:23:17] [INFO ] Time to serialize properties into /tmp/LTL16950021439626333120.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1280029266060933808.gal, -t, CGAL, -LTL, /tmp/LTL16950021439626333120.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1280029266060933808.gal -t CGAL -LTL /tmp/LTL16950021439626333120.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i13.u319.p1047==0)||(i13.u332.p1099==0))")&&((G("((i13.u319.p1047!=1)||(i13.u332.p1099!=1))"))||((F("((i18.u437.p1439!=1)||(i18.u446.p1472!=1))"))&&("((i13.u319.p1047!=1)||(i13.u332.p1099!=1))"))))))
Formula 0 simplified : !X("((i13.u319.p1047==0)||(i13.u332.p1099==0))" & (G"((i13.u319.p1047!=1)||(i13.u332.p1099!=1))" | ("((i13.u319.p1047!=1)||(i13.u332.p1099!=1))" & F"((i18.u437.p1439!=1)||(i18.u446.p1472!=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14097619575863675017
[2021-05-16 15:23:32] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14097619575863675017
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14097619575863675017]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14097619575863675017] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14097619575863675017] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-020B-02 finished in 51837 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U p1) U (F((p3&&X(X(F(p1)))))||p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1344 transition count 1204
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1344 transition count 1204
Applied a total of 12 rules in 79 ms. Remains 1344 /1350 variables (removed 6) and now considering 1204/1210 (removed 6) transitions.
// Phase 1: matrix 1204 rows 1344 cols
[2021-05-16 15:23:35] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:36] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 1204 rows 1344 cols
[2021-05-16 15:23:36] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:37] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
// Phase 1: matrix 1204 rows 1344 cols
[2021-05-16 15:23:37] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:37] [INFO ] Dead Transitions using invariants and state equation in 612 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1344/1350 places, 1204/1210 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=p3, acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p3 p0)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}]], initial=0, aps=[p2:(OR (EQ s1174 0) (EQ s1176 0)), p3:(EQ s267 1), p1:(EQ s1317 1), p0:(AND (EQ s1174 1) (EQ s1176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 438 ms.
Stack based approach found an accepted trace after 1766 steps with 0 reset with depth 1767 and stack size 1767 in 9 ms.
FORMULA ShieldPPPt-PT-020B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-03 finished in 2822 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&(p1 U (p2||G(p1))))) U X(X(p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1344 transition count 1204
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1342 transition count 1202
Applied a total of 16 rules in 173 ms. Remains 1342 /1350 variables (removed 8) and now considering 1202/1210 (removed 8) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:23:38] [INFO ] Computed 221 place invariants in 12 ms
[2021-05-16 15:23:39] [INFO ] Implicit Places using invariants in 484 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:23:39] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:40] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:23:40] [INFO ] Computed 221 place invariants in 2 ms
[2021-05-16 15:23:40] [INFO ] Dead Transitions using invariants and state equation in 597 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1342/1350 places, 1202/1210 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-020B-04 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0} source=5 dest: 6}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=6 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s1330 1), p2:(AND (NEQ s1340 1) (OR (NEQ s381 1) (NEQ s418 1))), p1:(OR (NEQ s381 1) (NEQ s418 1)), p3:(AND (EQ s185 1) (EQ s211 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-020B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-04 finished in 2424 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 1349 transition count 927
Reduce places removed 282 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 285 rules applied. Total rules applied 567 place count 1067 transition count 924
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 569 place count 1065 transition count 924
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 569 place count 1065 transition count 767
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 883 place count 908 transition count 767
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 890 place count 901 transition count 760
Iterating global reduction 3 with 7 rules applied. Total rules applied 897 place count 901 transition count 760
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 897 place count 901 transition count 755
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 907 place count 896 transition count 755
Performed 331 Post agglomeration using F-continuation condition.Transition count delta: 331
Deduced a syphon composed of 331 places in 0 ms
Reduce places removed 331 places and 0 transitions.
Iterating global reduction 3 with 662 rules applied. Total rules applied 1569 place count 565 transition count 424
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1687 place count 506 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1688 place count 505 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1689 place count 504 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1689 place count 504 transition count 421
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 1693 place count 502 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1694 place count 501 transition count 420
Applied a total of 1694 rules in 232 ms. Remains 501 /1350 variables (removed 849) and now considering 420/1210 (removed 790) transitions.
// Phase 1: matrix 420 rows 501 cols
[2021-05-16 15:23:41] [INFO ] Computed 220 place invariants in 7 ms
[2021-05-16 15:23:41] [INFO ] Implicit Places using invariants in 349 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 354 ms to find 2 implicit places.
[2021-05-16 15:23:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 420 rows 499 cols
[2021-05-16 15:23:41] [INFO ] Computed 218 place invariants in 0 ms
[2021-05-16 15:23:41] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Starting structural reductions, iteration 1 : 499/1350 places, 420/1210 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 497 transition count 418
Applied a total of 4 rules in 14 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2021-05-16 15:23:41] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:42] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 418 rows 497 cols
[2021-05-16 15:23:42] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:42] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 497/1350 places, 418/1210 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s404 1) (EQ s429 1)), p1:(EQ s153 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6 reset in 415 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA ShieldPPPt-PT-020B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-05 finished in 2049 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1343 transition count 1203
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1341 transition count 1201
Applied a total of 18 rules in 153 ms. Remains 1341 /1350 variables (removed 9) and now considering 1201/1210 (removed 9) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:23:43] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:43] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:23:43] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:44] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:23:44] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:45] [INFO ] Dead Transitions using invariants and state equation in 647 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1341/1350 places, 1201/1210 transitions.
Stuttering acceptance computed with spot in 2773 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-06 automaton TGBA [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:(OR (EQ s353 1) (EQ s950 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-020B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-06 finished in 4876 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(G(p1))||p0) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1349 transition count 930
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 282 rules applied. Total rules applied 561 place count 1070 transition count 927
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 564 place count 1068 transition count 926
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 565 place count 1067 transition count 926
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 155 Pre rules applied. Total rules applied 565 place count 1067 transition count 771
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 4 with 310 rules applied. Total rules applied 875 place count 912 transition count 771
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 882 place count 905 transition count 764
Iterating global reduction 4 with 7 rules applied. Total rules applied 889 place count 905 transition count 764
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 889 place count 905 transition count 759
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 899 place count 900 transition count 759
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 332
Deduced a syphon composed of 332 places in 0 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 4 with 664 rules applied. Total rules applied 1563 place count 568 transition count 427
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1677 place count 511 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1678 place count 510 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1679 place count 509 transition count 426
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1679 place count 509 transition count 424
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1683 place count 507 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1684 place count 506 transition count 423
Applied a total of 1684 rules in 135 ms. Remains 506 /1350 variables (removed 844) and now considering 423/1210 (removed 787) transitions.
// Phase 1: matrix 423 rows 506 cols
[2021-05-16 15:23:48] [INFO ] Computed 220 place invariants in 0 ms
[2021-05-16 15:23:48] [INFO ] Implicit Places using invariants in 257 ms returned [489, 493]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 262 ms to find 2 implicit places.
[2021-05-16 15:23:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 423 rows 504 cols
[2021-05-16 15:23:48] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:48] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Starting structural reductions, iteration 1 : 504/1350 places, 423/1210 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 502 transition count 421
Applied a total of 4 rules in 12 ms. Remains 502 /504 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 502 cols
[2021-05-16 15:23:48] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:48] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 421 rows 502 cols
[2021-05-16 15:23:48] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:49] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 502/1350 places, 421/1210 transitions.
Stuttering acceptance computed with spot in 648 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-07 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s95 1) (EQ s103 1)), p0:(OR (EQ s435 0) (AND (EQ s78 1) (EQ s105 1))), p1:(EQ s127 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 417 ms.
Stack based approach found an accepted trace after 577 steps with 0 reset with depth 578 and stack size 578 in 3 ms.
FORMULA ShieldPPPt-PT-020B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-07 finished in 2372 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1344 transition count 1204
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1342 transition count 1202
Applied a total of 16 rules in 140 ms. Remains 1342 /1350 variables (removed 8) and now considering 1202/1210 (removed 8) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:23:50] [INFO ] Computed 221 place invariants in 4 ms
[2021-05-16 15:23:50] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:23:50] [INFO ] Computed 221 place invariants in 4 ms
[2021-05-16 15:23:51] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:23:51] [INFO ] Computed 221 place invariants in 7 ms
[2021-05-16 15:23:52] [INFO ] Dead Transitions using invariants and state equation in 624 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1342/1350 places, 1202/1210 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-020B-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s121 1), p1:(NEQ s739 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 413 ms.
Product exploration explored 100000 steps with 0 reset in 608 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 431 ms.
Product exploration explored 100000 steps with 0 reset in 543 ms.
[2021-05-16 15:23:54] [INFO ] Flatten gal took : 37 ms
[2021-05-16 15:23:54] [INFO ] Flatten gal took : 57 ms
[2021-05-16 15:23:54] [INFO ] Time to serialize gal into /tmp/LTL15349333920469842328.gal : 5 ms
[2021-05-16 15:23:54] [INFO ] Time to serialize properties into /tmp/LTL11739216874431372229.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15349333920469842328.gal, -t, CGAL, -LTL, /tmp/LTL11739216874431372229.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15349333920469842328.gal -t CGAL -LTL /tmp/LTL11739216874431372229.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(p132!=1)")||(X("(p855!=1)")))))
Formula 0 simplified : !G("(p132!=1)" | X"(p855!=1)")
Detected timeout of ITS tools.
[2021-05-16 15:24:14] [INFO ] Flatten gal took : 4309 ms
[2021-05-16 15:24:14] [INFO ] Applying decomposition
[2021-05-16 15:24:14] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8043303856043420945.txt, -o, /tmp/graph8043303856043420945.bin, -w, /tmp/graph8043303856043420945.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8043303856043420945.bin, -l, -1, -v, -w, /tmp/graph8043303856043420945.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:24:14] [INFO ] Decomposing Gal with order
[2021-05-16 15:24:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:24:14] [INFO ] Removed a total of 202 redundant transitions.
[2021-05-16 15:24:14] [INFO ] Flatten gal took : 65 ms
[2021-05-16 15:24:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-16 15:24:14] [INFO ] Time to serialize gal into /tmp/LTL15325173320472825070.gal : 283 ms
[2021-05-16 15:24:14] [INFO ] Time to serialize properties into /tmp/LTL12239807454167249871.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15325173320472825070.gal, -t, CGAL, -LTL, /tmp/LTL12239807454167249871.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15325173320472825070.gal -t CGAL -LTL /tmp/LTL12239807454167249871.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("(i1.u47.p132!=1)")||(X("(i10.i0.i4.u266.p855!=1)")))))
Formula 0 simplified : !G("(i1.u47.p132!=1)" | X"(i10.i0.i4.u266.p855!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3580266243545889918
[2021-05-16 15:24:29] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3580266243545889918
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3580266243545889918]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3580266243545889918] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3580266243545889918] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-020B-08 finished in 40387 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1344 transition count 1204
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1342 transition count 1202
Applied a total of 16 rules in 154 ms. Remains 1342 /1350 variables (removed 8) and now considering 1202/1210 (removed 8) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:24:30] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:24:31] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:24:31] [INFO ] Computed 221 place invariants in 18 ms
[2021-05-16 15:24:32] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:24:32] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:24:32] [INFO ] Dead Transitions using invariants and state equation in 680 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1342/1350 places, 1202/1210 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s1127 0), p0:(AND (NEQ s691 0) (NEQ s744 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 873 reset in 271 ms.
Product exploration explored 100000 steps with 872 reset in 287 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 890 reset in 262 ms.
Product exploration explored 100000 steps with 897 reset in 285 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 8199 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 1342 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1342/1342 places, 1202/1202 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1342 transition count 1202
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 278 place count 1342 transition count 1282
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 378 place count 1342 transition count 1282
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 757 places in 4 ms
Iterating global reduction 1 with 379 rules applied. Total rules applied 757 place count 1342 transition count 1283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 758 place count 1342 transition count 1282
Renaming transitions due to excessive name length > 1024 char.
Discarding 142 places :
Symmetric choice reduction at 2 with 142 rule applications. Total rules 900 place count 1200 transition count 1139
Deduced a syphon composed of 615 places in 1 ms
Iterating global reduction 2 with 142 rules applied. Total rules applied 1042 place count 1200 transition count 1139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1043 place count 1200 transition count 1139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1045 place count 1198 transition count 1137
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1047 place count 1198 transition count 1137
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -333
Deduced a syphon composed of 692 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1125 place count 1198 transition count 1470
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1203 place count 1120 transition count 1314
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1281 place count 1120 transition count 1314
Deduced a syphon composed of 614 places in 0 ms
Applied a total of 1281 rules in 364 ms. Remains 1120 /1342 variables (removed 222) and now considering 1314/1202 (removed -112) transitions.
[2021-05-16 15:24:43] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1314 rows 1120 cols
[2021-05-16 15:24:43] [INFO ] Computed 221 place invariants in 5 ms
[2021-05-16 15:24:43] [INFO ] Dead Transitions using invariants and state equation in 618 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1120/1342 places, 1314/1202 transitions.
Product exploration explored 100000 steps with 9770 reset in 1533 ms.
Stack based approach found an accepted trace after 230 steps with 22 reset with depth 10 and stack size 8 in 4 ms.
FORMULA ShieldPPPt-PT-020B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-09 finished in 14425 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1349 transition count 926
Reduce places removed 283 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 286 rules applied. Total rules applied 569 place count 1066 transition count 923
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 571 place count 1064 transition count 923
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 571 place count 1064 transition count 766
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 885 place count 907 transition count 766
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 892 place count 900 transition count 759
Iterating global reduction 3 with 7 rules applied. Total rules applied 899 place count 900 transition count 759
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 899 place count 900 transition count 754
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 909 place count 895 transition count 754
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Deduced a syphon composed of 333 places in 0 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 3 with 666 rules applied. Total rules applied 1575 place count 562 transition count 421
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1693 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1694 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1695 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1695 place count 501 transition count 418
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 1699 place count 499 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1700 place count 498 transition count 417
Applied a total of 1700 rules in 148 ms. Remains 498 /1350 variables (removed 852) and now considering 417/1210 (removed 793) transitions.
// Phase 1: matrix 417 rows 498 cols
[2021-05-16 15:24:45] [INFO ] Computed 220 place invariants in 0 ms
[2021-05-16 15:24:45] [INFO ] Implicit Places using invariants in 245 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 245 ms to find 2 implicit places.
[2021-05-16 15:24:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 417 rows 496 cols
[2021-05-16 15:24:45] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:24:45] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Starting structural reductions, iteration 1 : 496/1350 places, 417/1210 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 494 transition count 415
Applied a total of 4 rules in 11 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2021-05-16 15:24:45] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:24:46] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 415 rows 494 cols
[2021-05-16 15:24:46] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:24:46] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 494/1350 places, 415/1210 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 435 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-020B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-10 finished in 1726 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1349 transition count 929
Reduce places removed 280 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 283 rules applied. Total rules applied 563 place count 1069 transition count 926
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 565 place count 1067 transition count 926
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 565 place count 1067 transition count 768
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 881 place count 909 transition count 768
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 887 place count 903 transition count 762
Iterating global reduction 3 with 6 rules applied. Total rules applied 893 place count 903 transition count 762
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 893 place count 903 transition count 757
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 903 place count 898 transition count 757
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Deduced a syphon composed of 333 places in 0 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 3 with 666 rules applied. Total rules applied 1569 place count 565 transition count 424
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1687 place count 506 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1688 place count 505 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1689 place count 504 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1689 place count 504 transition count 421
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 1693 place count 502 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1694 place count 501 transition count 420
Applied a total of 1694 rules in 125 ms. Remains 501 /1350 variables (removed 849) and now considering 420/1210 (removed 790) transitions.
// Phase 1: matrix 420 rows 501 cols
[2021-05-16 15:24:47] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:24:47] [INFO ] Implicit Places using invariants in 246 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 247 ms to find 2 implicit places.
[2021-05-16 15:24:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 420 rows 499 cols
[2021-05-16 15:24:47] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:24:47] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
Starting structural reductions, iteration 1 : 499/1350 places, 420/1210 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 497 transition count 418
Applied a total of 4 rules in 10 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2021-05-16 15:24:47] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:24:47] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 418 rows 497 cols
[2021-05-16 15:24:47] [INFO ] Computed 218 place invariants in 0 ms
[2021-05-16 15:24:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-16 15:24:48] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 497/1350 places, 418/1210 transitions.
Stuttering acceptance computed with spot in 14014 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s276 1), p0:(EQ s153 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16955 reset in 439 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldPPPt-PT-020B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-11 finished in 15754 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1343 transition count 1203
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1341 transition count 1201
Applied a total of 18 rules in 156 ms. Remains 1341 /1350 variables (removed 9) and now considering 1201/1210 (removed 9) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:25:02] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:25:03] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:25:03] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:25:04] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:25:04] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:25:04] [INFO ] Dead Transitions using invariants and state equation in 633 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1341/1350 places, 1201/1210 transitions.
Stuttering acceptance computed with spot in 671 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s549 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4 reset in 384 ms.
Stack based approach found an accepted trace after 12210 steps with 1 reset with depth 756 and stack size 756 in 61 ms.
FORMULA ShieldPPPt-PT-020B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-12 finished in 3198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1343 transition count 1203
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1341 transition count 1201
Applied a total of 18 rules in 155 ms. Remains 1341 /1350 variables (removed 9) and now considering 1201/1210 (removed 9) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:25:06] [INFO ] Computed 221 place invariants in 2 ms
[2021-05-16 15:25:06] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:25:06] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:25:07] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:25:07] [INFO ] Computed 221 place invariants in 2 ms
[2021-05-16 15:25:07] [INFO ] Dead Transitions using invariants and state equation in 618 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1341/1350 places, 1201/1210 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (NEQ s446 1) (NEQ s1117 1)), p0:(NEQ s1117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 681 ms.
Product exploration explored 100000 steps with 33333 reset in 699 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 67 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 682 ms.
Product exploration explored 100000 steps with 33333 reset in 695 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 274 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1341 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1341 transition count 1201
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 279 place count 1341 transition count 1281
Deduced a syphon composed of 379 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 379 place count 1341 transition count 1281
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 758 places in 1 ms
Iterating global reduction 1 with 379 rules applied. Total rules applied 758 place count 1341 transition count 1282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 759 place count 1341 transition count 1281
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 2 with 141 rule applications. Total rules 900 place count 1200 transition count 1140
Deduced a syphon composed of 617 places in 1 ms
Iterating global reduction 2 with 141 rules applied. Total rules applied 1041 place count 1200 transition count 1140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 618 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1042 place count 1200 transition count 1140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1044 place count 1198 transition count 1138
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1046 place count 1198 transition count 1138
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -330
Deduced a syphon composed of 694 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1124 place count 1198 transition count 1468
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1202 place count 1120 transition count 1312
Deduced a syphon composed of 616 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1280 place count 1120 transition count 1312
Deduced a syphon composed of 616 places in 1 ms
Applied a total of 1280 rules in 349 ms. Remains 1120 /1341 variables (removed 221) and now considering 1312/1201 (removed -111) transitions.
[2021-05-16 15:25:19] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1312 rows 1120 cols
[2021-05-16 15:25:19] [INFO ] Computed 221 place invariants in 5 ms
[2021-05-16 15:25:20] [INFO ] Dead Transitions using invariants and state equation in 593 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1120/1341 places, 1312/1201 transitions.
Product exploration explored 100000 steps with 33333 reset in 2996 ms.
Product exploration explored 100000 steps with 33333 reset in 2993 ms.
[2021-05-16 15:25:26] [INFO ] Flatten gal took : 30 ms
[2021-05-16 15:25:26] [INFO ] Flatten gal took : 30 ms
[2021-05-16 15:25:26] [INFO ] Time to serialize gal into /tmp/LTL3661187311932087053.gal : 3 ms
[2021-05-16 15:25:34] [INFO ] Time to serialize properties into /tmp/LTL166968729810606940.ltl : 8025 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3661187311932087053.gal, -t, CGAL, -LTL, /tmp/LTL166968729810606940.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3661187311932087053.gal -t CGAL -LTL /tmp/LTL166968729810606940.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p1294!=1)")U((G("(p1294!=1)"))||("((p512!=1)&&(p1294!=1))"))))))
Formula 0 simplified : !XX("(p1294!=1)" U ("((p512!=1)&&(p1294!=1))" | G"(p1294!=1)"))
Detected timeout of ITS tools.
[2021-05-16 15:25:49] [INFO ] Flatten gal took : 51 ms
[2021-05-16 15:25:49] [INFO ] Applying decomposition
[2021-05-16 15:25:49] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2599982275061744177.txt, -o, /tmp/graph2599982275061744177.bin, -w, /tmp/graph2599982275061744177.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2599982275061744177.bin, -l, -1, -v, -w, /tmp/graph2599982275061744177.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:25:49] [INFO ] Decomposing Gal with order
[2021-05-16 15:25:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:25:49] [INFO ] Removed a total of 203 redundant transitions.
[2021-05-16 15:25:49] [INFO ] Flatten gal took : 59 ms
[2021-05-16 15:25:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-16 15:25:49] [INFO ] Time to serialize gal into /tmp/LTL14840576144910609480.gal : 8 ms
[2021-05-16 15:25:49] [INFO ] Time to serialize properties into /tmp/LTL276845838448785547.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14840576144910609480.gal, -t, CGAL, -LTL, /tmp/LTL276845838448785547.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14840576144910609480.gal -t CGAL -LTL /tmp/LTL276845838448785547.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i16.u400.p1294!=1)")U((G("(i16.u400.p1294!=1)"))||("((i7.u160.p512!=1)&&(i16.u400.p1294!=1))"))))))
Formula 0 simplified : !XX("(i16.u400.p1294!=1)" U ("((i7.u160.p512!=1)&&(i16.u400.p1294!=1))" | G"(i16.u400.p1294!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin556437139777176050
[2021-05-16 15:26:04] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin556437139777176050
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin556437139777176050]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin556437139777176050] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin556437139777176050] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldPPPt-PT-020B-13 finished in 59839 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F((G(p0)||X(p1))) U (p2||X((p3 U p4)))) U (p1&&(F((G(p0)||X(p1))) U (p2||X((p3 U p4))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1344 transition count 1204
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1342 transition count 1202
Applied a total of 16 rules in 175 ms. Remains 1342 /1350 variables (removed 8) and now considering 1202/1210 (removed 8) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:26:05] [INFO ] Computed 221 place invariants in 4 ms
[2021-05-16 15:26:06] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:26:06] [INFO ] Computed 221 place invariants in 4 ms
[2021-05-16 15:26:07] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2021-05-16 15:26:07] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:26:07] [INFO ] Dead Transitions using invariants and state equation in 587 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1342/1350 places, 1202/1210 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p4))), (OR (NOT p1) (AND (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s799 1), p2:(EQ s380 1), p0:(EQ s221 1), p4:(AND (EQ s370 1) (EQ s410 1) (EQ s380 1)), p3:(AND (EQ s370 1) (EQ s410 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 414 ms.
Stack based approach found an accepted trace after 6939 steps with 31 reset with depth 2236 and stack size 2236 in 25 ms.
FORMULA ShieldPPPt-PT-020B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-14 finished in 2661 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1350/1350 places, 1210/1210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1349 transition count 928
Reduce places removed 281 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 284 rules applied. Total rules applied 565 place count 1068 transition count 925
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 567 place count 1066 transition count 925
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 567 place count 1066 transition count 767
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 883 place count 908 transition count 767
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 890 place count 901 transition count 760
Iterating global reduction 3 with 7 rules applied. Total rules applied 897 place count 901 transition count 760
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 897 place count 901 transition count 755
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 907 place count 896 transition count 755
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Deduced a syphon composed of 333 places in 0 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 3 with 666 rules applied. Total rules applied 1573 place count 563 transition count 422
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1691 place count 504 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1692 place count 503 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1693 place count 502 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1693 place count 502 transition count 419
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 1697 place count 500 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1698 place count 499 transition count 418
Applied a total of 1698 rules in 122 ms. Remains 499 /1350 variables (removed 851) and now considering 418/1210 (removed 792) transitions.
// Phase 1: matrix 418 rows 499 cols
[2021-05-16 15:26:08] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:26:08] [INFO ] Implicit Places using invariants in 246 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 247 ms to find 2 implicit places.
[2021-05-16 15:26:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 418 rows 497 cols
[2021-05-16 15:26:08] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:26:08] [INFO ] Dead Transitions using invariants and state equation in 209 ms returned []
Starting structural reductions, iteration 1 : 497/1350 places, 418/1210 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 495 transition count 416
Applied a total of 4 rules in 12 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2021-05-16 15:26:08] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:26:09] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 416 rows 495 cols
[2021-05-16 15:26:09] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:26:09] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 495/1350 places, 416/1210 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s420 1) (EQ s436 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 260 reset in 384 ms.
Stack based approach found an accepted trace after 398 steps with 1 reset with depth 20 and stack size 20 in 2 ms.
FORMULA ShieldPPPt-PT-020B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-15 finished in 1691 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14503448058314584417
[2021-05-16 15:26:10] [INFO ] Computing symmetric may disable matrix : 1210 transitions.
[2021-05-16 15:26:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 15:26:10] [INFO ] Computing symmetric may enable matrix : 1210 transitions.
[2021-05-16 15:26:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 15:26:10] [INFO ] Applying decomposition
[2021-05-16 15:26:10] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2755840844179108479.txt, -o, /tmp/graph2755840844179108479.bin, -w, /tmp/graph2755840844179108479.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2755840844179108479.bin, -l, -1, -v, -w, /tmp/graph2755840844179108479.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:26:10] [INFO ] Decomposing Gal with order
[2021-05-16 15:26:10] [INFO ] Computing Do-Not-Accords matrix : 1210 transitions.
[2021-05-16 15:26:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:26:10] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-16 15:26:10] [INFO ] Built C files in 235ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14503448058314584417
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14503448058314584417]
[2021-05-16 15:26:10] [INFO ] Removed a total of 188 redundant transitions.
[2021-05-16 15:26:10] [INFO ] Flatten gal took : 55 ms
[2021-05-16 15:26:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-16 15:26:10] [INFO ] Time to serialize gal into /tmp/LTLFireability471364824971434650.gal : 10 ms
[2021-05-16 15:26:10] [INFO ] Time to serialize properties into /tmp/LTLFireability9390305910181822305.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability471364824971434650.gal, -t, CGAL, -LTL, /tmp/LTLFireability9390305910181822305.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability471364824971434650.gal -t CGAL -LTL /tmp/LTLFireability9390305910181822305.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(("((i13.i0.i2.u323.p1047==0)||(i13.i1.i3.u337.p1099==0))")&&((!("((i13.i0.i2.u323.p1047==1)&&(i13.i1.i3.u337.p1099==1))"))U(((!("((i13.i0.i2.u323.p1047==1)&&(i13.i1.i3.u337.p1099==1))"))&&(F(!("((i18.i1.i1.u443.p1439==1)&&(i18.i1.i2.u451.p1472==1))"))))||(G(!("((i13.i0.i2.u323.p1047==1)&&(i13.i1.i3.u337.p1099==1))"))))))))
Formula 0 simplified : !X("((i13.i0.i2.u323.p1047==0)||(i13.i1.i3.u337.p1099==0))" & (!"((i13.i0.i2.u323.p1047==1)&&(i13.i1.i3.u337.p1099==1))" U ((!"((i13.i0.i2.u323.p1047==1)&&(i13.i1.i3.u337.p1099==1))" & F!"((i18.i1.i1.u443.p1439==1)&&(i18.i1.i2.u451.p1472==1))") | G!"((i13.i0.i2.u323.p1047==1)&&(i13.i1.i3.u337.p1099==1))")))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14503448058314584417] killed by timeout after 22 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14503448058314584417] killed by timeout after 22 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-16 15:47:35] [INFO ] Applying decomposition
[2021-05-16 15:47:35] [INFO ] Flatten gal took : 233 ms
[2021-05-16 15:47:35] [INFO ] Decomposing Gal with order
[2021-05-16 15:47:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:47:36] [INFO ] Removed a total of 57 redundant transitions.
[2021-05-16 15:47:36] [INFO ] Flatten gal took : 289 ms
[2021-05-16 15:47:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 189 ms.
[2021-05-16 15:47:37] [INFO ] Time to serialize gal into /tmp/LTLFireability16088245562519041175.gal : 38 ms
[2021-05-16 15:47:37] [INFO ] Time to serialize properties into /tmp/LTLFireability1449664587442127842.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16088245562519041175.gal, -t, CGAL, -LTL, /tmp/LTLFireability1449664587442127842.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16088245562519041175.gal -t CGAL -LTL /tmp/LTLFireability1449664587442127842.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u307.p1047==0)||(i0.i0.i0.i0.i0.i0.i1.u314.p1099==0))")&&((!("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u307.p1047==1)&&(i0.i0.i0.i0.i0.i0.i1.u314.p1099==1))"))U(((!("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u307.p1047==1)&&(i0.i0.i0.i0.i0.i0.i1.u314.p1099==1))"))&&(F(!("((i0.i1.i0.i0.i0.i0.i1.u415.p1439==1)&&(i0.i1.i0.u418.p1472==1))"))))||(G(!("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u307.p1047==1)&&(i0.i0.i0.i0.i0.i0.i1.u314.p1099==1))"))))))))
Formula 0 simplified : !X("((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u307.p1047==0)||(i0.i0.i0.i0.i0.i0.i1.u314.p1099==0))" & (!"((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u307.p1047==1)&&(i0.i0.i0.i0.i0.i0.i1.u314.p1099==1))" U ((!"((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u307.p1047==1)&&(i0.i0.i0.i0.i0.i0.i1.u314.p1099==1))" & F!"((i0.i1.i0.i0.i0.i0.i1.u415.p1439==1)&&(i0.i1.i0.u418.p1472==1))") | G!"((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u307.p1047==1)&&(i0.i0.i0.i0.i0.i0.i1.u314.p1099==1))")))
Detected timeout of ITS tools.
[2021-05-16 16:09:16] [INFO ] Flatten gal took : 17783 ms
[2021-05-16 16:09:18] [INFO ] Input system was already deterministic with 1210 transitions.
[2021-05-16 16:09:18] [INFO ] Transformed 1350 places.
[2021-05-16 16:09:18] [INFO ] Transformed 1210 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-16 16:09:18] [INFO ] Time to serialize gal into /tmp/LTLFireability1503441018747247564.gal : 13 ms
[2021-05-16 16:09:18] [INFO ] Time to serialize properties into /tmp/LTLFireability17008926014720599953.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability1503441018747247564.gal, -t, CGAL, -LTL, /tmp/LTLFireability17008926014720599953.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability1503441018747247564.gal -t CGAL -LTL /tmp/LTLFireability17008926014720599953.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("((p1047==0)||(p1099==0))")&&((!("((p1047==1)&&(p1099==1))"))U(((!("((p1047==1)&&(p1099==1))"))&&(F(!("((p1439==1)&&(p1472==1))"))))||(G(!("((p1047==1)&&(p1099==1))"))))))))
Formula 0 simplified : !X("((p1047==0)||(p1099==0))" & (!"((p1047==1)&&(p1099==1))" U ((!"((p1047==1)&&(p1099==1))" & F!"((p1439==1)&&(p1472==1))") | G!"((p1047==1)&&(p1099==1))")))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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