fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277017100724
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PolyORBLF-PT-S06J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16223.672 3600000.00 12494964.00 30817.20 FTFFFTFFFFF?FTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 31K Apr 29 14:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 29 14:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 248K Apr 29 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 29 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652927850771

Running Version 202205111006
[2022-05-19 02:37:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 02:37:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 02:37:32] [INFO ] Load time of PNML (sax parser for PT used): 699 ms
[2022-05-19 02:37:32] [INFO ] Transformed 894 places.
[2022-05-19 02:37:32] [INFO ] Transformed 14334 transitions.
[2022-05-19 02:37:32] [INFO ] Parsed PT model containing 894 places and 14334 transitions in 913 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 207 out of 894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 894/894 places, 3574/3574 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 888 transition count 3574
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 880 transition count 3566
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 880 transition count 3566
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 873 transition count 3559
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 873 transition count 3559
Applied a total of 36 rules in 276 ms. Remains 873 /894 variables (removed 21) and now considering 3559/3574 (removed 15) transitions.
[2022-05-19 02:37:33] [INFO ] Flow matrix only has 3511 transitions (discarded 48 similar events)
// Phase 1: matrix 3511 rows 873 cols
[2022-05-19 02:37:33] [INFO ] Computed 56 place invariants in 253 ms
[2022-05-19 02:37:37] [INFO ] Dead Transitions using invariants and state equation in 4479 ms found 1224 transitions.
Found 1224 dead transitions using SMT.
Drop transitions removed 1224 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1224 transitions.
[2022-05-19 02:37:37] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 873 cols
[2022-05-19 02:37:38] [INFO ] Computed 56 place invariants in 112 ms
[2022-05-19 02:37:38] [INFO ] Implicit Places using invariants in 971 ms returned [9, 12, 242, 370, 401, 539, 594, 736]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 980 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 865/894 places, 2335/3574 transitions.
Applied a total of 0 rules in 18 ms. Remains 865 /865 variables (removed 0) and now considering 2335/2335 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 865/894 places, 2335/3574 transitions.
Support contains 207 out of 865 places after structural reductions.
[2022-05-19 02:37:39] [INFO ] Flatten gal took : 236 ms
[2022-05-19 02:37:39] [INFO ] Flatten gal took : 158 ms
[2022-05-19 02:37:39] [INFO ] Input system was already deterministic with 2335 transitions.
Support contains 206 out of 865 places (down from 207) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 24) seen :21
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-19 02:37:40] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:37:40] [INFO ] Computed 48 place invariants in 64 ms
[2022-05-19 02:37:40] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-19 02:37:41] [INFO ] [Real]Absence check using 17 positive and 31 generalized place invariants in 42 ms returned sat
[2022-05-19 02:37:41] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-19 02:37:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2022-05-19 02:37:41] [INFO ] [Nat]Absence check using 17 positive and 31 generalized place invariants in 49 ms returned sat
[2022-05-19 02:37:53] [INFO ] After 12231ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 865 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 865 transition count 2279
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 809 transition count 2279
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 112 place count 809 transition count 2167
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 336 place count 697 transition count 2167
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 530 place count 600 transition count 2070
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 533 place count 597 transition count 2067
Iterating global reduction 2 with 3 rules applied. Total rules applied 536 place count 597 transition count 2067
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 552 place count 597 transition count 2051
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 568 place count 581 transition count 2051
Applied a total of 568 rules in 290 ms. Remains 581 /865 variables (removed 284) and now considering 2051/2335 (removed 284) transitions.
[2022-05-19 02:37:53] [INFO ] Flow matrix only has 2003 transitions (discarded 48 similar events)
// Phase 1: matrix 2003 rows 581 cols
[2022-05-19 02:37:53] [INFO ] Computed 48 place invariants in 45 ms
[2022-05-19 02:37:55] [INFO ] Dead Transitions using invariants and state equation in 1433 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/865 places, 2051/2335 transitions.
Finished random walk after 866 steps, including 6 resets, run visited all 1 properties in 10 ms. (steps per millisecond=86 )
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 18 out of 865 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 864 transition count 2334
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 864 transition count 2334
Applied a total of 2 rules in 62 ms. Remains 864 /865 variables (removed 1) and now considering 2334/2335 (removed 1) transitions.
[2022-05-19 02:37:55] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:37:55] [INFO ] Computed 48 place invariants in 63 ms
[2022-05-19 02:37:58] [INFO ] Dead Transitions using invariants and state equation in 3333 ms found 0 transitions.
[2022-05-19 02:37:58] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:37:58] [INFO ] Computed 48 place invariants in 61 ms
[2022-05-19 02:37:59] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2022-05-19 02:37:59] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:37:59] [INFO ] Computed 48 place invariants in 63 ms
[2022-05-19 02:38:00] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:38:05] [INFO ] Implicit Places using invariants and state equation in 5437 ms returned []
Implicit Place search using SMT with State Equation took 6627 ms to find 0 implicit places.
[2022-05-19 02:38:05] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:38:05] [INFO ] Computed 48 place invariants in 59 ms
[2022-05-19 02:38:08] [INFO ] Dead Transitions using invariants and state equation in 3504 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 864/865 places, 2334/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 864/865 places, 2334/2335 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s37 1) (LT s372 1) (LT s527 1)) (OR (LT s37 1) (LT s258 1) (LT s527 1)) (OR (LT s37 1) (LT s527 1) (LT s739 1)) (OR (LT s37 1) (LT s482 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-00 finished in 13804 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 66 out of 865 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 865 transition count 2279
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 809 transition count 2279
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 112 place count 809 transition count 2215
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 745 transition count 2215
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 434 place count 648 transition count 2118
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 437 place count 645 transition count 2115
Iterating global reduction 2 with 3 rules applied. Total rules applied 440 place count 645 transition count 2115
Applied a total of 440 rules in 250 ms. Remains 645 /865 variables (removed 220) and now considering 2115/2335 (removed 220) transitions.
[2022-05-19 02:38:09] [INFO ] Flow matrix only has 2067 transitions (discarded 48 similar events)
// Phase 1: matrix 2067 rows 645 cols
[2022-05-19 02:38:09] [INFO ] Computed 48 place invariants in 38 ms
[2022-05-19 02:38:11] [INFO ] Dead Transitions using invariants and state equation in 1973 ms found 0 transitions.
[2022-05-19 02:38:11] [INFO ] Flow matrix only has 2067 transitions (discarded 48 similar events)
// Phase 1: matrix 2067 rows 645 cols
[2022-05-19 02:38:11] [INFO ] Computed 48 place invariants in 42 ms
[2022-05-19 02:38:12] [INFO ] Implicit Places using invariants in 766 ms returned []
[2022-05-19 02:38:12] [INFO ] Flow matrix only has 2067 transitions (discarded 48 similar events)
// Phase 1: matrix 2067 rows 645 cols
[2022-05-19 02:38:12] [INFO ] Computed 48 place invariants in 59 ms
[2022-05-19 02:38:12] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:38:30] [INFO ] Implicit Places using invariants and state equation in 18591 ms returned []
Implicit Place search using SMT with State Equation took 19380 ms to find 0 implicit places.
[2022-05-19 02:38:30] [INFO ] Redundant transitions in 136 ms returned []
[2022-05-19 02:38:30] [INFO ] Flow matrix only has 2067 transitions (discarded 48 similar events)
// Phase 1: matrix 2067 rows 645 cols
[2022-05-19 02:38:30] [INFO ] Computed 48 place invariants in 47 ms
[2022-05-19 02:38:32] [INFO ] Dead Transitions using invariants and state equation in 2021 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 645/865 places, 2115/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 645/865 places, 2115/2335 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s53 1) (GEQ s562 1) (GEQ s638 1)) (AND (GEQ s166 1) (GEQ s179 1) (GEQ s562 1)) (AND (GEQ s418 1) (GEQ s562 1) (GEQ s633 1)) (AND (GEQ s56...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 320 steps with 0 reset in 11 ms.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-03 finished in 23885 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(G(G(p0))))&&p0)))'
Support contains 9 out of 865 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 865 transition count 2279
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 809 transition count 2279
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 112 place count 809 transition count 2167
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 336 place count 697 transition count 2167
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 514 place count 608 transition count 2078
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 517 place count 605 transition count 2075
Iterating global reduction 2 with 3 rules applied. Total rules applied 520 place count 605 transition count 2075
Applied a total of 520 rules in 138 ms. Remains 605 /865 variables (removed 260) and now considering 2075/2335 (removed 260) transitions.
[2022-05-19 02:38:33] [INFO ] Flow matrix only has 2027 transitions (discarded 48 similar events)
// Phase 1: matrix 2027 rows 605 cols
[2022-05-19 02:38:33] [INFO ] Computed 48 place invariants in 52 ms
[2022-05-19 02:38:35] [INFO ] Dead Transitions using invariants and state equation in 2007 ms found 0 transitions.
[2022-05-19 02:38:35] [INFO ] Flow matrix only has 2027 transitions (discarded 48 similar events)
// Phase 1: matrix 2027 rows 605 cols
[2022-05-19 02:38:35] [INFO ] Computed 48 place invariants in 59 ms
[2022-05-19 02:38:36] [INFO ] Implicit Places using invariants in 935 ms returned []
[2022-05-19 02:38:36] [INFO ] Flow matrix only has 2027 transitions (discarded 48 similar events)
// Phase 1: matrix 2027 rows 605 cols
[2022-05-19 02:38:36] [INFO ] Computed 48 place invariants in 37 ms
[2022-05-19 02:38:36] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:38:51] [INFO ] Implicit Places using invariants and state equation in 15352 ms returned []
Implicit Place search using SMT with State Equation took 16296 ms to find 0 implicit places.
[2022-05-19 02:38:51] [INFO ] Redundant transitions in 63 ms returned []
[2022-05-19 02:38:51] [INFO ] Flow matrix only has 2027 transitions (discarded 48 similar events)
// Phase 1: matrix 2027 rows 605 cols
[2022-05-19 02:38:51] [INFO ] Computed 48 place invariants in 34 ms
[2022-05-19 02:38:53] [INFO ] Dead Transitions using invariants and state equation in 1919 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/865 places, 2075/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/865 places, 2075/2335 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s35 1) (GEQ s406 2)) (AND (GEQ s53 1) (GEQ s406 2)) (AND (GEQ s406 2) (GEQ s504 1)) (AND (GEQ s74 1) (GEQ s406 2)) (AND (GEQ s406 2) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-06 finished in 20497 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(!p0) U p1)&&G(F(p2)))))'
Support contains 73 out of 865 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 864 transition count 2334
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 864 transition count 2334
Applied a total of 2 rules in 30 ms. Remains 864 /865 variables (removed 1) and now considering 2334/2335 (removed 1) transitions.
[2022-05-19 02:38:53] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:38:53] [INFO ] Computed 48 place invariants in 56 ms
[2022-05-19 02:38:56] [INFO ] Dead Transitions using invariants and state equation in 3175 ms found 0 transitions.
[2022-05-19 02:38:56] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:38:56] [INFO ] Computed 48 place invariants in 52 ms
[2022-05-19 02:38:57] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2022-05-19 02:38:57] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:38:57] [INFO ] Computed 48 place invariants in 67 ms
[2022-05-19 02:38:58] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:39:06] [INFO ] Implicit Places using invariants and state equation in 8236 ms returned []
Implicit Place search using SMT with State Equation took 9340 ms to find 0 implicit places.
[2022-05-19 02:39:06] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:39:06] [INFO ] Computed 48 place invariants in 66 ms
[2022-05-19 02:39:09] [INFO ] Dead Transitions using invariants and state equation in 3475 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 864/865 places, 2334/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 864/865 places, 2334/2335 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (OR (NOT p1) p0), true]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s662 1) (GEQ s50 1) (GEQ s648 1) (GEQ s8 1) (GEQ s358 1) (GEQ s167 1) (GEQ s843 1) (GEQ s493 1)), p1:(OR (GEQ s14 1) (GEQ s706 1) (GEQ s538 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 44 steps with 2 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-07 finished in 16254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 865 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 864 transition count 2334
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 864 transition count 2334
Applied a total of 2 rules in 33 ms. Remains 864 /865 variables (removed 1) and now considering 2334/2335 (removed 1) transitions.
[2022-05-19 02:39:09] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:39:09] [INFO ] Computed 48 place invariants in 55 ms
[2022-05-19 02:39:13] [INFO ] Dead Transitions using invariants and state equation in 3287 ms found 0 transitions.
[2022-05-19 02:39:13] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:39:13] [INFO ] Computed 48 place invariants in 76 ms
[2022-05-19 02:39:14] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2022-05-19 02:39:14] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:39:14] [INFO ] Computed 48 place invariants in 57 ms
[2022-05-19 02:39:14] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:39:20] [INFO ] Implicit Places using invariants and state equation in 5862 ms returned []
Implicit Place search using SMT with State Equation took 7048 ms to find 0 implicit places.
[2022-05-19 02:39:20] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:39:20] [INFO ] Computed 48 place invariants in 53 ms
[2022-05-19 02:39:23] [INFO ] Dead Transitions using invariants and state equation in 3438 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 864/865 places, 2334/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 864/865 places, 2334/2335 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s610 1) (LT s809 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-08 finished in 13944 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(G(p0)))||X(F(p1)))))'
Support contains 2 out of 865 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 865 transition count 2282
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 812 transition count 2281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 811 transition count 2281
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 108 place count 811 transition count 2168
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 334 place count 698 transition count 2168
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 524 place count 603 transition count 2073
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 527 place count 600 transition count 2070
Iterating global reduction 3 with 3 rules applied. Total rules applied 530 place count 600 transition count 2070
Applied a total of 530 rules in 131 ms. Remains 600 /865 variables (removed 265) and now considering 2070/2335 (removed 265) transitions.
[2022-05-19 02:39:23] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:39:23] [INFO ] Computed 48 place invariants in 34 ms
[2022-05-19 02:39:25] [INFO ] Dead Transitions using invariants and state equation in 1846 ms found 0 transitions.
[2022-05-19 02:39:25] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:39:25] [INFO ] Computed 48 place invariants in 35 ms
[2022-05-19 02:39:26] [INFO ] Implicit Places using invariants in 933 ms returned []
[2022-05-19 02:39:26] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:39:26] [INFO ] Computed 48 place invariants in 37 ms
[2022-05-19 02:39:27] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:39:38] [INFO ] Implicit Places using invariants and state equation in 12252 ms returned []
Implicit Place search using SMT with State Equation took 13187 ms to find 0 implicit places.
[2022-05-19 02:39:38] [INFO ] Redundant transitions in 81 ms returned []
[2022-05-19 02:39:38] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:39:38] [INFO ] Computed 48 place invariants in 41 ms
[2022-05-19 02:39:40] [INFO ] Dead Transitions using invariants and state equation in 1708 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/865 places, 2070/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/865 places, 2070/2335 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s388 1), p1:(GEQ s172 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1077 reset in 716 ms.
Product exploration explored 100000 steps with 1095 reset in 682 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 207 steps, including 1 resets, run visited all 2 properties in 5 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 2070/2070 transitions.
Applied a total of 0 rules in 42 ms. Remains 600 /600 variables (removed 0) and now considering 2070/2070 (removed 0) transitions.
[2022-05-19 02:39:42] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:39:42] [INFO ] Computed 48 place invariants in 42 ms
[2022-05-19 02:39:44] [INFO ] Dead Transitions using invariants and state equation in 1730 ms found 0 transitions.
[2022-05-19 02:39:44] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:39:44] [INFO ] Computed 48 place invariants in 36 ms
[2022-05-19 02:39:45] [INFO ] Implicit Places using invariants in 877 ms returned []
[2022-05-19 02:39:45] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:39:45] [INFO ] Computed 48 place invariants in 35 ms
[2022-05-19 02:39:46] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:40:00] [INFO ] Implicit Places using invariants and state equation in 14801 ms returned []
Implicit Place search using SMT with State Equation took 15679 ms to find 0 implicit places.
[2022-05-19 02:40:00] [INFO ] Redundant transitions in 84 ms returned []
[2022-05-19 02:40:00] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:40:00] [INFO ] Computed 48 place invariants in 40 ms
[2022-05-19 02:40:02] [INFO ] Dead Transitions using invariants and state equation in 1744 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/600 places, 2070/2070 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 93 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1084 reset in 645 ms.
Product exploration explored 100000 steps with 1087 reset in 670 ms.
Built C files in :
/tmp/ltsmin10645247932621596075
[2022-05-19 02:40:04] [INFO ] Too many transitions (2070) to apply POR reductions. Disabling POR matrices.
[2022-05-19 02:40:04] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10645247932621596075
Running compilation step : cd /tmp/ltsmin10645247932621596075;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10645247932621596075;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10645247932621596075;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 2070/2070 transitions.
Applied a total of 0 rules in 43 ms. Remains 600 /600 variables (removed 0) and now considering 2070/2070 (removed 0) transitions.
[2022-05-19 02:40:07] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:40:07] [INFO ] Computed 48 place invariants in 35 ms
[2022-05-19 02:40:09] [INFO ] Dead Transitions using invariants and state equation in 1795 ms found 0 transitions.
[2022-05-19 02:40:09] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:40:09] [INFO ] Computed 48 place invariants in 53 ms
[2022-05-19 02:40:10] [INFO ] Implicit Places using invariants in 894 ms returned []
[2022-05-19 02:40:10] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:40:10] [INFO ] Computed 48 place invariants in 36 ms
[2022-05-19 02:40:10] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:40:24] [INFO ] Implicit Places using invariants and state equation in 14030 ms returned []
Implicit Place search using SMT with State Equation took 14926 ms to find 0 implicit places.
[2022-05-19 02:40:24] [INFO ] Redundant transitions in 78 ms returned []
[2022-05-19 02:40:24] [INFO ] Flow matrix only has 2022 transitions (discarded 48 similar events)
// Phase 1: matrix 2022 rows 600 cols
[2022-05-19 02:40:24] [INFO ] Computed 48 place invariants in 41 ms
[2022-05-19 02:40:26] [INFO ] Dead Transitions using invariants and state equation in 1774 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/600 places, 2070/2070 transitions.
Built C files in :
/tmp/ltsmin16107656643626212803
[2022-05-19 02:40:26] [INFO ] Too many transitions (2070) to apply POR reductions. Disabling POR matrices.
[2022-05-19 02:40:26] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16107656643626212803
Running compilation step : cd /tmp/ltsmin16107656643626212803;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16107656643626212803;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16107656643626212803;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 02:40:29] [INFO ] Flatten gal took : 137 ms
[2022-05-19 02:40:29] [INFO ] Flatten gal took : 145 ms
[2022-05-19 02:40:29] [INFO ] Time to serialize gal into /tmp/LTL11975091213066934528.gal : 63 ms
[2022-05-19 02:40:29] [INFO ] Time to serialize properties into /tmp/LTL10363239794571845774.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11975091213066934528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10363239794571845774.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1197509...268
Read 1 LTL properties
Checking formula 0 : !((G((X(F(G("(Insert_Source_E_2<1)"))))||(X(F("(EnablePollingE_7>=1)"))))))
Formula 0 simplified : !G(XFG"(Insert_Source_E_2<1)" | XF"(EnablePollingE_7>=1)")
Detected timeout of ITS tools.
[2022-05-19 02:40:44] [INFO ] Flatten gal took : 98 ms
[2022-05-19 02:40:44] [INFO ] Applying decomposition
[2022-05-19 02:40:44] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14875294657780590459.txt' '-o' '/tmp/graph14875294657780590459.bin' '-w' '/tmp/graph14875294657780590459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14875294657780590459.bin' '-l' '-1' '-v' '-w' '/tmp/graph14875294657780590459.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:40:45] [INFO ] Decomposing Gal with order
[2022-05-19 02:40:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:40:45] [INFO ] Removed a total of 1406 redundant transitions.
[2022-05-19 02:40:45] [INFO ] Flatten gal took : 571 ms
[2022-05-19 02:40:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 253 labels/synchronizations in 40 ms.
[2022-05-19 02:40:46] [INFO ] Time to serialize gal into /tmp/LTL11069336007246969796.gal : 25 ms
[2022-05-19 02:40:46] [INFO ] Time to serialize properties into /tmp/LTL10850731571615547192.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11069336007246969796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10850731571615547192.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1106933...247
Read 1 LTL properties
Checking formula 0 : !((G((X(F(G("(i7.u22.Insert_Source_E_2<1)"))))||(X(F("(i7.u20.EnablePollingE_7>=1)"))))))
Formula 0 simplified : !G(XFG"(i7.u22.Insert_Source_E_2<1)" | XF"(i7.u20.EnablePollingE_7>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14349948708961629805
[2022-05-19 02:41:01] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14349948708961629805
Running compilation step : cd /tmp/ltsmin14349948708961629805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14349948708961629805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14349948708961629805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-09 finished in 100500 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0))||p1))))'
Support contains 3 out of 865 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Applied a total of 0 rules in 14 ms. Remains 865 /865 variables (removed 0) and now considering 2335/2335 (removed 0) transitions.
[2022-05-19 02:41:04] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:41:04] [INFO ] Computed 48 place invariants in 49 ms
[2022-05-19 02:41:07] [INFO ] Dead Transitions using invariants and state equation in 3318 ms found 0 transitions.
[2022-05-19 02:41:07] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:41:07] [INFO ] Computed 48 place invariants in 49 ms
[2022-05-19 02:41:08] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2022-05-19 02:41:08] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:41:08] [INFO ] Computed 48 place invariants in 55 ms
[2022-05-19 02:41:09] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:41:33] [INFO ] Implicit Places using invariants and state equation in 25130 ms returned []
Implicit Place search using SMT with State Equation took 26207 ms to find 0 implicit places.
[2022-05-19 02:41:33] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:41:33] [INFO ] Computed 48 place invariants in 69 ms
[2022-05-19 02:41:37] [INFO ] Dead Transitions using invariants and state equation in 3310 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 865/865 places, 2335/2335 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s221 1), p0:(OR (LT s36 1) (LT s495 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 622 reset in 578 ms.
Product exploration explored 100000 steps with 614 reset in 534 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 02:41:38] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:41:38] [INFO ] Computed 48 place invariants in 66 ms
[2022-05-19 02:41:39] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-19 02:41:39] [INFO ] [Real]Absence check using 17 positive and 31 generalized place invariants in 36 ms returned sat
[2022-05-19 02:41:39] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 865 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Applied a total of 0 rules in 20 ms. Remains 865 /865 variables (removed 0) and now considering 2335/2335 (removed 0) transitions.
[2022-05-19 02:41:39] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:41:39] [INFO ] Computed 48 place invariants in 59 ms
[2022-05-19 02:41:43] [INFO ] Dead Transitions using invariants and state equation in 3428 ms found 0 transitions.
[2022-05-19 02:41:43] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:41:43] [INFO ] Computed 48 place invariants in 50 ms
[2022-05-19 02:41:44] [INFO ] Implicit Places using invariants in 1125 ms returned []
[2022-05-19 02:41:44] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:41:44] [INFO ] Computed 48 place invariants in 69 ms
[2022-05-19 02:41:45] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:42:06] [INFO ] Implicit Places using invariants and state equation in 21966 ms returned []
Implicit Place search using SMT with State Equation took 23092 ms to find 0 implicit places.
[2022-05-19 02:42:06] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:42:06] [INFO ] Computed 48 place invariants in 60 ms
[2022-05-19 02:42:09] [INFO ] Dead Transitions using invariants and state equation in 3319 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 865/865 places, 2335/2335 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 6942 steps, including 43 resets, run visited all 2 properties in 49 ms. (steps per millisecond=141 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 605 reset in 488 ms.
Product exploration explored 100000 steps with 606 reset in 496 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 865 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 865 transition count 2335
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 63 Pre rules applied. Total rules applied 46 place count 865 transition count 2431
Deduced a syphon composed of 109 places in 1 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 109 place count 865 transition count 2431
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 125 place count 849 transition count 2415
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 141 place count 849 transition count 2415
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 246 places in 2 ms
Iterating global reduction 1 with 153 rules applied. Total rules applied 294 place count 849 transition count 2415
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 319 place count 824 transition count 2390
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 344 place count 824 transition count 2390
Deduced a syphon composed of 223 places in 2 ms
Applied a total of 344 rules in 200 ms. Remains 824 /865 variables (removed 41) and now considering 2390/2335 (removed -55) transitions.
[2022-05-19 02:42:12] [INFO ] Flow matrix only has 2342 transitions (discarded 48 similar events)
// Phase 1: matrix 2342 rows 824 cols
[2022-05-19 02:42:12] [INFO ] Computed 48 place invariants in 36 ms
[2022-05-19 02:42:15] [INFO ] Dead Transitions using invariants and state equation in 2734 ms found 0 transitions.
[2022-05-19 02:42:15] [INFO ] Redundant transitions in 114 ms returned []
[2022-05-19 02:42:15] [INFO ] Flow matrix only has 2342 transitions (discarded 48 similar events)
// Phase 1: matrix 2342 rows 824 cols
[2022-05-19 02:42:15] [INFO ] Computed 48 place invariants in 37 ms
[2022-05-19 02:42:18] [INFO ] Dead Transitions using invariants and state equation in 2839 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 824/865 places, 2390/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 824/865 places, 2390/2335 transitions.
Product exploration explored 100000 steps with 1070 reset in 920 ms.
Product exploration explored 100000 steps with 997 reset in 892 ms.
Built C files in :
/tmp/ltsmin8849556313281693850
[2022-05-19 02:42:20] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8849556313281693850
Running compilation step : cd /tmp/ltsmin8849556313281693850;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8849556313281693850;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8849556313281693850;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 865 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Applied a total of 0 rules in 22 ms. Remains 865 /865 variables (removed 0) and now considering 2335/2335 (removed 0) transitions.
[2022-05-19 02:42:23] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:42:23] [INFO ] Computed 48 place invariants in 61 ms
[2022-05-19 02:42:26] [INFO ] Dead Transitions using invariants and state equation in 3171 ms found 0 transitions.
[2022-05-19 02:42:26] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:42:26] [INFO ] Computed 48 place invariants in 51 ms
[2022-05-19 02:42:27] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2022-05-19 02:42:27] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:42:27] [INFO ] Computed 48 place invariants in 50 ms
[2022-05-19 02:42:28] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:42:50] [INFO ] Implicit Places using invariants and state equation in 23393 ms returned []
Implicit Place search using SMT with State Equation took 24495 ms to find 0 implicit places.
[2022-05-19 02:42:50] [INFO ] Flow matrix only has 2287 transitions (discarded 48 similar events)
// Phase 1: matrix 2287 rows 865 cols
[2022-05-19 02:42:50] [INFO ] Computed 48 place invariants in 50 ms
[2022-05-19 02:42:54] [INFO ] Dead Transitions using invariants and state equation in 3318 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 865/865 places, 2335/2335 transitions.
Built C files in :
/tmp/ltsmin15484796459871489148
[2022-05-19 02:42:54] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15484796459871489148
Running compilation step : cd /tmp/ltsmin15484796459871489148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15484796459871489148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15484796459871489148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 02:42:57] [INFO ] Flatten gal took : 110 ms
[2022-05-19 02:42:57] [INFO ] Flatten gal took : 109 ms
[2022-05-19 02:42:57] [INFO ] Time to serialize gal into /tmp/LTL362623672375389832.gal : 11 ms
[2022-05-19 02:42:57] [INFO ] Time to serialize properties into /tmp/LTL103416795564376467.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL362623672375389832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL103416795564376467.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3626236...264
Read 1 LTL properties
Checking formula 0 : !((X(G((G(F("((P_1095<1)||(P_1113_2<1))")))||("(NotifyEventJobCompletedE_5<1)")))))
Formula 0 simplified : !XG("(NotifyEventJobCompletedE_5<1)" | GF"((P_1095<1)||(P_1113_2<1))")
Detected timeout of ITS tools.
[2022-05-19 02:43:12] [INFO ] Flatten gal took : 84 ms
[2022-05-19 02:43:12] [INFO ] Applying decomposition
[2022-05-19 02:43:12] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8226354937802013180.txt' '-o' '/tmp/graph8226354937802013180.bin' '-w' '/tmp/graph8226354937802013180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8226354937802013180.bin' '-l' '-1' '-v' '-w' '/tmp/graph8226354937802013180.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:43:12] [INFO ] Decomposing Gal with order
[2022-05-19 02:43:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:43:13] [INFO ] Removed a total of 1864 redundant transitions.
[2022-05-19 02:43:13] [INFO ] Flatten gal took : 273 ms
[2022-05-19 02:43:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 361 labels/synchronizations in 69 ms.
[2022-05-19 02:43:13] [INFO ] Time to serialize gal into /tmp/LTL4455510302563724480.gal : 17 ms
[2022-05-19 02:43:13] [INFO ] Time to serialize properties into /tmp/LTL5226530984070602263.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4455510302563724480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5226530984070602263.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4455510...245
Read 1 LTL properties
Checking formula 0 : !((X(G((G(F("((u95.P_1095<1)||(i7.i1.i0.u59.P_1113_2<1))")))||("(i0.u31.NotifyEventJobCompletedE_5<1)")))))
Formula 0 simplified : !XG("(i0.u31.NotifyEventJobCompletedE_5<1)" | GF"((u95.P_1095<1)||(i7.i1.i0.u59.P_1113_2<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16434406137960455961
[2022-05-19 02:43:28] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16434406137960455961
Running compilation step : cd /tmp/ltsmin16434406137960455961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16434406137960455961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16434406137960455961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-11 finished in 147239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0) U p0)&&p1) U (G(p0) U X(p2))))'
Support contains 5 out of 865 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 864 transition count 2334
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 864 transition count 2334
Applied a total of 2 rules in 35 ms. Remains 864 /865 variables (removed 1) and now considering 2334/2335 (removed 1) transitions.
[2022-05-19 02:43:31] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:43:31] [INFO ] Computed 48 place invariants in 51 ms
[2022-05-19 02:43:34] [INFO ] Dead Transitions using invariants and state equation in 3314 ms found 0 transitions.
[2022-05-19 02:43:34] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:43:34] [INFO ] Computed 48 place invariants in 59 ms
[2022-05-19 02:43:35] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2022-05-19 02:43:35] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:43:36] [INFO ] Computed 48 place invariants in 62 ms
[2022-05-19 02:43:36] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:43:41] [INFO ] Implicit Places using invariants and state equation in 5346 ms returned []
Implicit Place search using SMT with State Equation took 6523 ms to find 0 implicit places.
[2022-05-19 02:43:41] [INFO ] Flow matrix only has 2286 transitions (discarded 48 similar events)
// Phase 1: matrix 2286 rows 864 cols
[2022-05-19 02:43:41] [INFO ] Computed 48 place invariants in 57 ms
[2022-05-19 02:43:44] [INFO ] Dead Transitions using invariants and state equation in 3250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 864/865 places, 2334/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 864/865 places, 2334/2335 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s91 1)), p1:(LT s579 1), p2:(AND (GEQ s36 1) (GEQ s607 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-12 finished in 13477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X((!X(p0)||p1))) U p0)))'
Support contains 2 out of 865 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 865 transition count 2282
Reduce places removed 53 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 812 transition count 2280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 810 transition count 2280
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 110 place count 810 transition count 2168
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 334 place count 698 transition count 2168
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 528 place count 601 transition count 2071
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 531 place count 598 transition count 2068
Iterating global reduction 3 with 3 rules applied. Total rules applied 534 place count 598 transition count 2068
Applied a total of 534 rules in 122 ms. Remains 598 /865 variables (removed 267) and now considering 2068/2335 (removed 267) transitions.
[2022-05-19 02:43:45] [INFO ] Flow matrix only has 2020 transitions (discarded 48 similar events)
// Phase 1: matrix 2020 rows 598 cols
[2022-05-19 02:43:45] [INFO ] Computed 48 place invariants in 38 ms
[2022-05-19 02:43:46] [INFO ] Dead Transitions using invariants and state equation in 1799 ms found 0 transitions.
[2022-05-19 02:43:46] [INFO ] Flow matrix only has 2020 transitions (discarded 48 similar events)
// Phase 1: matrix 2020 rows 598 cols
[2022-05-19 02:43:46] [INFO ] Computed 48 place invariants in 42 ms
[2022-05-19 02:43:47] [INFO ] Implicit Places using invariants in 911 ms returned []
[2022-05-19 02:43:47] [INFO ] Flow matrix only has 2020 transitions (discarded 48 similar events)
// Phase 1: matrix 2020 rows 598 cols
[2022-05-19 02:43:47] [INFO ] Computed 48 place invariants in 36 ms
[2022-05-19 02:43:48] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:44:18] [INFO ] Performed 441/598 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 02:44:28] [INFO ] Implicit Places using invariants and state equation in 41251 ms returned []
Implicit Place search using SMT with State Equation took 42164 ms to find 0 implicit places.
[2022-05-19 02:44:29] [INFO ] Redundant transitions in 79 ms returned []
[2022-05-19 02:44:29] [INFO ] Flow matrix only has 2020 transitions (discarded 48 similar events)
// Phase 1: matrix 2020 rows 598 cols
[2022-05-19 02:44:29] [INFO ] Computed 48 place invariants in 41 ms
[2022-05-19 02:44:30] [INFO ] Dead Transitions using invariants and state equation in 1771 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 598/865 places, 2068/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 598/865 places, 2068/2335 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s76 1) (GEQ s591 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-14 finished in 46013 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 865 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 865 transition count 2279
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 809 transition count 2279
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 112 place count 809 transition count 2167
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 336 place count 697 transition count 2167
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 530 place count 600 transition count 2070
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 533 place count 597 transition count 2067
Iterating global reduction 2 with 3 rules applied. Total rules applied 536 place count 597 transition count 2067
Applied a total of 536 rules in 104 ms. Remains 597 /865 variables (removed 268) and now considering 2067/2335 (removed 268) transitions.
[2022-05-19 02:44:31] [INFO ] Flow matrix only has 2019 transitions (discarded 48 similar events)
// Phase 1: matrix 2019 rows 597 cols
[2022-05-19 02:44:31] [INFO ] Computed 48 place invariants in 34 ms
[2022-05-19 02:44:32] [INFO ] Dead Transitions using invariants and state equation in 1647 ms found 0 transitions.
[2022-05-19 02:44:32] [INFO ] Flow matrix only has 2019 transitions (discarded 48 similar events)
// Phase 1: matrix 2019 rows 597 cols
[2022-05-19 02:44:32] [INFO ] Computed 48 place invariants in 40 ms
[2022-05-19 02:44:33] [INFO ] Implicit Places using invariants in 885 ms returned []
[2022-05-19 02:44:33] [INFO ] Flow matrix only has 2019 transitions (discarded 48 similar events)
// Phase 1: matrix 2019 rows 597 cols
[2022-05-19 02:44:33] [INFO ] Computed 48 place invariants in 31 ms
[2022-05-19 02:44:34] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:44:50] [INFO ] Implicit Places using invariants and state equation in 17220 ms returned []
Implicit Place search using SMT with State Equation took 18108 ms to find 0 implicit places.
[2022-05-19 02:44:50] [INFO ] Redundant transitions in 79 ms returned []
[2022-05-19 02:44:50] [INFO ] Flow matrix only has 2019 transitions (discarded 48 similar events)
// Phase 1: matrix 2019 rows 597 cols
[2022-05-19 02:44:50] [INFO ] Computed 48 place invariants in 37 ms
[2022-05-19 02:44:52] [INFO ] Dead Transitions using invariants and state equation in 1653 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 597/865 places, 2067/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 597/865 places, 2067/2335 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s129 1) (GEQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-15 finished in 21656 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(G(p0)))||X(F(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0))||p1))))'
Found a SL insensitive property : PolyORBLF-PT-S06J06T08-LTLFireability-11
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 865 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 865/865 places, 2335/2335 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 865 transition count 2283
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 813 transition count 2282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 812 transition count 2282
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 106 place count 812 transition count 2170
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 330 place count 700 transition count 2170
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 524 place count 603 transition count 2073
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 526 place count 601 transition count 2071
Iterating global reduction 3 with 2 rules applied. Total rules applied 528 place count 601 transition count 2071
Applied a total of 528 rules in 114 ms. Remains 601 /865 variables (removed 264) and now considering 2071/2335 (removed 264) transitions.
[2022-05-19 02:44:53] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:44:53] [INFO ] Computed 48 place invariants in 33 ms
[2022-05-19 02:44:55] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
[2022-05-19 02:44:55] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:44:55] [INFO ] Computed 48 place invariants in 40 ms
[2022-05-19 02:44:56] [INFO ] Implicit Places using invariants in 921 ms returned []
[2022-05-19 02:44:56] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:44:56] [INFO ] Computed 48 place invariants in 41 ms
[2022-05-19 02:44:57] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:45:27] [INFO ] Performed 358/601 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 02:45:46] [INFO ] Implicit Places using invariants and state equation in 50382 ms returned []
Implicit Place search using SMT with State Equation took 51306 ms to find 0 implicit places.
[2022-05-19 02:45:46] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:45:46] [INFO ] Computed 48 place invariants in 41 ms
[2022-05-19 02:45:48] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 601/865 places, 2071/2335 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/865 places, 2071/2335 transitions.
Running random walk in product with property : PolyORBLF-PT-S06J06T08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s151 1), p0:(OR (LT s30 1) (LT s337 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1077 reset in 647 ms.
Product exploration explored 100000 steps with 1045 reset in 689 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 02:45:50] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:45:50] [INFO ] Computed 48 place invariants in 40 ms
[2022-05-19 02:45:50] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2022-05-19 02:45:50] [INFO ] [Real]Absence check using 21 positive and 27 generalized place invariants in 27 ms returned sat
[2022-05-19 02:45:50] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 365 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2071/2071 transitions.
Applied a total of 0 rules in 15 ms. Remains 601 /601 variables (removed 0) and now considering 2071/2071 (removed 0) transitions.
[2022-05-19 02:45:50] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:45:50] [INFO ] Computed 48 place invariants in 39 ms
[2022-05-19 02:45:52] [INFO ] Dead Transitions using invariants and state equation in 1711 ms found 0 transitions.
[2022-05-19 02:45:52] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:45:52] [INFO ] Computed 48 place invariants in 36 ms
[2022-05-19 02:45:53] [INFO ] Implicit Places using invariants in 851 ms returned []
[2022-05-19 02:45:53] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:45:53] [INFO ] Computed 48 place invariants in 33 ms
[2022-05-19 02:45:54] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:46:18] [INFO ] Implicit Places using invariants and state equation in 24718 ms returned []
Implicit Place search using SMT with State Equation took 25572 ms to find 0 implicit places.
[2022-05-19 02:46:18] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:46:18] [INFO ] Computed 48 place invariants in 43 ms
[2022-05-19 02:46:19] [INFO ] Dead Transitions using invariants and state equation in 1765 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/601 places, 2071/2071 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 6718 steps, including 67 resets, run visited all 2 properties in 47 ms. (steps per millisecond=142 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1069 reset in 701 ms.
Product exploration explored 100000 steps with 1091 reset in 728 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 2071/2071 transitions.
Applied a total of 0 rules in 37 ms. Remains 601 /601 variables (removed 0) and now considering 2071/2071 (removed 0) transitions.
[2022-05-19 02:46:22] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:46:22] [INFO ] Computed 48 place invariants in 32 ms
[2022-05-19 02:46:24] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
[2022-05-19 02:46:24] [INFO ] Redundant transitions in 66 ms returned []
[2022-05-19 02:46:24] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:46:24] [INFO ] Computed 48 place invariants in 38 ms
[2022-05-19 02:46:26] [INFO ] Dead Transitions using invariants and state equation in 1759 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/601 places, 2071/2071 transitions.
Product exploration explored 100000 steps with 1088 reset in 805 ms.
Product exploration explored 100000 steps with 1026 reset in 807 ms.
Built C files in :
/tmp/ltsmin1390949503430793544
[2022-05-19 02:46:27] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1390949503430793544
Running compilation step : cd /tmp/ltsmin1390949503430793544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1390949503430793544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1390949503430793544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 2071/2071 transitions.
Applied a total of 0 rules in 10 ms. Remains 601 /601 variables (removed 0) and now considering 2071/2071 (removed 0) transitions.
[2022-05-19 02:46:30] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:46:30] [INFO ] Computed 48 place invariants in 38 ms
[2022-05-19 02:46:32] [INFO ] Dead Transitions using invariants and state equation in 1701 ms found 0 transitions.
[2022-05-19 02:46:32] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:46:32] [INFO ] Computed 48 place invariants in 40 ms
[2022-05-19 02:46:33] [INFO ] Implicit Places using invariants in 868 ms returned []
[2022-05-19 02:46:33] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:46:33] [INFO ] Computed 48 place invariants in 35 ms
[2022-05-19 02:46:34] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-05-19 02:47:04] [INFO ] Performed 473/601 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-19 02:47:12] [INFO ] Implicit Places using invariants and state equation in 39458 ms returned []
Implicit Place search using SMT with State Equation took 40329 ms to find 0 implicit places.
[2022-05-19 02:47:12] [INFO ] Flow matrix only has 2023 transitions (discarded 48 similar events)
// Phase 1: matrix 2023 rows 601 cols
[2022-05-19 02:47:12] [INFO ] Computed 48 place invariants in 46 ms
[2022-05-19 02:47:14] [INFO ] Dead Transitions using invariants and state equation in 1709 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 601/601 places, 2071/2071 transitions.
Built C files in :
/tmp/ltsmin18370966604235292705
[2022-05-19 02:47:14] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18370966604235292705
Running compilation step : cd /tmp/ltsmin18370966604235292705;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18370966604235292705;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18370966604235292705;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 02:47:17] [INFO ] Flatten gal took : 119 ms
[2022-05-19 02:47:17] [INFO ] Flatten gal took : 85 ms
[2022-05-19 02:47:17] [INFO ] Time to serialize gal into /tmp/LTL11295687163254916540.gal : 10 ms
[2022-05-19 02:47:17] [INFO ] Time to serialize properties into /tmp/LTL8390437122556364048.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11295687163254916540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8390437122556364048.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1129568...267
Read 1 LTL properties
Checking formula 0 : !((X(G((G(F("((P_1095<1)||(P_1113_2<1))")))||("(NotifyEventJobCompletedE_5<1)")))))
Formula 0 simplified : !XG("(NotifyEventJobCompletedE_5<1)" | GF"((P_1095<1)||(P_1113_2<1))")
Detected timeout of ITS tools.
[2022-05-19 02:47:33] [INFO ] Flatten gal took : 84 ms
[2022-05-19 02:47:33] [INFO ] Applying decomposition
[2022-05-19 02:47:33] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph357625830314477867.txt' '-o' '/tmp/graph357625830314477867.bin' '-w' '/tmp/graph357625830314477867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph357625830314477867.bin' '-l' '-1' '-v' '-w' '/tmp/graph357625830314477867.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:47:33] [INFO ] Decomposing Gal with order
[2022-05-19 02:47:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:47:33] [INFO ] Removed a total of 1592 redundant transitions.
[2022-05-19 02:47:33] [INFO ] Flatten gal took : 251 ms
[2022-05-19 02:47:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 311 labels/synchronizations in 20 ms.
[2022-05-19 02:47:33] [INFO ] Time to serialize gal into /tmp/LTL2141465912349279108.gal : 28 ms
[2022-05-19 02:47:33] [INFO ] Time to serialize properties into /tmp/LTL5287492948057789829.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2141465912349279108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5287492948057789829.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2141465...245
Read 1 LTL properties
Checking formula 0 : !((X(G((G(F("((i0.u0.P_1095<1)||(i0.u31.P_1113_2<1))")))||("(i7.u11.NotifyEventJobCompletedE_5<1)")))))
Formula 0 simplified : !XG("(i7.u11.NotifyEventJobCompletedE_5<1)" | GF"((i0.u0.P_1095<1)||(i0.u31.P_1113_2<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5453619217488645568
[2022-05-19 02:47:48] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5453619217488645568
Running compilation step : cd /tmp/ltsmin5453619217488645568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5453619217488645568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5453619217488645568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property PolyORBLF-PT-S06J06T08-LTLFireability-11 finished in 178790 ms.
[2022-05-19 02:47:51] [INFO ] Flatten gal took : 82 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5514730755304465487
[2022-05-19 02:47:51] [INFO ] Too many transitions (2335) to apply POR reductions. Disabling POR matrices.
[2022-05-19 02:47:51] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5514730755304465487
Running compilation step : cd /tmp/ltsmin5514730755304465487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 02:47:51] [INFO ] Applying decomposition
[2022-05-19 02:47:52] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph711594830655612486.txt' '-o' '/tmp/graph711594830655612486.bin' '-w' '/tmp/graph711594830655612486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph711594830655612486.bin' '-l' '-1' '-v' '-w' '/tmp/graph711594830655612486.weights' '-q' '0' '-e' '0.001'
[2022-05-19 02:47:52] [INFO ] Decomposing Gal with order
[2022-05-19 02:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 02:47:52] [INFO ] Removed a total of 1686 redundant transitions.
[2022-05-19 02:47:52] [INFO ] Flatten gal took : 262 ms
[2022-05-19 02:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 386 labels/synchronizations in 34 ms.
[2022-05-19 02:47:52] [INFO ] Time to serialize gal into /tmp/LTLFireability917707364321313800.gal : 15 ms
[2022-05-19 02:47:52] [INFO ] Time to serialize properties into /tmp/LTLFireability14905399328122133005.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability917707364321313800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14905399328122133005.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((G((X(F(G("(i5.i8.u37.Insert_Source_E_2<1)"))))||(X(F("(i5.i8.u27.EnablePollingE_7>=1)"))))))
Formula 0 simplified : !G(XFG"(i5.i8.u37.Insert_Source_E_2<1)" | XF"(i5.i8.u27.EnablePollingE_7>=1)")
Compilation finished in 5682 ms.
Running link step : cd /tmp/ltsmin5514730755304465487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5514730755304465487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>([]((LTLAPp0==true))))||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 5778 ms.
FORMULA PolyORBLF-PT-S06J06T08-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5514730755304465487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([](<>((LTLAPp2==true)))||(LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 03:11:22] [INFO ] Flatten gal took : 1920 ms
[2022-05-19 03:11:22] [INFO ] Time to serialize gal into /tmp/LTLFireability13895388959309497015.gal : 58 ms
[2022-05-19 03:11:22] [INFO ] Time to serialize properties into /tmp/LTLFireability17180620494793293484.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13895388959309497015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17180620494793293484.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !((X(G((G(F("((P_1095<1)||(P_1113_2<1))")))||("(NotifyEventJobCompletedE_5<1)")))))
Formula 0 simplified : !XG("(NotifyEventJobCompletedE_5<1)" | GF"((P_1095<1)||(P_1113_2<1))")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5514730755304465487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([](<>((LTLAPp2==true)))||(LTLAPp3==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5514730755304465487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([](<>((LTLAPp2==true)))||(LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 03:34:52] [INFO ] Flatten gal took : 1377 ms
[2022-05-19 03:34:54] [INFO ] Input system was already deterministic with 2335 transitions.
[2022-05-19 03:34:54] [INFO ] Transformed 865 places.
[2022-05-19 03:34:54] [INFO ] Transformed 2335 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 03:35:24] [INFO ] Time to serialize gal into /tmp/LTLFireability970738109251595484.gal : 12 ms
[2022-05-19 03:35:24] [INFO ] Time to serialize properties into /tmp/LTLFireability14450207424048364137.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability970738109251595484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14450207424048364137.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G((G(F("((P_1095<1)||(P_1113_2<1))")))||("(NotifyEventJobCompletedE_5<1)")))))
Formula 0 simplified : !XG("(NotifyEventJobCompletedE_5<1)" | GF"((P_1095<1)||(P_1113_2<1))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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