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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.4K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.4K Mar 22 12:54 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 115K 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-40b-00
FORMULA_NAME DES-PT-40b-01
FORMULA_NAME DES-PT-40b-02
FORMULA_NAME DES-PT-40b-03
FORMULA_NAME DES-PT-40b-04
FORMULA_NAME DES-PT-40b-05
FORMULA_NAME DES-PT-40b-06
FORMULA_NAME DES-PT-40b-07
FORMULA_NAME DES-PT-40b-08
FORMULA_NAME DES-PT-40b-09
FORMULA_NAME DES-PT-40b-10
FORMULA_NAME DES-PT-40b-11
FORMULA_NAME DES-PT-40b-12
FORMULA_NAME DES-PT-40b-13
FORMULA_NAME DES-PT-40b-14
FORMULA_NAME DES-PT-40b-15

=== Now, execution of the tool begins

BK_START 1620477641038

Running Version 0
[2021-05-08 12:40:42] [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 12:40:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 12:40:42] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-08 12:40:42] [INFO ] Transformed 439 places.
[2021-05-08 12:40:42] [INFO ] Transformed 390 transitions.
[2021-05-08 12:40:42] [INFO ] Found NUPN structural information;
[2021-05-08 12:40:42] [INFO ] Parsed PT model containing 439 places and 390 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 12:40:42] [INFO ] Initial state test concluded for 6 properties.
FORMULA DES-PT-40b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 413 transition count 367
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 413 transition count 367
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 400 transition count 354
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 400 transition count 354
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 86 place count 400 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 399 transition count 342
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 399 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 399 transition count 341
Applied a total of 89 rules in 135 ms. Remains 399 /439 variables (removed 40) and now considering 341/390 (removed 49) transitions.
// Phase 1: matrix 341 rows 399 cols
[2021-05-08 12:40:43] [INFO ] Computed 62 place invariants in 38 ms
[2021-05-08 12:40:43] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 341 rows 399 cols
[2021-05-08 12:40:43] [INFO ] Computed 62 place invariants in 10 ms
[2021-05-08 12:40:43] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
// Phase 1: matrix 341 rows 399 cols
[2021-05-08 12:40:43] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 12:40:44] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 399/439 places, 341/390 transitions.
[2021-05-08 12:40:44] [INFO ] Flatten gal took : 62 ms
[2021-05-08 12:40:44] [INFO ] Flatten gal took : 29 ms
[2021-05-08 12:40:44] [INFO ] Input system was already deterministic with 341 transitions.
Incomplete random walk after 100000 steps, including 847 resets, run finished after 395 ms. (steps per millisecond=253 ) properties (out of 12) seen :9
Running SMT prover for 3 properties.
// Phase 1: matrix 341 rows 399 cols
[2021-05-08 12:40:44] [INFO ] Computed 62 place invariants in 12 ms
[2021-05-08 12:40:44] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2021-05-08 12:40:44] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 24 ms returned sat
[2021-05-08 12:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:40:45] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-08 12:40:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:40:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-08 12:40:45] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 15 ms returned sat
[2021-05-08 12:40:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:40:45] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-08 12:40:45] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 5 ms to minimize.
[2021-05-08 12:40:45] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2021-05-08 12:40:45] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2021-05-08 12:40:45] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
[2021-05-08 12:40:45] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2021-05-08 12:40:45] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 1 ms to minimize.
[2021-05-08 12:40:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 506 ms
[2021-05-08 12:40:45] [INFO ] Computed and/alt/rep : 335/729/335 causal constraints (skipped 5 transitions) in 18 ms.
[2021-05-08 12:40:47] [INFO ] Added : 327 causal constraints over 66 iterations in 1809 ms. Result :sat
[2021-05-08 12:40:47] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2021-05-08 12:40:47] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 16 ms returned sat
[2021-05-08 12:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:40:47] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-08 12:40:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:40:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2021-05-08 12:40:48] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 14 ms returned sat
[2021-05-08 12:40:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:40:48] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-08 12:40:48] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2021-05-08 12:40:48] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2021-05-08 12:40:48] [INFO ] Deduced a trap composed of 21 places in 15 ms of which 0 ms to minimize.
[2021-05-08 12:40:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2021-05-08 12:40:48] [INFO ] Computed and/alt/rep : 335/729/335 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-08 12:40:49] [INFO ] Added : 186 causal constraints over 38 iterations in 839 ms. Result :sat
[2021-05-08 12:40:49] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2021-05-08 12:40:49] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 14 ms returned sat
[2021-05-08 12:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:40:49] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-08 12:40:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:40:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2021-05-08 12:40:49] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 14 ms returned sat
[2021-05-08 12:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:40:49] [INFO ] [Nat]Absence check using state equation in 49 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
[2021-05-08 12:40:49] [INFO ] Initial state test concluded for 1 properties.
FORMULA DES-PT-40b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 341/341 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 398 transition count 322
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 380 transition count 322
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 36 place count 380 transition count 310
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 60 place count 368 transition count 310
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 365 transition count 307
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 365 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 365 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 365 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 364 transition count 304
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 363 transition count 303
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 363 transition count 303
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 3 with 152 rules applied. Total rules applied 224 place count 287 transition count 227
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 3 with 4 rules applied. Total rules applied 228 place count 285 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 229 place count 284 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 230 place count 283 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 282 transition count 227
Applied a total of 231 rules in 165 ms. Remains 282 /399 variables (removed 117) and now considering 227/341 (removed 114) transitions.
// Phase 1: matrix 227 rows 282 cols
[2021-05-08 12:40:49] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 12:40:49] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 227 rows 282 cols
[2021-05-08 12:40:49] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 12:40:50] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2021-05-08 12:40:50] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 227 rows 282 cols
[2021-05-08 12:40:50] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-08 12:40:50] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 282/399 places, 227/341 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-40b-01 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}]], initial=0, aps=[p0:(EQ s124 1), p1:(OR (EQ s195 0) (EQ s47 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 13 steps with 0 reset in 2 ms.
FORMULA DES-PT-40b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-01 finished in 1028 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U (p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 341/341 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 396 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 396 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 396 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 395 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 395 transition count 335
Applied a total of 10 rules in 62 ms. Remains 395 /399 variables (removed 4) and now considering 335/341 (removed 6) transitions.
// Phase 1: matrix 335 rows 395 cols
[2021-05-08 12:40:50] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 12:40:50] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 335 rows 395 cols
[2021-05-08 12:40:50] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 12:40:51] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
// Phase 1: matrix 335 rows 395 cols
[2021-05-08 12:40:51] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 12:40:51] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 395/399 places, 335/341 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-40b-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s388 1), p2:(OR (EQ s264 0) (EQ s381 1)), p0:(AND (EQ s381 0) (EQ s264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-02 finished in 1082 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 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 341/341 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 398 transition count 322
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 380 transition count 322
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 36 place count 380 transition count 310
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 60 place count 368 transition count 310
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 365 transition count 307
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 365 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 365 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 365 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 364 transition count 304
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 363 transition count 303
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 363 transition count 303
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 226 place count 286 transition count 226
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 3 with 4 rules applied. Total rules applied 230 place count 284 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 283 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 232 place count 282 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 281 transition count 226
Applied a total of 233 rules in 96 ms. Remains 281 /399 variables (removed 118) and now considering 226/341 (removed 115) transitions.
// Phase 1: matrix 226 rows 281 cols
[2021-05-08 12:40:51] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 12:40:51] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 226 rows 281 cols
[2021-05-08 12:40:51] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 12:40:52] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2021-05-08 12:40:52] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 226 rows 281 cols
[2021-05-08 12:40:52] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 12:40:52] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 281/399 places, 226/341 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-03 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:(OR (EQ s156 0) (EQ s17 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 5479 reset in 378 ms.
Product exploration explored 100000 steps with 5447 reset in 335 ms.
Graph (complete) has 962 edges and 281 vertex of which 277 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5438 reset in 230 ms.
Product exploration explored 100000 steps with 5423 reset in 251 ms.
[2021-05-08 12:40:53] [INFO ] Flatten gal took : 21 ms
[2021-05-08 12:40:53] [INFO ] Flatten gal took : 37 ms
[2021-05-08 12:40:53] [INFO ] Time to serialize gal into /tmp/LTL9833706807635708723.gal : 9 ms
[2021-05-08 12:40:53] [INFO ] Time to serialize properties into /tmp/LTL9633056921788169515.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/LTL9833706807635708723.gal, -t, CGAL, -LTL, /tmp/LTL9633056921788169515.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/LTL9833706807635708723.gal -t CGAL -LTL /tmp/LTL9633056921788169515.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p161==0)||(p22==1))"))))
Formula 0 simplified : !GF"((p161==0)||(p22==1))"
Detected timeout of ITS tools.
[2021-05-08 12:41:08] [INFO ] Flatten gal took : 43 ms
[2021-05-08 12:41:08] [INFO ] Applying decomposition
[2021-05-08 12:41:08] [INFO ] Flatten gal took : 44 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/graph2249231150968583020.txt, -o, /tmp/graph2249231150968583020.bin, -w, /tmp/graph2249231150968583020.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/graph2249231150968583020.bin, -l, -1, -v, -w, /tmp/graph2249231150968583020.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:41:09] [INFO ] Decomposing Gal with order
[2021-05-08 12:41:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:41:09] [INFO ] Removed a total of 76 redundant transitions.
[2021-05-08 12:41:09] [INFO ] Flatten gal took : 53 ms
[2021-05-08 12:41:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 8 ms.
[2021-05-08 12:41:09] [INFO ] Time to serialize gal into /tmp/LTL38496507268142978.gal : 5 ms
[2021-05-08 12:41:09] [INFO ] Time to serialize properties into /tmp/LTL9558790879624665700.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/LTL38496507268142978.gal, -t, CGAL, -LTL, /tmp/LTL9558790879624665700.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/LTL38496507268142978.gal -t CGAL -LTL /tmp/LTL9558790879624665700.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((u2.p161==0)||(i4.u11.p22==1))"))))
Formula 0 simplified : !GF"((u2.p161==0)||(i4.u11.p22==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18276040807223424331
[2021-05-08 12:41:24] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18276040807223424331
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/ltsmin18276040807223424331]
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/ltsmin18276040807223424331] 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/ltsmin18276040807223424331] 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-40b-03 finished in 33589 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||(F(p1)&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 341/341 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 397 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 397 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 397 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 396 transition count 337
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 396 transition count 337
Applied a total of 7 rules in 55 ms. Remains 396 /399 variables (removed 3) and now considering 337/341 (removed 4) transitions.
// Phase 1: matrix 337 rows 396 cols
[2021-05-08 12:41:25] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 12:41:25] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 337 rows 396 cols
[2021-05-08 12:41:25] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 12:41:26] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
// Phase 1: matrix 337 rows 396 cols
[2021-05-08 12:41:26] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 12:41:26] [INFO ] Dead Transitions using invariants and state equation in 256 ms returned []
Finished structural reductions, in 1 iterations. Remains : 396/399 places, 337/341 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), true, (NOT p0)]
Running random walk in product with property : DES-PT-40b-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 4}, { cond=(NOT p2), acceptance={0} source=0 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 6}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(OR (NEQ s330 0) (NEQ s177 1)), p2:(NEQ s222 1), p0:(AND (EQ s222 1) (OR (EQ s133 0) (EQ s227 1)) (OR (EQ s146 0) (EQ s203 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 366 steps with 2 reset in 2 ms.
FORMULA DES-PT-40b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-04 finished in 1282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 341/341 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 395 transition count 337
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 395 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 395 transition count 335
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 393 transition count 333
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 393 transition count 333
Applied a total of 14 rules in 45 ms. Remains 393 /399 variables (removed 6) and now considering 333/341 (removed 8) transitions.
// Phase 1: matrix 333 rows 393 cols
[2021-05-08 12:41:26] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 12:41:26] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 333 rows 393 cols
[2021-05-08 12:41:26] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 12:41:27] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
// Phase 1: matrix 333 rows 393 cols
[2021-05-08 12:41:27] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 12:41:27] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Finished structural reductions, in 1 iterations. Remains : 393/399 places, 333/341 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-13 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 s298 0) (NEQ s12 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 0 ms.
FORMULA DES-PT-40b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-13 finished in 974 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 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 341/341 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 398 transition count 323
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 381 transition count 323
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 34 place count 381 transition count 311
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 58 place count 369 transition count 311
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 366 transition count 308
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 366 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 366 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 366 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 365 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 364 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 364 transition count 304
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 3 with 152 rules applied. Total rules applied 222 place count 288 transition count 228
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 3 with 4 rules applied. Total rules applied 226 place count 286 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 227 place count 285 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 228 place count 284 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 283 transition count 228
Applied a total of 229 rules in 109 ms. Remains 283 /399 variables (removed 116) and now considering 228/341 (removed 113) transitions.
// Phase 1: matrix 228 rows 283 cols
[2021-05-08 12:41:27] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 12:41:27] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 228 rows 283 cols
[2021-05-08 12:41:27] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 12:41:28] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2021-05-08 12:41:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 228 rows 283 cols
[2021-05-08 12:41:28] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 12:41:28] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 283/399 places, 228/341 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-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:(OR (EQ s213 0) (EQ s236 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 5479 reset in 299 ms.
Product exploration explored 100000 steps with 5494 reset in 451 ms.
Graph (complete) has 902 edges and 283 vertex of which 279 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5514 reset in 254 ms.
Product exploration explored 100000 steps with 5489 reset in 279 ms.
[2021-05-08 12:41:29] [INFO ] Flatten gal took : 34 ms
[2021-05-08 12:41:29] [INFO ] Flatten gal took : 30 ms
[2021-05-08 12:41:29] [INFO ] Time to serialize gal into /tmp/LTL16119349869433195775.gal : 3 ms
[2021-05-08 12:41:29] [INFO ] Time to serialize properties into /tmp/LTL547143126150399276.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/LTL16119349869433195775.gal, -t, CGAL, -LTL, /tmp/LTL547143126150399276.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/LTL16119349869433195775.gal -t CGAL -LTL /tmp/LTL547143126150399276.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p326==0)||(p368==1))"))))
Formula 0 simplified : !GF"((p326==0)||(p368==1))"
Detected timeout of ITS tools.
[2021-05-08 12:41:44] [INFO ] Flatten gal took : 16 ms
[2021-05-08 12:41:44] [INFO ] Applying decomposition
[2021-05-08 12:41:44] [INFO ] Flatten gal took : 15 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/graph3515763976152554773.txt, -o, /tmp/graph3515763976152554773.bin, -w, /tmp/graph3515763976152554773.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/graph3515763976152554773.bin, -l, -1, -v, -w, /tmp/graph3515763976152554773.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:41:45] [INFO ] Decomposing Gal with order
[2021-05-08 12:41:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:41:45] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-08 12:41:45] [INFO ] Flatten gal took : 24 ms
[2021-05-08 12:41:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2021-05-08 12:41:45] [INFO ] Time to serialize gal into /tmp/LTL13469095243639962867.gal : 4 ms
[2021-05-08 12:41:45] [INFO ] Time to serialize properties into /tmp/LTL6878441544691590936.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/LTL13469095243639962867.gal, -t, CGAL, -LTL, /tmp/LTL6878441544691590936.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/LTL13469095243639962867.gal -t CGAL -LTL /tmp/LTL6878441544691590936.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.i5.u17.p326==0)||(i4.i7.u37.p368==1))"))))
Formula 0 simplified : !GF"((i4.i5.u17.p326==0)||(i4.i7.u37.p368==1))"
Reverse transition relation is NOT exact ! Due to transitions t0, t333_t80, t300_t35, t299_t26, t108_t109_t121_t340_t127_t124_t125_t117_t118, t108_t109_t121_t340_t127_t124_t125_t119_t120, u2.t216, u2.t217, u2.t218, u2.t219, u2.t220, u2.t221, u2.t222, u2.t223, u2.t224, u2.t225, u2.t226, u2.t227, u2.t228, u2.t229, u2.t230, u2.t231, u2.t232, u2.t233, u2.t234, u2.t235, u2.t236, u2.t237, u2.t238, u2.t239, u2.t240, u2.t241, u2.t242, u2.t243, u2.t244, u2.t245, u2.t246, u2.t247, u2.t248, u2.t249, u2.t250, u2.t251, u44.t11.t17, i0.t331_t98_t90, i0.u0.t294.t129.t101.t102.t103.t339, i0.u6.t1.t98.t90, i0.u6.t2.t92.t93.t94.t338, i4.t7_t49_t40, i5.t10_t35, i5.t9_t35, i5.t310, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/170/51/221
Computing Next relation with stutter on 1.24841e+08 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11488583439538606889
[2021-05-08 12:42:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11488583439538606889
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/ltsmin11488583439538606889]
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/ltsmin11488583439538606889] 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/ltsmin11488583439538606889] 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-40b-15 finished in 33647 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-08 12:42:01] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin2271854046303002964
[2021-05-08 12:42:01] [INFO ] Flatten gal took : 22 ms
[2021-05-08 12:42:01] [INFO ] Computing symmetric may disable matrix : 341 transitions.
[2021-05-08 12:42:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 12:42:01] [INFO ] Computing symmetric may enable matrix : 341 transitions.
[2021-05-08 12:42:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 12:42:01] [INFO ] Computing Do-Not-Accords matrix : 341 transitions.
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/graph8804759920457538503.txt, -o, /tmp/graph8804759920457538503.bin, -w, /tmp/graph8804759920457538503.weights], workingDir=null]
[2021-05-08 12:42:01] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 12:42:01] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2271854046303002964
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/ltsmin2271854046303002964]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8804759920457538503.bin, -l, -1, -v, -w, /tmp/graph8804759920457538503.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:42:01] [INFO ] Decomposing Gal with order
[2021-05-08 12:42:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:42:01] [INFO ] Removed a total of 15 redundant transitions.
[2021-05-08 12:42:01] [INFO ] Flatten gal took : 46 ms
[2021-05-08 12:42:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2021-05-08 12:42:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality4843941410601723134.gal : 17 ms
[2021-05-08 12:42:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality9462914013273680924.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/LTLCardinality4843941410601723134.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9462914013273680924.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/LTLCardinality4843941410601723134.gal -t CGAL -LTL /tmp/LTLCardinality9462914013273680924.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G(F("((i3.u8.p161==0)||(u33.p22==1))"))))
Formula 0 simplified : !GF"((i3.u8.p161==0)||(u33.p22==1))"
Compilation finished in 1803 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2271854046303002964]
Link finished in 48 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2271854046303002964]
LTSmin run took 2065 ms.
FORMULA DES-PT-40b-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2271854046303002964]
Reverse transition relation is NOT exact ! Due to transitions t0, t62, t99, t154, t288, t345, t346, t379, u33.t80, u31.t83, i2.u13.t130, i2.u7.t159, i2.u7.t160, i2.u11.t137, i3.t141, i3.u8.t253, i3.u8.t254, i3.u8.t255, i3.u8.t256, i3.u8.t257, i3.u8.t258, i3.u8.t259, i3.u8.t260, i3.u8.t261, i3.u8.t262, i3.u8.t263, i3.u8.t264, i3.u8.t265, i3.u8.t266, i3.u8.t267, i3.u8.t268, i3.u8.t269, i3.u8.t270, i3.u8.t271, i3.u8.t272, i3.u8.t273, i3.u8.t274, i3.u8.t275, i3.u8.t276, i3.u8.t277, i3.u8.t278, i3.u8.t279, i3.u8.t280, i3.u8.t281, i3.u8.t282, i3.u8.t283, i3.u8.t284, i3.u8.t285, i3.u8.t286, i3.u8.t287, i4.u6.t165, i4.u6.t166, i4.u18.t112, i4.u21.t388, i5.t377, i5.u17.t118, i5.u23.t1, i5.u23.t109, i5.u25.t387, i5.u28.t98, i7.t66, i7.t64, i7.u49.t68, i7.u50.t67, i7.u51.t65, i8.t58, i8.i0.i0.u52.t63, i8.i0.i1.t60, i8.i0.i1.u53.t61, i8.i1.t54, i8.i1.u54.t59, i8.i1.i0.t56, i8.i1.i0.u55.t57, i8.i1.i1.u39.t76, i8.i1.i2.u56.t55, i8.i1.i2.u57.t52, i9.t357, i9.t10, i9.t9, i9.u35.t78, i9.u73.t23, i9.u73.t27, i9.u65.t41, i9.u66.t38, i10.t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/252/85/337
Computing Next relation with stutter on 2.45489e+08 deadlock states
WARNING : LTSmin timed out (>514 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2271854046303002964]
Retrying LTSmin with larger timeout 4112 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2271854046303002964]
Detected timeout of ITS tools.
[2021-05-08 13:02:27] [INFO ] Applying decomposition
[2021-05-08 13:02:27] [INFO ] Flatten gal took : 38 ms
[2021-05-08 13:02:27] [INFO ] Decomposing Gal with order
[2021-05-08 13:02:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 13:02:27] [INFO ] Removed a total of 166 redundant transitions.
[2021-05-08 13:02:27] [INFO ] Flatten gal took : 83 ms
[2021-05-08 13:02:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 552 labels/synchronizations in 52 ms.
[2021-05-08 13:02:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality2256218117323184578.gal : 13 ms
[2021-05-08 13:02:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality10345214780185466841.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/LTLCardinality2256218117323184578.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10345214780185466841.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/LTLCardinality2256218117323184578.gal -t CGAL -LTL /tmp/LTLCardinality10345214780185466841.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.u61.p326==0)||(i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u111.p368==1))"))))
Formula 0 simplified : !GF"((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.u61.p326==0)||(i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u111.p368==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: Initializing POR dependencies: labels 343, guards 341
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.199: LTL layer: formula: [](<>((LTLAPp1==true)))
pins2lts-mc-linux64( 1/ 8), 0.199: "[](<>((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.199: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.487: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.504: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.517: There are 345 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.518: State length is 400, there are 344 groups
pins2lts-mc-linux64( 0/ 8), 0.518: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.520: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.520: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.521: Visible groups: 4 / 344, labels: 1 / 345
pins2lts-mc-linux64( 0/ 8), 0.522: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.522: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.649: [Blue] ~95 levels ~960 states ~1192 transitions
pins2lts-mc-linux64( 6/ 8), 0.670: [Blue] ~96 levels ~1920 states ~2480 transitions
pins2lts-mc-linux64( 6/ 8), 0.692: [Blue] ~111 levels ~3840 states ~4968 transitions
pins2lts-mc-linux64( 1/ 8), 0.731: [Blue] ~122 levels ~7680 states ~9512 transitions
pins2lts-mc-linux64( 7/ 8), 0.785: [Blue] ~121 levels ~15360 states ~18696 transitions
pins2lts-mc-linux64( 7/ 8), 0.910: [Blue] ~239 levels ~30720 states ~39040 transitions
pins2lts-mc-linux64( 0/ 8), 1.208: [Blue] ~171 levels ~61440 states ~75448 transitions
pins2lts-mc-linux64( 4/ 8), 1.785: [Blue] ~219 levels ~122880 states ~233152 transitions
pins2lts-mc-linux64( 1/ 8), 2.945: [Blue] ~218 levels ~245760 states ~439528 transitions
pins2lts-mc-linux64( 7/ 8), 5.255: [Blue] ~3705 levels ~491520 states ~616608 transitions
pins2lts-mc-linux64( 3/ 8), 9.808: [Blue] ~217 levels ~983040 states ~1709168 transitions
pins2lts-mc-linux64( 7/ 8), 19.085: [Blue] ~5135 levels ~1966080 states ~2907144 transitions
pins2lts-mc-linux64( 7/ 8), 37.567: [Blue] ~6596 levels ~3932160 states ~5925032 transitions
pins2lts-mc-linux64( 7/ 8), 74.842: [Blue] ~8700 levels ~7864320 states ~12039232 transitions
pins2lts-mc-linux64( 7/ 8), 143.878: [Blue] ~13375 levels ~15728640 states ~24154528 transitions
pins2lts-mc-linux64( 7/ 8), 290.850: [Blue] ~23153 levels ~31457280 states ~49400040 transitions
pins2lts-mc-linux64( 3/ 8), 611.028: [Blue] ~9368 levels ~62914560 states ~113782344 transitions
pins2lts-mc-linux64( 7/ 8), 831.740: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 831.776:
pins2lts-mc-linux64( 0/ 8), 831.776: Explored 75427388 states 135323025 transitions, fanout: 1.794
pins2lts-mc-linux64( 0/ 8), 831.776: Total exploration time 831.230 sec (831.200 sec minimum, 831.211 sec on average)
pins2lts-mc-linux64( 0/ 8), 831.776: States per second: 90742, Transitions per second: 162799
pins2lts-mc-linux64( 0/ 8), 831.776:
pins2lts-mc-linux64( 0/ 8), 831.776: State space has 76433888 states, 20863663 are accepting
pins2lts-mc-linux64( 0/ 8), 831.776: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 831.776: blue states: 75427388 (98.68%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 831.776: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 831.776: all-red states: 20863663 (27.30%), bogus 48 (0.00%)
pins2lts-mc-linux64( 0/ 8), 831.776:
pins2lts-mc-linux64( 0/ 8), 831.776: Total memory used for local state coloring: 11.5MB
pins2lts-mc-linux64( 0/ 8), 831.776:
pins2lts-mc-linux64( 0/ 8), 831.776: Queue width: 8B, total height: 755156, memory: 5.76MB
pins2lts-mc-linux64( 0/ 8), 831.776: Tree memory: 839.1MB, 11.5 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 831.776: Tree fill ratio (roots/leafs): 56.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 831.776: Stored 343 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 831.776: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 831.776: Est. total memory use: 844.9MB (~1029.8MB 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2271854046303002964]
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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2271854046303002964]
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 13:22:54] [INFO ] Flatten gal took : 12 ms
[2021-05-08 13:22:54] [INFO ] Input system was already deterministic with 341 transitions.
[2021-05-08 13:22:54] [INFO ] Transformed 399 places.
[2021-05-08 13:22:54] [INFO ] Transformed 341 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 13:22:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality8212690874353453323.gal : 2 ms
[2021-05-08 13:22:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality11745869319662124429.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/LTLCardinality8212690874353453323.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11745869319662124429.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/LTLCardinality8212690874353453323.gal -t CGAL -LTL /tmp/LTLCardinality11745869319662124429.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 : !((G(F("((p326==0)||(p368==1))"))))
Formula 0 simplified : !GF"((p326==0)||(p368==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-40b"
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-40b, 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-162038396700124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 ;