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.r007-tall-162037989400025.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 ASLink-PT-02a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989400025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K 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.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 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 279K 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 ASLink-PT-02a-00
FORMULA_NAME ASLink-PT-02a-01
FORMULA_NAME ASLink-PT-02a-02
FORMULA_NAME ASLink-PT-02a-03
FORMULA_NAME ASLink-PT-02a-04
FORMULA_NAME ASLink-PT-02a-05
FORMULA_NAME ASLink-PT-02a-06
FORMULA_NAME ASLink-PT-02a-07
FORMULA_NAME ASLink-PT-02a-08
FORMULA_NAME ASLink-PT-02a-09
FORMULA_NAME ASLink-PT-02a-10
FORMULA_NAME ASLink-PT-02a-11
FORMULA_NAME ASLink-PT-02a-12
FORMULA_NAME ASLink-PT-02a-13
FORMULA_NAME ASLink-PT-02a-14
FORMULA_NAME ASLink-PT-02a-15

=== Now, execution of the tool begins

BK_START 1620392162112

Running Version 0
[2021-05-07 12:56:03] [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-07 12:56:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 12:56:03] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2021-05-07 12:56:03] [INFO ] Transformed 626 places.
[2021-05-07 12:56:03] [INFO ] Transformed 1008 transitions.
[2021-05-07 12:56:03] [INFO ] Found NUPN structural information;
[2021-05-07 12:56:03] [INFO ] Parsed PT model containing 626 places and 1008 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-07 12:56:03] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 614 transition count 998
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 607 transition count 973
Ensure Unique test removed 1 places
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 606 transition count 973
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 606 transition count 971
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 605 transition count 963
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 605 transition count 963
Applied a total of 31 rules in 120 ms. Remains 605 /626 variables (removed 21) and now considering 963/998 (removed 35) transitions.
// Phase 1: matrix 963 rows 605 cols
[2021-05-07 12:56:04] [INFO ] Computed 105 place invariants in 58 ms
[2021-05-07 12:56:04] [INFO ] Implicit Places using invariants in 534 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 387, 392, 403, 408, 409, 410, 443, 445, 448, 466, 467, 468, 469, 486, 494, 502, 508, 514, 520, 526, 534, 540, 546, 554]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 559 ms to find 38 implicit places.
// Phase 1: matrix 963 rows 567 cols
[2021-05-07 12:56:04] [INFO ] Computed 67 place invariants in 19 ms
[2021-05-07 12:56:04] [INFO ] Dead Transitions using invariants and state equation in 395 ms returned []
Starting structural reductions, iteration 1 : 567/626 places, 963/998 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 555 transition count 951
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 555 transition count 951
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 546 transition count 942
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 546 transition count 942
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 542 transition count 938
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 542 transition count 938
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 541 transition count 937
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 541 transition count 937
Applied a total of 52 rules in 102 ms. Remains 541 /567 variables (removed 26) and now considering 937/963 (removed 26) transitions.
// Phase 1: matrix 937 rows 541 cols
[2021-05-07 12:56:05] [INFO ] Computed 67 place invariants in 13 ms
[2021-05-07 12:56:05] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 937 rows 541 cols
[2021-05-07 12:56:05] [INFO ] Computed 67 place invariants in 14 ms
[2021-05-07 12:56:06] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 541/626 places, 937/998 transitions.
[2021-05-07 12:56:06] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-07 12:56:06] [INFO ] Flatten gal took : 111 ms
FORMULA ASLink-PT-02a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 12:56:06] [INFO ] Flatten gal took : 66 ms
[2021-05-07 12:56:06] [INFO ] Input system was already deterministic with 937 transitions.
Incomplete random walk after 100000 steps, including 1178 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 17) seen :12
Running SMT prover for 5 properties.
// Phase 1: matrix 937 rows 541 cols
[2021-05-07 12:56:06] [INFO ] Computed 67 place invariants in 14 ms
[2021-05-07 12:56:07] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:56:07] [INFO ] [Real]Absence check using 18 positive and 49 generalized place invariants in 10 ms returned sat
[2021-05-07 12:56:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:07] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2021-05-07 12:56:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:56:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:56:07] [INFO ] [Nat]Absence check using 18 positive and 49 generalized place invariants in 10 ms returned sat
[2021-05-07 12:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:07] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2021-05-07 12:56:07] [INFO ] Computed and/alt/rep : 348/858/348 causal constraints (skipped 588 transitions) in 57 ms.
[2021-05-07 12:56:10] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 8 ms to minimize.
[2021-05-07 12:56:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2021-05-07 12:56:10] [INFO ] Added : 294 causal constraints over 59 iterations in 3030 ms. Result :sat
[2021-05-07 12:56:10] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:56:10] [INFO ] [Real]Absence check using 18 positive and 49 generalized place invariants in 10 ms returned sat
[2021-05-07 12:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:11] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2021-05-07 12:56:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:56:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned unsat
[2021-05-07 12:56:11] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2021-05-07 12:56:11] [INFO ] [Real]Absence check using 18 positive and 49 generalized place invariants in 8 ms returned sat
[2021-05-07 12:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:11] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2021-05-07 12:56:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:56:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:56:11] [INFO ] [Nat]Absence check using 18 positive and 49 generalized place invariants in 9 ms returned sat
[2021-05-07 12:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:11] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2021-05-07 12:56:11] [INFO ] Computed and/alt/rep : 348/858/348 causal constraints (skipped 588 transitions) in 81 ms.
[2021-05-07 12:56:19] [INFO ] Added : 195 causal constraints over 39 iterations in 7667 ms. Result :unknown
[2021-05-07 12:56:19] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:56:19] [INFO ] [Real]Absence check using 18 positive and 49 generalized place invariants in 9 ms returned sat
[2021-05-07 12:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:19] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-07 12:56:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:56:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-07 12:56:19] [INFO ] [Nat]Absence check using 18 positive and 49 generalized place invariants in 10 ms returned sat
[2021-05-07 12:56:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:20] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-07 12:56:20] [INFO ] Computed and/alt/rep : 348/858/348 causal constraints (skipped 588 transitions) in 62 ms.
[2021-05-07 12:56:22] [INFO ] Added : 267 causal constraints over 54 iterations in 2333 ms. Result :sat
[2021-05-07 12:56:22] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-07 12:56:22] [INFO ] [Real]Absence check using 18 positive and 49 generalized place invariants in 9 ms returned sat
[2021-05-07 12:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:22] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-07 12:56:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:56:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA ASLink-PT-02a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U (p1 U (p2||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 541/541 places, 937/937 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 540 transition count 836
Reduce places removed 102 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 104 rules applied. Total rules applied 204 place count 438 transition count 834
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 436 transition count 834
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 206 place count 436 transition count 765
Deduced a syphon composed of 69 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 159 rules applied. Total rules applied 365 place count 346 transition count 765
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 22 rules applied. Total rules applied 387 place count 337 transition count 752
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 400 place count 324 transition count 752
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 400 place count 324 transition count 743
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 418 place count 315 transition count 743
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 426 place count 307 transition count 728
Iterating global reduction 5 with 8 rules applied. Total rules applied 434 place count 307 transition count 728
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 440 place count 307 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 441 place count 306 transition count 722
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 441 place count 306 transition count 721
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 443 place count 305 transition count 721
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 446 place count 302 transition count 711
Iterating global reduction 7 with 3 rules applied. Total rules applied 449 place count 302 transition count 711
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 450 place count 302 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 451 place count 301 transition count 710
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 453 place count 299 transition count 701
Iterating global reduction 9 with 2 rules applied. Total rules applied 455 place count 299 transition count 701
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 456 place count 298 transition count 693
Iterating global reduction 9 with 1 rules applied. Total rules applied 457 place count 298 transition count 693
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 458 place count 297 transition count 685
Iterating global reduction 9 with 1 rules applied. Total rules applied 459 place count 297 transition count 685
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 460 place count 296 transition count 677
Iterating global reduction 9 with 1 rules applied. Total rules applied 461 place count 296 transition count 677
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 462 place count 295 transition count 669
Iterating global reduction 9 with 1 rules applied. Total rules applied 463 place count 295 transition count 669
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 464 place count 294 transition count 661
Iterating global reduction 9 with 1 rules applied. Total rules applied 465 place count 294 transition count 661
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 466 place count 293 transition count 653
Iterating global reduction 9 with 1 rules applied. Total rules applied 467 place count 293 transition count 653
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 468 place count 292 transition count 645
Iterating global reduction 9 with 1 rules applied. Total rules applied 469 place count 292 transition count 645
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 470 place count 291 transition count 637
Iterating global reduction 9 with 1 rules applied. Total rules applied 471 place count 291 transition count 637
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 472 place count 290 transition count 629
Iterating global reduction 9 with 1 rules applied. Total rules applied 473 place count 290 transition count 629
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 533 place count 260 transition count 599
Applied a total of 533 rules in 210 ms. Remains 260 /541 variables (removed 281) and now considering 599/937 (removed 338) transitions.
// Phase 1: matrix 599 rows 260 cols
[2021-05-07 12:56:23] [INFO ] Computed 35 place invariants in 6 ms
[2021-05-07 12:56:23] [INFO ] Implicit Places using invariants in 148 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 257]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 150 ms to find 10 implicit places.
[2021-05-07 12:56:23] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 599 rows 250 cols
[2021-05-07 12:56:23] [INFO ] Computed 25 place invariants in 10 ms
[2021-05-07 12:56:23] [INFO ] Dead Transitions using invariants and state equation in 217 ms returned []
Starting structural reductions, iteration 1 : 250/541 places, 599/937 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 250 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 249 transition count 598
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 245 transition count 594
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 245 transition count 594
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 241 transition count 590
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 241 transition count 590
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 239 transition count 588
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 239 transition count 588
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 235 transition count 584
Applied a total of 30 rules in 62 ms. Remains 235 /250 variables (removed 15) and now considering 584/599 (removed 15) transitions.
// Phase 1: matrix 584 rows 235 cols
[2021-05-07 12:56:23] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-07 12:56:23] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 584 rows 235 cols
[2021-05-07 12:56:23] [INFO ] Computed 25 place invariants in 5 ms
[2021-05-07 12:56:24] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 235/541 places, 584/937 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ASLink-PT-02a-00 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NEQ s109 1) (NEQ s230 0)), p1:(NEQ s230 0), p0:(OR (EQ s195 0) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-02a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-00 finished in 1502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 541/541 places, 937/937 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 540 transition count 836
Reduce places removed 102 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 104 rules applied. Total rules applied 204 place count 438 transition count 834
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 436 transition count 834
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 206 place count 436 transition count 765
Deduced a syphon composed of 69 places in 6 ms
Ensure Unique test removed 21 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 159 rules applied. Total rules applied 365 place count 346 transition count 765
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 22 rules applied. Total rules applied 387 place count 337 transition count 752
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 400 place count 324 transition count 752
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 400 place count 324 transition count 743
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 418 place count 315 transition count 743
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 425 place count 308 transition count 729
Iterating global reduction 5 with 7 rules applied. Total rules applied 432 place count 308 transition count 729
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 437 place count 308 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 437 place count 308 transition count 723
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 439 place count 307 transition count 723
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 440 place count 306 transition count 715
Iterating global reduction 6 with 1 rules applied. Total rules applied 441 place count 306 transition count 715
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 442 place count 305 transition count 707
Iterating global reduction 6 with 1 rules applied. Total rules applied 443 place count 305 transition count 707
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 444 place count 304 transition count 699
Iterating global reduction 6 with 1 rules applied. Total rules applied 445 place count 304 transition count 699
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 446 place count 303 transition count 691
Iterating global reduction 6 with 1 rules applied. Total rules applied 447 place count 303 transition count 691
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 448 place count 302 transition count 683
Iterating global reduction 6 with 1 rules applied. Total rules applied 449 place count 302 transition count 683
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 450 place count 301 transition count 675
Iterating global reduction 6 with 1 rules applied. Total rules applied 451 place count 301 transition count 675
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 452 place count 300 transition count 667
Iterating global reduction 6 with 1 rules applied. Total rules applied 453 place count 300 transition count 667
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 454 place count 299 transition count 659
Iterating global reduction 6 with 1 rules applied. Total rules applied 455 place count 299 transition count 659
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 456 place count 298 transition count 651
Iterating global reduction 6 with 1 rules applied. Total rules applied 457 place count 298 transition count 651
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 458 place count 297 transition count 643
Iterating global reduction 6 with 1 rules applied. Total rules applied 459 place count 297 transition count 643
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 460 place count 296 transition count 635
Iterating global reduction 6 with 1 rules applied. Total rules applied 461 place count 296 transition count 635
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 462 place count 295 transition count 627
Iterating global reduction 6 with 1 rules applied. Total rules applied 463 place count 295 transition count 627
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 464 place count 294 transition count 619
Iterating global reduction 6 with 1 rules applied. Total rules applied 465 place count 294 transition count 619
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 466 place count 293 transition count 611
Iterating global reduction 6 with 1 rules applied. Total rules applied 467 place count 293 transition count 611
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 533 place count 260 transition count 578
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 535 place count 258 transition count 576
Iterating global reduction 6 with 2 rules applied. Total rules applied 537 place count 258 transition count 576
Applied a total of 537 rules in 181 ms. Remains 258 /541 variables (removed 283) and now considering 576/937 (removed 361) transitions.
// Phase 1: matrix 576 rows 258 cols
[2021-05-07 12:56:24] [INFO ] Computed 35 place invariants in 5 ms
[2021-05-07 12:56:24] [INFO ] Implicit Places using invariants in 161 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 255]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 162 ms to find 10 implicit places.
[2021-05-07 12:56:24] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 576 rows 248 cols
[2021-05-07 12:56:24] [INFO ] Computed 25 place invariants in 5 ms
[2021-05-07 12:56:25] [INFO ] Dead Transitions using invariants and state equation in 229 ms returned []
Starting structural reductions, iteration 1 : 248/541 places, 576/937 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 248 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 247 transition count 575
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 243 transition count 571
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 243 transition count 571
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 239 transition count 567
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 239 transition count 567
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 237 transition count 565
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 237 transition count 565
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 233 transition count 561
Applied a total of 30 rules in 36 ms. Remains 233 /248 variables (removed 15) and now considering 561/576 (removed 15) transitions.
// Phase 1: matrix 561 rows 233 cols
[2021-05-07 12:56:25] [INFO ] Computed 25 place invariants in 5 ms
[2021-05-07 12:56:25] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 561 rows 233 cols
[2021-05-07 12:56:25] [INFO ] Computed 25 place invariants in 5 ms
[2021-05-07 12:56:25] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 233/541 places, 561/937 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-03 finished in 1195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 541/541 places, 937/937 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 538 transition count 927
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 538 transition count 927
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 535 transition count 917
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 535 transition count 917
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 532 transition count 907
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 532 transition count 907
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 529 transition count 897
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 529 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 527 transition count 888
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 527 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 526 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 526 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 525 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 525 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 524 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 524 transition count 864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 523 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 523 transition count 856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 522 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 522 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 521 transition count 840
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 521 transition count 840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 520 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 520 transition count 832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 519 transition count 824
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 519 transition count 824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 518 transition count 816
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 518 transition count 816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 517 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 517 transition count 808
Applied a total of 48 rules in 134 ms. Remains 517 /541 variables (removed 24) and now considering 808/937 (removed 129) transitions.
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:56:25] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 12:56:26] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:56:26] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 12:56:26] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:56:26] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 12:56:27] [INFO ] Dead Transitions using invariants and state equation in 334 ms returned []
Finished structural reductions, in 1 iterations. Remains : 517/541 places, 808/937 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s265 1), p0:(OR (EQ s257 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1233 reset in 279 ms.
Product exploration explored 100000 steps with 1196 reset in 362 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1199 reset in 211 ms.
Product exploration explored 100000 steps with 1142 reset in 228 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 517 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 517/517 places, 808/808 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 517 transition count 808
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 95 place count 517 transition count 859
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 135 place count 517 transition count 859
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 154 place count 498 transition count 840
Deduced a syphon composed of 118 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 173 place count 498 transition count 840
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 173 place count 498 transition count 840
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 498 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 497 transition count 839
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 497 transition count 839
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 184 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 242 place count 497 transition count 848
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 271 place count 468 transition count 819
Deduced a syphon composed of 155 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 300 place count 468 transition count 819
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 302 place count 468 transition count 827
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 158 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 303 place count 468 transition count 831
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 305 place count 466 transition count 825
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 307 place count 466 transition count 825
Deduced a syphon composed of 156 places in 0 ms
Applied a total of 307 rules in 129 ms. Remains 466 /517 variables (removed 51) and now considering 825/808 (removed -17) transitions.
[2021-05-07 12:56:28] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 825 rows 466 cols
[2021-05-07 12:56:28] [INFO ] Computed 67 place invariants in 8 ms
[2021-05-07 12:56:29] [INFO ] Dead Transitions using invariants and state equation in 469 ms returned []
Finished structural reductions, in 1 iterations. Remains : 466/517 places, 825/808 transitions.
Product exploration explored 100000 steps with 2052 reset in 561 ms.
Product exploration explored 100000 steps with 2044 reset in 386 ms.
[2021-05-07 12:56:30] [INFO ] Flatten gal took : 42 ms
[2021-05-07 12:56:30] [INFO ] Flatten gal took : 41 ms
[2021-05-07 12:56:30] [INFO ] Time to serialize gal into /tmp/LTL14989299016661238872.gal : 18 ms
[2021-05-07 12:56:30] [INFO ] Time to serialize properties into /tmp/LTL12561630084653005149.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/LTL14989299016661238872.gal, -t, CGAL, -LTL, /tmp/LTL12561630084653005149.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/LTL14989299016661238872.gal -t CGAL -LTL /tmp/LTL12561630084653005149.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((p280==0)||(p73==1))"))||(F("(p289==1)")))))
Formula 0 simplified : !X(G"((p280==0)||(p73==1))" | F"(p289==1)")
Detected timeout of ITS tools.
[2021-05-07 12:56:45] [INFO ] Flatten gal took : 37 ms
[2021-05-07 12:56:45] [INFO ] Applying decomposition
[2021-05-07 12:56:45] [INFO ] Flatten gal took : 35 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/graph16482942099807317391.txt, -o, /tmp/graph16482942099807317391.bin, -w, /tmp/graph16482942099807317391.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/graph16482942099807317391.bin, -l, -1, -v, -w, /tmp/graph16482942099807317391.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 12:56:45] [INFO ] Decomposing Gal with order
[2021-05-07 12:56:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 12:56:46] [INFO ] Removed a total of 1161 redundant transitions.
[2021-05-07 12:56:46] [INFO ] Flatten gal took : 118 ms
[2021-05-07 12:56:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 21 ms.
[2021-05-07 12:56:46] [INFO ] Time to serialize gal into /tmp/LTL6171532256826041382.gal : 8 ms
[2021-05-07 12:56:46] [INFO ] Time to serialize properties into /tmp/LTL11988487868628945150.ltl : 3 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/LTL6171532256826041382.gal, -t, CGAL, -LTL, /tmp/LTL11988487868628945150.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/LTL6171532256826041382.gal -t CGAL -LTL /tmp/LTL11988487868628945150.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("((i1.u78.p280==0)||(i0.u19.p73==1))"))||(F("(i6.u120.p289==1)")))))
Formula 0 simplified : !X(G"((i1.u78.p280==0)||(i0.u19.p73==1))" | F"(i6.u120.p289==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1464006441697894134
[2021-05-07 12:57:01] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1464006441697894134
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/ltsmin1464006441697894134]
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/ltsmin1464006441697894134] 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/ltsmin1464006441697894134] 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 ASLink-PT-02a-04 finished in 36543 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 541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 541/541 places, 937/937 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 538 transition count 927
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 538 transition count 927
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 535 transition count 917
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 535 transition count 917
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 532 transition count 907
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 532 transition count 907
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 529 transition count 897
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 529 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 527 transition count 888
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 527 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 526 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 526 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 525 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 525 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 524 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 524 transition count 864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 523 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 523 transition count 856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 522 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 522 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 521 transition count 840
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 521 transition count 840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 520 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 520 transition count 832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 519 transition count 824
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 519 transition count 824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 518 transition count 816
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 518 transition count 816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 517 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 517 transition count 808
Applied a total of 48 rules in 209 ms. Remains 517 /541 variables (removed 24) and now considering 808/937 (removed 129) transitions.
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:57:02] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-07 12:57:02] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:57:02] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-07 12:57:03] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:57:03] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 12:57:03] [INFO ] Dead Transitions using invariants and state equation in 356 ms returned []
Finished structural reductions, in 1 iterations. Remains : 517/541 places, 808/937 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-05 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:(OR (EQ s255 0) (EQ s334 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 5323 steps with 60 reset in 17 ms.
FORMULA ASLink-PT-02a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-05 finished in 1814 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 541/541 places, 937/937 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 538 transition count 927
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 538 transition count 927
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 535 transition count 917
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 535 transition count 917
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 532 transition count 907
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 532 transition count 907
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 529 transition count 897
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 529 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 527 transition count 888
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 527 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 526 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 526 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 525 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 525 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 524 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 524 transition count 864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 523 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 523 transition count 856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 522 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 522 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 521 transition count 840
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 521 transition count 840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 520 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 520 transition count 832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 519 transition count 824
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 519 transition count 824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 518 transition count 816
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 518 transition count 816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 517 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 517 transition count 808
Applied a total of 48 rules in 140 ms. Remains 517 /541 variables (removed 24) and now considering 808/937 (removed 129) transitions.
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:57:04] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 12:57:04] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:57:04] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-07 12:57:05] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:57:05] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-07 12:57:05] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
Finished structural reductions, in 1 iterations. Remains : 517/541 places, 808/937 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-06 finished in 1623 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 541/541 places, 937/937 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 538 transition count 927
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 538 transition count 927
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 535 transition count 917
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 535 transition count 917
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 532 transition count 907
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 532 transition count 907
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 529 transition count 897
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 529 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 527 transition count 888
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 527 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 526 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 526 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 525 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 525 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 524 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 524 transition count 864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 523 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 523 transition count 856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 522 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 522 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 521 transition count 840
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 521 transition count 840
Applied a total of 40 rules in 104 ms. Remains 521 /541 variables (removed 20) and now considering 840/937 (removed 97) transitions.
// Phase 1: matrix 840 rows 521 cols
[2021-05-07 12:57:05] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 12:57:05] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 840 rows 521 cols
[2021-05-07 12:57:05] [INFO ] Computed 67 place invariants in 25 ms
[2021-05-07 12:57:06] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
// Phase 1: matrix 840 rows 521 cols
[2021-05-07 12:57:06] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 12:57:06] [INFO ] Dead Transitions using invariants and state equation in 351 ms returned []
Finished structural reductions, in 1 iterations. Remains : 521/541 places, 840/937 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-09 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s127 0) (EQ s327 1) (EQ s40 0) (EQ s261 1)), p1:(AND (EQ s145 0) (EQ s404 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-09 finished in 1415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((p0 U (G(p0)||(G(p2)&&p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 541/541 places, 937/937 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 539 transition count 935
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 539 transition count 935
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 537 transition count 933
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 537 transition count 933
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 535 transition count 931
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 535 transition count 931
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 533 transition count 929
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 533 transition count 929
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 532 transition count 928
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 532 transition count 928
Applied a total of 18 rules in 44 ms. Remains 532 /541 variables (removed 9) and now considering 928/937 (removed 9) transitions.
// Phase 1: matrix 928 rows 532 cols
[2021-05-07 12:57:07] [INFO ] Computed 67 place invariants in 7 ms
[2021-05-07 12:57:07] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 928 rows 532 cols
[2021-05-07 12:57:07] [INFO ] Computed 67 place invariants in 7 ms
[2021-05-07 12:57:08] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
// Phase 1: matrix 928 rows 532 cols
[2021-05-07 12:57:08] [INFO ] Computed 67 place invariants in 7 ms
[2021-05-07 12:57:08] [INFO ] Dead Transitions using invariants and state equation in 376 ms returned []
Finished structural reductions, in 1 iterations. Remains : 532/541 places, 928/937 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-02a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=3 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (NEQ s151 0) (NEQ s408 1)), p0:(AND (NEQ s151 0) (NEQ s408 1)), p2:(AND (NEQ s140 0) (NEQ s424 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-10 finished in 1566 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 541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 541/541 places, 937/937 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 538 transition count 927
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 538 transition count 927
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 535 transition count 917
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 535 transition count 917
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 532 transition count 907
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 532 transition count 907
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 529 transition count 897
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 529 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 527 transition count 888
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 527 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 526 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 526 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 525 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 525 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 524 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 524 transition count 864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 523 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 523 transition count 856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 522 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 522 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 521 transition count 840
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 521 transition count 840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 520 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 520 transition count 832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 519 transition count 824
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 519 transition count 824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 518 transition count 816
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 518 transition count 816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 517 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 517 transition count 808
Applied a total of 48 rules in 114 ms. Remains 517 /541 variables (removed 24) and now considering 808/937 (removed 129) transitions.
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:57:08] [INFO ] Computed 67 place invariants in 7 ms
[2021-05-07 12:57:08] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:57:08] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-07 12:57:09] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
// Phase 1: matrix 808 rows 517 cols
[2021-05-07 12:57:09] [INFO ] Computed 67 place invariants in 15 ms
[2021-05-07 12:57:10] [INFO ] Dead Transitions using invariants and state equation in 329 ms returned []
Finished structural reductions, in 1 iterations. Remains : 517/541 places, 808/937 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-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 (EQ s167 0) (EQ s464 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 ASLink-PT-02a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-13 finished in 1495 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 541 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 541/541 places, 937/937 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 540 transition count 835
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 206 place count 437 transition count 833
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 208 place count 435 transition count 833
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 208 place count 435 transition count 765
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 365 place count 346 transition count 765
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 22 rules applied. Total rules applied 387 place count 337 transition count 752
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 400 place count 324 transition count 752
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 400 place count 324 transition count 743
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 418 place count 315 transition count 743
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 426 place count 307 transition count 728
Iterating global reduction 5 with 8 rules applied. Total rules applied 434 place count 307 transition count 728
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 440 place count 307 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 441 place count 306 transition count 722
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 441 place count 306 transition count 721
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 443 place count 305 transition count 721
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 446 place count 302 transition count 711
Iterating global reduction 7 with 3 rules applied. Total rules applied 449 place count 302 transition count 711
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 450 place count 302 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 451 place count 301 transition count 710
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 453 place count 299 transition count 701
Iterating global reduction 9 with 2 rules applied. Total rules applied 455 place count 299 transition count 701
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 456 place count 298 transition count 693
Iterating global reduction 9 with 1 rules applied. Total rules applied 457 place count 298 transition count 693
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 458 place count 297 transition count 685
Iterating global reduction 9 with 1 rules applied. Total rules applied 459 place count 297 transition count 685
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 460 place count 296 transition count 677
Iterating global reduction 9 with 1 rules applied. Total rules applied 461 place count 296 transition count 677
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 462 place count 295 transition count 669
Iterating global reduction 9 with 1 rules applied. Total rules applied 463 place count 295 transition count 669
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 464 place count 294 transition count 661
Iterating global reduction 9 with 1 rules applied. Total rules applied 465 place count 294 transition count 661
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 466 place count 293 transition count 653
Iterating global reduction 9 with 1 rules applied. Total rules applied 467 place count 293 transition count 653
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 468 place count 292 transition count 645
Iterating global reduction 9 with 1 rules applied. Total rules applied 469 place count 292 transition count 645
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 470 place count 291 transition count 637
Iterating global reduction 9 with 1 rules applied. Total rules applied 471 place count 291 transition count 637
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 472 place count 290 transition count 629
Iterating global reduction 9 with 1 rules applied. Total rules applied 473 place count 290 transition count 629
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 474 place count 289 transition count 621
Iterating global reduction 9 with 1 rules applied. Total rules applied 475 place count 289 transition count 621
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 476 place count 288 transition count 613
Iterating global reduction 9 with 1 rules applied. Total rules applied 477 place count 288 transition count 613
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 478 place count 287 transition count 605
Iterating global reduction 9 with 1 rules applied. Total rules applied 479 place count 287 transition count 605
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 539 place count 257 transition count 575
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 540 place count 256 transition count 574
Iterating global reduction 9 with 1 rules applied. Total rules applied 541 place count 256 transition count 574
Applied a total of 541 rules in 113 ms. Remains 256 /541 variables (removed 285) and now considering 574/937 (removed 363) transitions.
// Phase 1: matrix 574 rows 256 cols
[2021-05-07 12:57:10] [INFO ] Computed 35 place invariants in 4 ms
[2021-05-07 12:57:10] [INFO ] Implicit Places using invariants in 142 ms returned [72, 89, 95, 100, 159, 176, 188, 190, 253]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 151 ms to find 9 implicit places.
[2021-05-07 12:57:10] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 574 rows 247 cols
[2021-05-07 12:57:10] [INFO ] Computed 26 place invariants in 4 ms
[2021-05-07 12:57:10] [INFO ] Dead Transitions using invariants and state equation in 283 ms returned []
Starting structural reductions, iteration 1 : 247/541 places, 574/937 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 247 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 246 transition count 573
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 243 transition count 570
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 243 transition count 570
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 240 transition count 567
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 240 transition count 567
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 239 transition count 566
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 239 transition count 566
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 235 transition count 562
Applied a total of 24 rules in 60 ms. Remains 235 /247 variables (removed 12) and now considering 562/574 (removed 12) transitions.
// Phase 1: matrix 562 rows 235 cols
[2021-05-07 12:57:10] [INFO ] Computed 26 place invariants in 4 ms
[2021-05-07 12:57:11] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 562 rows 235 cols
[2021-05-07 12:57:11] [INFO ] Computed 26 place invariants in 4 ms
[2021-05-07 12:57:11] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 235/541 places, 562/937 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s217 0) (EQ s168 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]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-15 finished in 1336 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5916124708578611206
[2021-05-07 12:57:11] [INFO ] Applying decomposition
[2021-05-07 12:57:11] [INFO ] Computing symmetric may disable matrix : 937 transitions.
[2021-05-07 12:57:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 12:57:11] [INFO ] Computing symmetric may enable matrix : 937 transitions.
[2021-05-07 12:57:11] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 12:57:11] [INFO ] Flatten gal took : 33 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/graph73622439585008057.txt, -o, /tmp/graph73622439585008057.bin, -w, /tmp/graph73622439585008057.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/graph73622439585008057.bin, -l, -1, -v, -w, /tmp/graph73622439585008057.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 12:57:11] [INFO ] Decomposing Gal with order
[2021-05-07 12:57:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 12:57:11] [INFO ] Removed a total of 1483 redundant transitions.
[2021-05-07 12:57:11] [INFO ] Flatten gal took : 58 ms
[2021-05-07 12:57:11] [INFO ] Computing Do-Not-Accords matrix : 937 transitions.
[2021-05-07 12:57:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 25 ms.
[2021-05-07 12:57:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality17407703877698434830.gal : 6 ms
[2021-05-07 12:57:11] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 12:57:11] [INFO ] Built C files in 309ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5916124708578611206
[2021-05-07 12:57:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality6668184810047670808.ltl : 0 ms
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/ltsmin5916124708578611206]
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/LTLCardinality17407703877698434830.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6668184810047670808.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/LTLCardinality17407703877698434830.gal -t CGAL -LTL /tmp/LTLCardinality6668184810047670808.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("((i2.u81.p280==0)||(i0.u20.p73==1))"))||(F("(i6.u122.p289==1)")))))
Formula 0 simplified : !X(G"((i2.u81.p280==0)||(i0.u20.p73==1))" | F"(i6.u122.p289==1)")
Compilation finished in 6268 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5916124708578611206]
Link finished in 77 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true))||<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5916124708578611206]
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t8, t9, t23, t489, t838, t893, t920, t975, i1.i1.t5, i3.t4, i4.i0.u38.t117, i4.i2.u48.t127, i4.i3.u54.t137, i5.t731, i5.t603, i6.t11, i7.i0.u93.t98, i7.i2.u103.t88, i7.i3.u109.t78, i8.t10, i8.i1.t6, i9.t25, i9.t22, i9.t21, i9.t20, i11.t829, i11.t812, i11.t805, i11.t799, i11.t788, i11.t172, i11.t165, i11.u151.t168, i11.u156.t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :441/434/39/914
Computing Next relation with stutter on 2.68735e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4739 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,47.4464,753540,1,0,1.05155e+06,81387,11774,2.98228e+06,1618,931875,1650131
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-02a-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1620392335766

--------------------
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="ASLink-PT-02a"
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 ASLink-PT-02a, 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 r007-tall-162037989400025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;