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.r064-tall-162038396700092.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 DES-PT-20b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 5 16:58 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 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 91K May 5 16:51 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 DES-PT-20b-00
FORMULA_NAME DES-PT-20b-01
FORMULA_NAME DES-PT-20b-02
FORMULA_NAME DES-PT-20b-03
FORMULA_NAME DES-PT-20b-04
FORMULA_NAME DES-PT-20b-05
FORMULA_NAME DES-PT-20b-06
FORMULA_NAME DES-PT-20b-07
FORMULA_NAME DES-PT-20b-08
FORMULA_NAME DES-PT-20b-09
FORMULA_NAME DES-PT-20b-10
FORMULA_NAME DES-PT-20b-11
FORMULA_NAME DES-PT-20b-12
FORMULA_NAME DES-PT-20b-13
FORMULA_NAME DES-PT-20b-14
FORMULA_NAME DES-PT-20b-15

=== Now, execution of the tool begins

BK_START 1620470068221

Running Version 0
[2021-05-08 10:34:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 10:34:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:34:30] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-08 10:34:30] [INFO ] Transformed 360 places.
[2021-05-08 10:34:30] [INFO ] Transformed 311 transitions.
[2021-05-08 10:34:30] [INFO ] Found NUPN structural information;
[2021-05-08 10:34:30] [INFO ] Parsed PT model containing 360 places and 311 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 10:34:30] [INFO ] Initial state test concluded for 1 properties.
FORMULA DES-PT-20b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 357 transition count 311
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 339 transition count 293
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 339 transition count 293
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 326 transition count 280
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 326 transition count 280
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 76 place count 326 transition count 269
Applied a total of 76 rules in 79 ms. Remains 326 /360 variables (removed 34) and now considering 269/311 (removed 42) transitions.
// Phase 1: matrix 269 rows 326 cols
[2021-05-08 10:34:30] [INFO ] Computed 62 place invariants in 28 ms
[2021-05-08 10:34:30] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 269 rows 326 cols
[2021-05-08 10:34:30] [INFO ] Computed 62 place invariants in 15 ms
[2021-05-08 10:34:31] [INFO ] Implicit Places using invariants and state equation in 375 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 680 ms to find 1 implicit places.
// Phase 1: matrix 269 rows 325 cols
[2021-05-08 10:34:31] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-08 10:34:31] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Starting structural reductions, iteration 1 : 325/360 places, 269/311 transitions.
Applied a total of 0 rules in 10 ms. Remains 325 /325 variables (removed 0) and now considering 269/269 (removed 0) transitions.
// Phase 1: matrix 269 rows 325 cols
[2021-05-08 10:34:31] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-08 10:34:31] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Finished structural reductions, in 2 iterations. Remains : 325/360 places, 269/311 transitions.
[2021-05-08 10:34:31] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-08 10:34:31] [INFO ] Flatten gal took : 51 ms
FORMULA DES-PT-20b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 10:34:31] [INFO ] Flatten gal took : 23 ms
[2021-05-08 10:34:31] [INFO ] Input system was already deterministic with 269 transitions.
Incomplete random walk after 100000 steps, including 878 resets, run finished after 377 ms. (steps per millisecond=265 ) properties (out of 15) seen :11
Running SMT prover for 4 properties.
// Phase 1: matrix 269 rows 325 cols
[2021-05-08 10:34:32] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 10:34:32] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2021-05-08 10:34:32] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 12 ms returned sat
[2021-05-08 10:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:32] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-08 10:34:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:34:32] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2021-05-08 10:34:32] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 14 ms returned sat
[2021-05-08 10:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:32] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-08 10:34:32] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 6 ms to minimize.
[2021-05-08 10:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2021-05-08 10:34:32] [INFO ] Computed and/alt/rep : 263/512/263 causal constraints (skipped 5 transitions) in 76 ms.
[2021-05-08 10:34:33] [INFO ] Added : 211 causal constraints over 43 iterations in 945 ms. Result :sat
[2021-05-08 10:34:33] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-08 10:34:33] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 12 ms returned sat
[2021-05-08 10:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:33] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-08 10:34:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:34:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-08 10:34:33] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 13 ms returned sat
[2021-05-08 10:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:33] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-08 10:34:34] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2021-05-08 10:34:34] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2021-05-08 10:34:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2021-05-08 10:34:34] [INFO ] Computed and/alt/rep : 263/512/263 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-08 10:34:34] [INFO ] Added : 209 causal constraints over 42 iterations in 775 ms. Result :sat
[2021-05-08 10:34:34] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2021-05-08 10:34:34] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 11 ms returned sat
[2021-05-08 10:34:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:35] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-08 10:34:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:34:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned unsat
[2021-05-08 10:34:35] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2021-05-08 10:34:35] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 11 ms returned sat
[2021-05-08 10:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:35] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-08 10:34:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:34:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2021-05-08 10:34:35] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 12 ms returned sat
[2021-05-08 10:34:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:35] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-08 10:34:35] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2021-05-08 10:34:35] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2021-05-08 10:34:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2021-05-08 10:34:35] [INFO ] Computed and/alt/rep : 263/512/263 causal constraints (skipped 5 transitions) in 14 ms.
[2021-05-08 10:34:36] [INFO ] Added : 191 causal constraints over 39 iterations in 813 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2021-05-08 10:34:36] [INFO ] Initial state test concluded for 1 properties.
FORMULA DES-PT-20b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 325/325 places, 269/269 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 318 transition count 261
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 315 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 315 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 315 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 314 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 314 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 314 transition count 255
Applied a total of 25 rules in 53 ms. Remains 314 /325 variables (removed 11) and now considering 255/269 (removed 14) transitions.
// Phase 1: matrix 255 rows 314 cols
[2021-05-08 10:34:36] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 10:34:36] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 255 rows 314 cols
[2021-05-08 10:34:36] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 10:34:36] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
// Phase 1: matrix 255 rows 314 cols
[2021-05-08 10:34:36] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 10:34:37] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 314/325 places, 255/269 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20b-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s146 0) (OR (NEQ s180 0) (NEQ s99 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-00 finished in 840 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 325/325 places, 269/269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 324 transition count 250
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 306 transition count 250
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 36 place count 306 transition count 240
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 56 place count 296 transition count 240
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 292 transition count 236
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 292 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 292 transition count 235
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 291 transition count 235
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 289 transition count 233
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 289 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 289 transition count 231
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 288 transition count 230
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 230 place count 210 transition count 152
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 4 with 4 rules applied. Total rules applied 234 place count 208 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 207 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 206 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 205 transition count 152
Applied a total of 237 rules in 88 ms. Remains 205 /325 variables (removed 120) and now considering 152/269 (removed 117) transitions.
// Phase 1: matrix 152 rows 205 cols
[2021-05-08 10:34:37] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:34:37] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 152 rows 205 cols
[2021-05-08 10:34:37] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:34:37] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2021-05-08 10:34:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 152 rows 205 cols
[2021-05-08 10:34:37] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 10:34:37] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/325 places, 152/269 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-20b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (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=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s109 0) (EQ s183 1)), p0:(OR (EQ s111 0) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-03 finished in 702 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(X(p1))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 325 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 325/325 places, 269/269 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 317 transition count 261
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 317 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 317 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 314 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 314 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 313 transition count 254
Applied a total of 27 rules in 25 ms. Remains 313 /325 variables (removed 12) and now considering 254/269 (removed 15) transitions.
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 10:34:38] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:34:38] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 10:34:38] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 10:34:38] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 10:34:38] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:34:38] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 313/325 places, 254/269 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : DES-PT-20b-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}]], initial=0, aps=[p0:(OR (EQ s75 0) (EQ s229 1) (EQ s176 1)), p2:(AND (EQ s82 0) (EQ s198 1)), p1:(AND (EQ s229 0) (EQ s75 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-04 finished in 720 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((X(p1)&&p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 325/325 places, 269/269 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 317 transition count 261
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 317 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 317 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 314 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 314 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 313 transition count 254
Applied a total of 27 rules in 24 ms. Remains 313 /325 variables (removed 12) and now considering 254/269 (removed 15) transitions.
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 10:34:38] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:34:38] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 10:34:38] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 10:34:39] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
// Phase 1: matrix 254 rows 313 cols
[2021-05-08 10:34:39] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:34:39] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 313/325 places, 254/269 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DES-PT-20b-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (NEQ s170 0) (NEQ s149 1)), p1:(AND (NEQ s293 0) (NEQ s123 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-06 finished in 781 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 325/325 places, 269/269 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 318 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 316 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 316 transition count 259
Applied a total of 19 rules in 17 ms. Remains 316 /325 variables (removed 9) and now considering 259/269 (removed 10) transitions.
// Phase 1: matrix 259 rows 316 cols
[2021-05-08 10:34:39] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:34:39] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 259 rows 316 cols
[2021-05-08 10:34:39] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 10:34:39] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
// Phase 1: matrix 259 rows 316 cols
[2021-05-08 10:34:40] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:34:40] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 316/325 places, 259/269 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DES-PT-20b-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (EQ s199 0) (EQ s106 1)), p0:(OR (EQ s106 0) (EQ s199 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-09 finished in 814 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 325/325 places, 269/269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 324 transition count 250
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 306 transition count 250
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 36 place count 306 transition count 239
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 295 transition count 239
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 290 transition count 234
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 290 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 290 transition count 233
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 290 transition count 231
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 288 transition count 231
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 286 transition count 229
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 286 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 286 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 285 transition count 226
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 233 place count 209 transition count 150
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 5 with 4 rules applied. Total rules applied 237 place count 207 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 206 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 205 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 204 transition count 150
Applied a total of 240 rules in 60 ms. Remains 204 /325 variables (removed 121) and now considering 150/269 (removed 119) transitions.
// Phase 1: matrix 150 rows 204 cols
[2021-05-08 10:34:40] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:34:40] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 150 rows 204 cols
[2021-05-08 10:34:40] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:34:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 10:34:40] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2021-05-08 10:34:40] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 150 rows 204 cols
[2021-05-08 10:34:40] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:34:40] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/325 places, 150/269 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s193 0) (NEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-10 finished in 652 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 325/325 places, 269/269 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 318 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 316 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 316 transition count 259
Applied a total of 19 rules in 14 ms. Remains 316 /325 variables (removed 9) and now considering 259/269 (removed 10) transitions.
// Phase 1: matrix 259 rows 316 cols
[2021-05-08 10:34:40] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 10:34:41] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 259 rows 316 cols
[2021-05-08 10:34:41] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:34:41] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
// Phase 1: matrix 259 rows 316 cols
[2021-05-08 10:34:41] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 10:34:41] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Finished structural reductions, in 1 iterations. Remains : 316/325 places, 259/269 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-20b-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s111 0) (EQ s106 1)), p0:(OR (EQ s23 0) (EQ s78 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]]
Product exploration explored 100000 steps with 878 reset in 297 ms.
Product exploration explored 100000 steps with 863 reset in 259 ms.
Graph (complete) has 654 edges and 316 vertex of which 311 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 867 reset in 191 ms.
Product exploration explored 100000 steps with 872 reset in 209 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Support contains 4 out of 316 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 316/316 places, 259/259 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 316 transition count 259
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 16 place count 316 transition count 280
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 316 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 310 transition count 274
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 310 transition count 274
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 116 place count 310 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 117 place count 310 transition count 277
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 127 place count 300 transition count 267
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 137 place count 300 transition count 267
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 143 place count 300 transition count 303
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 298 transition count 297
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 298 transition count 297
Deduced a syphon composed of 92 places in 1 ms
Applied a total of 147 rules in 64 ms. Remains 298 /316 variables (removed 18) and now considering 297/259 (removed -38) transitions.
[2021-05-08 10:34:43] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 297 rows 298 cols
[2021-05-08 10:34:43] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 10:34:43] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 298/316 places, 297/259 transitions.
Product exploration explored 100000 steps with 4155 reset in 539 ms.
Product exploration explored 100000 steps with 4157 reset in 436 ms.
[2021-05-08 10:34:44] [INFO ] Flatten gal took : 17 ms
[2021-05-08 10:34:44] [INFO ] Flatten gal took : 17 ms
[2021-05-08 10:34:44] [INFO ] Time to serialize gal into /tmp/LTL2279692671886754811.gal : 10 ms
[2021-05-08 10:34:44] [INFO ] Time to serialize properties into /tmp/LTL2291220515733218142.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/LTL2279692671886754811.gal, -t, CGAL, -LTL, /tmp/LTL2291220515733218142.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/LTL2279692671886754811.gal -t CGAL -LTL /tmp/LTL2291220515733218142.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p24==0)||(p80==1))")||(G("((p125==0)||(p120==1))"))))))
Formula 0 simplified : !XG("((p24==0)||(p80==1))" | G"((p125==0)||(p120==1))")
Detected timeout of ITS tools.
[2021-05-08 10:34:59] [INFO ] Flatten gal took : 17 ms
[2021-05-08 10:34:59] [INFO ] Applying decomposition
[2021-05-08 10:34:59] [INFO ] Flatten gal took : 16 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/graph10249461298275677052.txt, -o, /tmp/graph10249461298275677052.bin, -w, /tmp/graph10249461298275677052.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/graph10249461298275677052.bin, -l, -1, -v, -w, /tmp/graph10249461298275677052.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:34:59] [INFO ] Decomposing Gal with order
[2021-05-08 10:34:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:34:59] [INFO ] Removed a total of 13 redundant transitions.
[2021-05-08 10:34:59] [INFO ] Flatten gal took : 99 ms
[2021-05-08 10:34:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2021-05-08 10:34:59] [INFO ] Time to serialize gal into /tmp/LTL15954066930362676945.gal : 19 ms
[2021-05-08 10:34:59] [INFO ] Time to serialize properties into /tmp/LTL6020068117459147138.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/LTL15954066930362676945.gal, -t, CGAL, -LTL, /tmp/LTL6020068117459147138.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/LTL15954066930362676945.gal -t CGAL -LTL /tmp/LTL6020068117459147138.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u35.p24==0)||(i1.u8.p80==1))")||(G("((i1.u12.p125==0)||(i1.u12.p120==1))"))))))
Formula 0 simplified : !XG("((u35.p24==0)||(i1.u8.p80==1))" | G"((i1.u12.p125==0)||(i1.u12.p120==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15073262497117571796
[2021-05-08 10:35:14] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15073262497117571796
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/ltsmin15073262497117571796]
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/ltsmin15073262497117571796] 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/ltsmin15073262497117571796] 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 DES-PT-20b-13 finished in 34958 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 325/325 places, 269/269 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 324 transition count 250
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 306 transition count 250
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 36 place count 306 transition count 239
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 295 transition count 239
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 290 transition count 234
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 290 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 290 transition count 233
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 290 transition count 231
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 288 transition count 231
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 286 transition count 229
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 286 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 286 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 285 transition count 226
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 233 place count 209 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 208 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 236 place count 207 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 206 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 205 transition count 148
Applied a total of 238 rules in 71 ms. Remains 205 /325 variables (removed 120) and now considering 148/269 (removed 121) transitions.
// Phase 1: matrix 148 rows 205 cols
[2021-05-08 10:35:15] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:35:16] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 148 rows 205 cols
[2021-05-08 10:35:16] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:35:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:35:16] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2021-05-08 10:35:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 148 rows 205 cols
[2021-05-08 10:35:16] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:35:16] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/325 places, 148/269 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s85 1) (NEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-14 finished in 630 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9922821724210003818
[2021-05-08 10:35:16] [INFO ] Computing symmetric may disable matrix : 269 transitions.
[2021-05-08 10:35:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 10:35:16] [INFO ] Computing symmetric may enable matrix : 269 transitions.
[2021-05-08 10:35:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 10:35:16] [INFO ] Applying decomposition
[2021-05-08 10:35:16] [INFO ] Flatten gal took : 15 ms
[2021-05-08 10:35:16] [INFO ] Computing Do-Not-Accords matrix : 269 transitions.
[2021-05-08 10:35:16] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph17764530091323279853.txt, -o, /tmp/graph17764530091323279853.bin, -w, /tmp/graph17764530091323279853.weights], workingDir=null]
[2021-05-08 10:35:16] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9922821724210003818
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/ltsmin9922821724210003818]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17764530091323279853.bin, -l, -1, -v, -w, /tmp/graph17764530091323279853.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:35:16] [INFO ] Decomposing Gal with order
[2021-05-08 10:35:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:35:16] [INFO ] Removed a total of 16 redundant transitions.
[2021-05-08 10:35:16] [INFO ] Flatten gal took : 39 ms
[2021-05-08 10:35:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2021-05-08 10:35:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality16897920199061456532.gal : 30 ms
[2021-05-08 10:35:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality15214528721288967000.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/LTLCardinality16897920199061456532.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15214528721288967000.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/LTLCardinality16897920199061456532.gal -t CGAL -LTL /tmp/LTLCardinality15214528721288967000.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i7.u39.p24==0)||(i2.i1.u9.p80==1))")||(G("((i2.i1.u13.p125==0)||(i2.i1.u13.p120==1))"))))))
Formula 0 simplified : !XG("((i7.u39.p24==0)||(i2.i1.u9.p80==1))" | G"((i2.i1.u13.p125==0)||(i2.i1.u13.p120==1))")
Compilation finished in 2615 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9922821724210003818]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp1==true))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9922821724210003818]
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t62, t229, t267, t300, u37.t83, i0.i1.u80.t25, i0.i1.u80.t27, i1.t154, i1.u7.t164, i1.u7.t166, i1.u8.t158, i1.u8.t160, i2.t141, i2.i1.u9.t210, i2.i1.u9.t211, i2.i1.u9.t212, i2.i1.u9.t213, i2.i1.u9.t214, i2.i1.u9.t215, i2.i1.u9.t216, i2.i1.u9.t217, i2.i1.u9.t218, i2.i1.u9.t219, i2.i1.u9.t220, i2.i1.u9.t221, i2.i1.u9.t222, i2.i1.u9.t223, i2.i1.u9.t224, i2.i1.u9.t225, i2.i1.u9.t226, i2.i1.u9.t227, i2.i1.u9.t228, i2.i1.u13.t144, i2.i1.u13.t146, i3.i0.u14.t137, i3.i0.u16.t130, i3.i1.t121, i3.i1.u19.t123, i5.u33.t98, i6.t114, i6.t99, i6.i0.u27.t112, i6.i1.t104, i6.i1.u24.t309, i6.i3.t298, i6.i3.u21.t118, i6.i3.u29.t1, i6.i3.u29.t109, i7.t80, i8.u63.t55, i8.u64.t52, i8.u72.t41, i9.i0.u42.t78, i9.i2.t10, i9.i2.t280, i9.i2.u73.t36, i9.i2.u73.t38, i10.t60, i10.t58, i10.i0.t56, i10.i0.u62.t57, i10.i1.u60.t61, i10.i2.u61.t59, i11.t66, i11.i0.u45.t76, i11.i1.u59.t63, i11.i2.t64, i11.i2.u56.t68, i11.i2.u58.t65, i11.i3.u57.t67, i12.u83.t17, i12.u83.t190, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/192/74/266
Computing Next relation with stutter on 6.80173e+07 deadlock states
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp1==true))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9922821724210003818]
Retrying LTSmin with larger timeout 3200 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp1==true))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9922821724210003818]
Detected timeout of ITS tools.
[2021-05-08 10:55:32] [INFO ] Applying decomposition
[2021-05-08 10:55:32] [INFO ] Flatten gal took : 18 ms
[2021-05-08 10:55:32] [INFO ] Decomposing Gal with order
[2021-05-08 10:55:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:55:32] [INFO ] Removed a total of 86 redundant transitions.
[2021-05-08 10:55:32] [INFO ] Flatten gal took : 83 ms
[2021-05-08 10:55:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 297 labels/synchronizations in 62 ms.
[2021-05-08 10:55:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality17990107997900209860.gal : 4 ms
[2021-05-08 10:55:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality6415501745360326714.ltl : 5 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/LTLCardinality17990107997900209860.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6415501745360326714.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/LTLCardinality17990107997900209860.gal -t CGAL -LTL /tmp/LTLCardinality6415501745360326714.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i0.i0.i0.u4.p24==0)||(i0.u7.p80==1))")||(G("((i1.i0.i0.i0.i0.i0.u17.p125==0)||(i1.i0.i0.i0.i0.i0.u17.p120==1))"))))))
Formula 0 simplified : !XG("((i0.i0.i0.u4.p24==0)||(i0.u7.p80==1))" | G"((i1.i0.i0.i0.i0.i0.u17.p125==0)||(i1.i0.i0.i0.i0.i0.u17.p120==1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.213: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.219: LTL layer: formula: X([](([]((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.220: "X([](([]((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.221: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.226: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.228: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.228: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.228: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.228: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.245: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.446: DFS-FIFO for weak LTL, using special progress label 272
pins2lts-mc-linux64( 0/ 8), 0.446: There are 273 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.446: State length is 326, there are 276 groups
pins2lts-mc-linux64( 0/ 8), 0.446: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.446: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.446: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.446: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.616: ~1 levels ~960 states ~4936 transitions
pins2lts-mc-linux64( 1/ 8), 0.633: ~1 levels ~1920 states ~10152 transitions
pins2lts-mc-linux64( 6/ 8), 0.648: ~1 levels ~3840 states ~18752 transitions
pins2lts-mc-linux64( 6/ 8), 0.674: ~1 levels ~7680 states ~38456 transitions
pins2lts-mc-linux64( 6/ 8), 0.734: ~1 levels ~15360 states ~80248 transitions
pins2lts-mc-linux64( 6/ 8), 0.869: ~1 levels ~30720 states ~169296 transitions
pins2lts-mc-linux64( 6/ 8), 1.167: ~1 levels ~61440 states ~380968 transitions
pins2lts-mc-linux64( 0/ 8), 1.761: ~1 levels ~122880 states ~895680 transitions
pins2lts-mc-linux64( 0/ 8), 3.166: ~1 levels ~245760 states ~1952952 transitions
pins2lts-mc-linux64( 3/ 8), 5.928: ~1 levels ~491520 states ~3634288 transitions
pins2lts-mc-linux64( 3/ 8), 11.134: ~1 levels ~983040 states ~7409192 transitions
pins2lts-mc-linux64( 3/ 8), 22.510: ~1 levels ~1966080 states ~15442880 transitions
pins2lts-mc-linux64( 3/ 8), 46.930: ~1 levels ~3932160 states ~33747688 transitions
pins2lts-mc-linux64( 6/ 8), 106.314: ~1 levels ~7864320 states ~77287576 transitions
pins2lts-mc-linux64( 6/ 8), 217.584: ~1 levels ~15728640 states ~159971112 transitions
pins2lts-mc-linux64( 6/ 8), 443.995: ~1 levels ~31457280 states ~334952024 transitions
pins2lts-mc-linux64( 6/ 8), 907.715: ~1 levels ~62914560 states ~692227296 transitions
pins2lts-mc-linux64( 5/ 8), 1319.644: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1319.685:
pins2lts-mc-linux64( 0/ 8), 1319.685: mean standard work distribution: 4.5% (states) 4.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1319.685:
pins2lts-mc-linux64( 0/ 8), 1319.685: Explored 81837314 states 980333609 transitions, fanout: 11.979
pins2lts-mc-linux64( 0/ 8), 1319.685: Total exploration time 1319.220 sec (1319.180 sec minimum, 1319.200 sec on average)
pins2lts-mc-linux64( 0/ 8), 1319.685: States per second: 62035, Transitions per second: 743116
pins2lts-mc-linux64( 0/ 8), 1319.685:
pins2lts-mc-linux64( 0/ 8), 1319.685: Progress states detected: 134216991
pins2lts-mc-linux64( 0/ 8), 1319.685: Redundant explorations: -39.0261
pins2lts-mc-linux64( 0/ 8), 1319.685:
pins2lts-mc-linux64( 0/ 8), 1319.685: Queue width: 8B, total height: 90524878, memory: 690.65MB
pins2lts-mc-linux64( 0/ 8), 1319.685: Tree memory: 1037.6MB, 8.1 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1319.685: Tree fill ratio (roots/leafs): 99.0%/5.0%
pins2lts-mc-linux64( 0/ 8), 1319.685: Stored 272 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1319.685: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1319.685: Est. total memory use: 1728.3MB (~1714.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp1==true))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9922821724210003818]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](([]((LTLAPp1==true))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9922821724210003818]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-08 11:15:47] [INFO ] Flatten gal took : 11 ms
[2021-05-08 11:15:47] [INFO ] Input system was already deterministic with 269 transitions.
[2021-05-08 11:15:47] [INFO ] Transformed 325 places.
[2021-05-08 11:15:47] [INFO ] Transformed 269 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-08 11:15:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality7943235013917625177.gal : 2 ms
[2021-05-08 11:15:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality1848746561906852355.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/LTLCardinality7943235013917625177.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1848746561906852355.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/LTLCardinality7943235013917625177.gal -t CGAL -LTL /tmp/LTLCardinality1848746561906852355.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("((p24==0)||(p80==1))")||(G("((p125==0)||(p120==1))"))))))
Formula 0 simplified : !XG("((p24==0)||(p80==1))" | G"((p125==0)||(p120==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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="DES-PT-20b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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