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-165277016900596.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-S02J04T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016900596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 27K Apr 29 13:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 29 13:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 29 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 29 13:51 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:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K May 9 08:27 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 717K 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-S02J04T08-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652891125871

Running Version 202205111006
[2022-05-18 16:25:27] [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-18 16:25:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 16:25:27] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2022-05-18 16:25:27] [INFO ] Transformed 614 places.
[2022-05-18 16:25:27] [INFO ] Transformed 1242 transitions.
[2022-05-18 16:25:27] [INFO ] Parsed PT model containing 614 places and 1242 transitions in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 221 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 604 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 604 transition count 1106
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 597 transition count 1099
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 597 transition count 1099
Applied a total of 32 rules in 96 ms. Remains 597 /614 variables (removed 17) and now considering 1099/1114 (removed 15) transitions.
[2022-05-18 16:25:27] [INFO ] Flow matrix only has 1083 transitions (discarded 16 similar events)
// Phase 1: matrix 1083 rows 597 cols
[2022-05-18 16:25:27] [INFO ] Computed 48 place invariants in 66 ms
[2022-05-18 16:25:28] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
[2022-05-18 16:25:28] [INFO ] Flow matrix only has 995 transitions (discarded 16 similar events)
// Phase 1: matrix 995 rows 597 cols
[2022-05-18 16:25:28] [INFO ] Computed 48 place invariants in 35 ms
[2022-05-18 16:25:29] [INFO ] Implicit Places using invariants in 342 ms returned [108, 181, 287, 299, 419, 488, 516, 528]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 354 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 589/614 places, 1011/1114 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 587 transition count 995
Reduce places removed 8 places and 16 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 10 place count 579 transition count 979
Deduced a syphon composed of 8 places in 1 ms
Applied a total of 10 rules in 18 ms. Remains 579 /589 variables (removed 10) and now considering 979/1011 (removed 32) transitions.
[2022-05-18 16:25:29] [INFO ] Flow matrix only has 963 transitions (discarded 16 similar events)
// Phase 1: matrix 963 rows 579 cols
[2022-05-18 16:25:29] [INFO ] Computed 48 place invariants in 17 ms
[2022-05-18 16:25:29] [INFO ] Implicit Places using invariants in 268 ms returned []
[2022-05-18 16:25:29] [INFO ] Flow matrix only has 963 transitions (discarded 16 similar events)
// Phase 1: matrix 963 rows 579 cols
[2022-05-18 16:25:29] [INFO ] Computed 48 place invariants in 13 ms
[2022-05-18 16:25:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:25:34] [INFO ] Implicit Places using invariants and state equation in 5195 ms returned []
Implicit Place search using SMT with State Equation took 5470 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 579/614 places, 979/1114 transitions.
Finished structural reductions, in 2 iterations. Remains : 579/614 places, 979/1114 transitions.
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Support contains 213 out of 571 places after structural reductions.
[2022-05-18 16:25:34] [INFO ] Flatten gal took : 107 ms
[2022-05-18 16:25:35] [INFO ] Flatten gal took : 77 ms
[2022-05-18 16:25:35] [INFO ] Input system was already deterministic with 979 transitions.
Support contains 189 out of 571 places (down from 213) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 27) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-18 16:25:35] [INFO ] Flow matrix only has 963 transitions (discarded 16 similar events)
// Phase 1: matrix 963 rows 571 cols
[2022-05-18 16:25:35] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 16:25:35] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2022-05-18 16:25:35] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 38 ms returned sat
[2022-05-18 16:25:36] [INFO ] After 1120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 16:25:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2022-05-18 16:25:36] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 19 ms returned sat
[2022-05-18 16:25:38] [INFO ] After 1525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 16:25:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:25:39] [INFO ] After 641ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 16:25:39] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-18 16:25:39] [INFO ] After 2480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 571 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 571/571 places, 979/979 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 571 transition count 931
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 523 transition count 931
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 96 place count 523 transition count 867
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 224 place count 459 transition count 867
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 354 place count 394 transition count 802
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 360 place count 388 transition count 796
Iterating global reduction 2 with 6 rules applied. Total rules applied 366 place count 388 transition count 796
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 389 place count 388 transition count 773
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 412 place count 365 transition count 773
Applied a total of 412 rules in 149 ms. Remains 365 /571 variables (removed 206) and now considering 773/979 (removed 206) transitions.
[2022-05-18 16:25:39] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
// Phase 1: matrix 757 rows 365 cols
[2022-05-18 16:25:39] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 16:25:39] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 365/571 places, 773/979 transitions.
Finished random walk after 3380 steps, including 1 resets, run visited all 1 properties in 17 ms. (steps per millisecond=198 )
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(p0))'
Support contains 14 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 979/979 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 571 transition count 923
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 515 transition count 923
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 515 transition count 859
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 451 transition count 859
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 370 place count 386 transition count 794
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 376 place count 380 transition count 788
Iterating global reduction 2 with 6 rules applied. Total rules applied 382 place count 380 transition count 788
Applied a total of 382 rules in 78 ms. Remains 380 /571 variables (removed 191) and now considering 788/979 (removed 191) transitions.
[2022-05-18 16:25:40] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:40] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:25:40] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
[2022-05-18 16:25:40] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:40] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 16:25:41] [INFO ] Implicit Places using invariants in 356 ms returned []
[2022-05-18 16:25:41] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:41] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 16:25:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:25:43] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned []
Implicit Place search using SMT with State Equation took 3071 ms to find 0 implicit places.
[2022-05-18 16:25:43] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-18 16:25:43] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:43] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 16:25:44] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/571 places, 788/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 380/571 places, 788/979 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s131 1) (GEQ s190 1) (GEQ s356 1)) (AND (GEQ s35 1) (GEQ s131 1) (GEQ s246 1)) (AND (GEQ s131 1) (GEQ s190 1) (GEQ s317 1)) (AND (GEQ s51...], 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]]
Product exploration explored 100000 steps with 2962 reset in 662 ms.
Product exploration explored 100000 steps with 2960 reset in 593 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2022-05-18 16:25:46] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:46] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 16:25:46] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-18 16:25:46] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 179 ms returned sat
[2022-05-18 16:25:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:25:47] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2022-05-18 16:25:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:25:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-18 16:25:48] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 53 ms returned sat
[2022-05-18 16:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:25:49] [INFO ] [Nat]Absence check using state equation in 1467 ms returned sat
[2022-05-18 16:25:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:25:50] [INFO ] [Nat]Added 96 Read/Feed constraints in 200 ms returned sat
[2022-05-18 16:25:50] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2022-05-18 16:25:50] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2022-05-18 16:25:50] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2022-05-18 16:25:50] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2022-05-18 16:25:50] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2022-05-18 16:25:50] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2022-05-18 16:25:50] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2022-05-18 16:25:51] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2022-05-18 16:25:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1002 ms
[2022-05-18 16:25:51] [INFO ] Computed and/alt/rep : 348/1233/340 causal constraints (skipped 430 transitions) in 60 ms.
[2022-05-18 16:25:52] [INFO ] Added : 130 causal constraints over 26 iterations in 1458 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 14 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 788/788 transitions.
Applied a total of 0 rules in 26 ms. Remains 380 /380 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2022-05-18 16:25:52] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:52] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 16:25:53] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
[2022-05-18 16:25:53] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:53] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 16:25:53] [INFO ] Implicit Places using invariants in 318 ms returned []
[2022-05-18 16:25:53] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:53] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 16:25:53] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:25:56] [INFO ] Implicit Places using invariants and state equation in 3247 ms returned []
Implicit Place search using SMT with State Equation took 3571 ms to find 0 implicit places.
[2022-05-18 16:25:56] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-18 16:25:56] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:56] [INFO ] Computed 40 place invariants in 7 ms
[2022-05-18 16:25:57] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 380/380 places, 788/788 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2022-05-18 16:25:57] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:25:57] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:25:58] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-18 16:25:58] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 172 ms returned sat
[2022-05-18 16:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:25:59] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2022-05-18 16:25:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:25:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-18 16:25:59] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 45 ms returned sat
[2022-05-18 16:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:26:00] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2022-05-18 16:26:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:26:00] [INFO ] [Nat]Added 96 Read/Feed constraints in 190 ms returned sat
[2022-05-18 16:26:01] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2022-05-18 16:26:01] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2022-05-18 16:26:01] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2022-05-18 16:26:01] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2022-05-18 16:26:01] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2022-05-18 16:26:01] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2022-05-18 16:26:01] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2022-05-18 16:26:01] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2022-05-18 16:26:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 992 ms
[2022-05-18 16:26:02] [INFO ] Computed and/alt/rep : 348/1233/340 causal constraints (skipped 430 transitions) in 56 ms.
[2022-05-18 16:26:03] [INFO ] Added : 130 causal constraints over 26 iterations in 1453 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2957 reset in 617 ms.
Product exploration explored 100000 steps with 2967 reset in 557 ms.
Built C files in :
/tmp/ltsmin10404269534573919121
[2022-05-18 16:26:04] [INFO ] Computing symmetric may disable matrix : 788 transitions.
[2022-05-18 16:26:04] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:26:04] [INFO ] Computing symmetric may enable matrix : 788 transitions.
[2022-05-18 16:26:04] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:26:04] [INFO ] Computing Do-Not-Accords matrix : 788 transitions.
[2022-05-18 16:26:04] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:26:04] [INFO ] Built C files in 201ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10404269534573919121
Running compilation step : cd /tmp/ltsmin10404269534573919121;'/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'
Compilation finished in 2099 ms.
Running link step : cd /tmp/ltsmin10404269534573919121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10404269534573919121;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2839361608837574864.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 14 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 788/788 transitions.
Applied a total of 0 rules in 28 ms. Remains 380 /380 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2022-05-18 16:26:19] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:26:19] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 16:26:20] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
[2022-05-18 16:26:20] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:26:20] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 16:26:20] [INFO ] Implicit Places using invariants in 334 ms returned []
[2022-05-18 16:26:20] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:26:20] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:26:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:26:23] [INFO ] Implicit Places using invariants and state equation in 3188 ms returned []
Implicit Place search using SMT with State Equation took 3523 ms to find 0 implicit places.
[2022-05-18 16:26:23] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-18 16:26:23] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2022-05-18 16:26:23] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 16:26:24] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 380/380 places, 788/788 transitions.
Built C files in :
/tmp/ltsmin13809830110215589724
[2022-05-18 16:26:24] [INFO ] Computing symmetric may disable matrix : 788 transitions.
[2022-05-18 16:26:24] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:26:24] [INFO ] Computing symmetric may enable matrix : 788 transitions.
[2022-05-18 16:26:24] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:26:24] [INFO ] Computing Do-Not-Accords matrix : 788 transitions.
[2022-05-18 16:26:24] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:26:24] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13809830110215589724
Running compilation step : cd /tmp/ltsmin13809830110215589724;'/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'
Compilation finished in 2060 ms.
Running link step : cd /tmp/ltsmin13809830110215589724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13809830110215589724;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15039330606671454408.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 16:26:39] [INFO ] Flatten gal took : 48 ms
[2022-05-18 16:26:39] [INFO ] Flatten gal took : 44 ms
[2022-05-18 16:26:39] [INFO ] Time to serialize gal into /tmp/LTL18289562944609111551.gal : 8 ms
[2022-05-18 16:26:39] [INFO ] Time to serialize properties into /tmp/LTL7554714202110109288.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/LTL18289562944609111551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7554714202110109288.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/LTL1828956...267
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((P_1717>=1)&&(FetchJobB_3>=1))&&(P_1724_3>=1))||(((FetchJobB_4>=1)&&(P_1717>=1))&&(P_1724_4>=1)))||((((P_1717>=1)&&(Fetc...2107
Formula 0 simplified : !F"(((((((((P_1717>=1)&&(FetchJobB_3>=1))&&(P_1724_3>=1))||(((FetchJobB_4>=1)&&(P_1717>=1))&&(P_1724_4>=1)))||((((P_1717>=1)&&(Fetch...2103
Detected timeout of ITS tools.
[2022-05-18 16:26:54] [INFO ] Flatten gal took : 43 ms
[2022-05-18 16:26:54] [INFO ] Applying decomposition
[2022-05-18 16:26:54] [INFO ] Flatten gal took : 38 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/graph2598989311989284411.txt' '-o' '/tmp/graph2598989311989284411.bin' '-w' '/tmp/graph2598989311989284411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2598989311989284411.bin' '-l' '-1' '-v' '-w' '/tmp/graph2598989311989284411.weights' '-q' '0' '-e' '0.001'
[2022-05-18 16:26:55] [INFO ] Decomposing Gal with order
[2022-05-18 16:26:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 16:26:55] [INFO ] Removed a total of 671 redundant transitions.
[2022-05-18 16:26:55] [INFO ] Flatten gal took : 197 ms
[2022-05-18 16:26:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 281 labels/synchronizations in 24 ms.
[2022-05-18 16:26:55] [INFO ] Time to serialize gal into /tmp/LTL17684562317540038920.gal : 11 ms
[2022-05-18 16:26:55] [INFO ] Time to serialize properties into /tmp/LTL16102069091878462069.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/LTL17684562317540038920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16102069091878462069.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/LTL1768456...247
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((i0.u1.P_1717>=1)&&(i0.u1.FetchJobB_3>=1))&&(i0.u1.P_1724_3>=1))||(((i0.u1.FetchJobB_4>=1)&&(i0.u1.P_1717>=1))&&(i0.u1.P...2837
Formula 0 simplified : !F"(((((((((i0.u1.P_1717>=1)&&(i0.u1.FetchJobB_3>=1))&&(i0.u1.P_1724_3>=1))||(((i0.u1.FetchJobB_4>=1)&&(i0.u1.P_1717>=1))&&(i0.u1.P_...2833
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2015994381437851573
[2022-05-18 16:27:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2015994381437851573
Running compilation step : cd /tmp/ltsmin2015994381437851573;'/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'
Compilation finished in 1301 ms.
Running link step : cd /tmp/ltsmin2015994381437851573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2015994381437851573;'/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' '<>((LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 12858 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-00 finished in 104341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(((X(G(p1))&&p2)||p0)))))'
Support contains 39 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 979/979 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 571 transition count 939
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 531 transition count 931
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 523 transition count 931
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 96 place count 523 transition count 859
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 240 place count 451 transition count 859
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 322 place count 410 transition count 818
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 328 place count 404 transition count 812
Iterating global reduction 3 with 6 rules applied. Total rules applied 334 place count 404 transition count 812
Applied a total of 334 rules in 74 ms. Remains 404 /571 variables (removed 167) and now considering 812/979 (removed 167) transitions.
[2022-05-18 16:27:24] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:24] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 16:27:25] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
[2022-05-18 16:27:25] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:25] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:27:25] [INFO ] Implicit Places using invariants in 371 ms returned []
[2022-05-18 16:27:25] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:25] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 16:27:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:27:30] [INFO ] Implicit Places using invariants and state equation in 4393 ms returned []
Implicit Place search using SMT with State Equation took 4775 ms to find 0 implicit places.
[2022-05-18 16:27:30] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-18 16:27:30] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:30] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 16:27:30] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/571 places, 812/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 404/571 places, 812/979 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s38 10) (GEQ s369 1) (GEQ s384 1)) (AND (GEQ s38 10) (GEQ s276 1) (GEQ s384 1)) (AND (GEQ s38 10) (GEQ s124 1) (GEQ s384 1)) (AND (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10950 reset in 681 ms.
Product exploration explored 100000 steps with 11280 reset in 654 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 412 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 45 steps, including 0 resets, run visited all 5 properties in 15 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 9 factoid took 499 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
[2022-05-18 16:27:33] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:33] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 16:27:34] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-18 16:27:34] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 79 ms returned sat
[2022-05-18 16:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:27:34] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2022-05-18 16:27:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:27:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-18 16:27:35] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 166 ms returned sat
[2022-05-18 16:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:27:37] [INFO ] [Nat]Absence check using state equation in 1260 ms returned sat
[2022-05-18 16:27:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:27:37] [INFO ] [Nat]Added 96 Read/Feed constraints in 247 ms returned sat
[2022-05-18 16:27:37] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 0 ms to minimize.
[2022-05-18 16:27:37] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 1 ms to minimize.
[2022-05-18 16:27:38] [INFO ] Deduced a trap composed of 195 places in 154 ms of which 1 ms to minimize.
[2022-05-18 16:27:38] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 1 ms to minimize.
[2022-05-18 16:27:38] [INFO ] Deduced a trap composed of 154 places in 159 ms of which 1 ms to minimize.
[2022-05-18 16:27:38] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 0 ms to minimize.
[2022-05-18 16:27:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1389 ms
[2022-05-18 16:27:38] [INFO ] Computed and/alt/rep : 378/1317/370 causal constraints (skipped 424 transitions) in 45 ms.
[2022-05-18 16:27:40] [INFO ] Added : 158 causal constraints over 32 iterations in 2067 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2022-05-18 16:27:40] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:40] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 16:27:41] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-18 16:27:41] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 61 ms returned sat
[2022-05-18 16:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:27:42] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2022-05-18 16:27:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:27:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-18 16:27:42] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 42 ms returned sat
[2022-05-18 16:27:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:27:43] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2022-05-18 16:27:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:27:43] [INFO ] [Nat]Added 96 Read/Feed constraints in 231 ms returned sat
[2022-05-18 16:27:44] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2022-05-18 16:27:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2022-05-18 16:27:44] [INFO ] Computed and/alt/rep : 378/1317/370 causal constraints (skipped 424 transitions) in 55 ms.
[2022-05-18 16:27:45] [INFO ] Added : 130 causal constraints over 27 iterations in 1766 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 39 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 812/812 transitions.
Applied a total of 0 rules in 19 ms. Remains 404 /404 variables (removed 0) and now considering 812/812 (removed 0) transitions.
[2022-05-18 16:27:45] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:45] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 16:27:46] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
[2022-05-18 16:27:46] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:46] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:27:46] [INFO ] Implicit Places using invariants in 328 ms returned []
[2022-05-18 16:27:46] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:46] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 16:27:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:27:50] [INFO ] Implicit Places using invariants and state equation in 3889 ms returned []
Implicit Place search using SMT with State Equation took 4220 ms to find 0 implicit places.
[2022-05-18 16:27:50] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-18 16:27:50] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:50] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 16:27:51] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 404/404 places, 812/812 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 390 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 40 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 9 factoid took 499 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
[2022-05-18 16:27:52] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:52] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 16:27:53] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-18 16:27:53] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 83 ms returned sat
[2022-05-18 16:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:27:54] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2022-05-18 16:27:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:27:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-18 16:27:54] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 162 ms returned sat
[2022-05-18 16:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:27:56] [INFO ] [Nat]Absence check using state equation in 1273 ms returned sat
[2022-05-18 16:27:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:27:56] [INFO ] [Nat]Added 96 Read/Feed constraints in 237 ms returned sat
[2022-05-18 16:27:56] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 0 ms to minimize.
[2022-05-18 16:27:56] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2022-05-18 16:27:57] [INFO ] Deduced a trap composed of 195 places in 157 ms of which 0 ms to minimize.
[2022-05-18 16:27:57] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 2 ms to minimize.
[2022-05-18 16:27:57] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 1 ms to minimize.
[2022-05-18 16:27:57] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2022-05-18 16:27:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1417 ms
[2022-05-18 16:27:57] [INFO ] Computed and/alt/rep : 378/1317/370 causal constraints (skipped 424 transitions) in 60 ms.
[2022-05-18 16:27:59] [INFO ] Added : 158 causal constraints over 32 iterations in 2130 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2022-05-18 16:27:59] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:27:59] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 16:28:00] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-18 16:28:00] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 60 ms returned sat
[2022-05-18 16:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:28:01] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2022-05-18 16:28:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:28:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-18 16:28:01] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 40 ms returned sat
[2022-05-18 16:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:28:02] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2022-05-18 16:28:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:28:03] [INFO ] [Nat]Added 96 Read/Feed constraints in 231 ms returned sat
[2022-05-18 16:28:03] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2022-05-18 16:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2022-05-18 16:28:03] [INFO ] Computed and/alt/rep : 378/1317/370 causal constraints (skipped 424 transitions) in 40 ms.
[2022-05-18 16:28:05] [INFO ] Added : 130 causal constraints over 27 iterations in 1771 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10658 reset in 586 ms.
Product exploration explored 100000 steps with 10988 reset in 573 ms.
Built C files in :
/tmp/ltsmin4323887696511858500
[2022-05-18 16:28:06] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2022-05-18 16:28:06] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:28:06] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2022-05-18 16:28:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:28:06] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2022-05-18 16:28:06] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:28:06] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4323887696511858500
Running compilation step : cd /tmp/ltsmin4323887696511858500;'/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'
Compilation finished in 2209 ms.
Running link step : cd /tmp/ltsmin4323887696511858500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4323887696511858500;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14465960370498443038.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 812/812 transitions.
Applied a total of 0 rules in 13 ms. Remains 404 /404 variables (removed 0) and now considering 812/812 (removed 0) transitions.
[2022-05-18 16:28:21] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:28:21] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 16:28:22] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
[2022-05-18 16:28:22] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:28:22] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:28:22] [INFO ] Implicit Places using invariants in 332 ms returned []
[2022-05-18 16:28:22] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:28:22] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 16:28:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:28:26] [INFO ] Implicit Places using invariants and state equation in 3949 ms returned []
Implicit Place search using SMT with State Equation took 4286 ms to find 0 implicit places.
[2022-05-18 16:28:26] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-18 16:28:26] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2022-05-18 16:28:26] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 16:28:26] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 404/404 places, 812/812 transitions.
Built C files in :
/tmp/ltsmin10775692324819397088
[2022-05-18 16:28:26] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2022-05-18 16:28:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:28:26] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2022-05-18 16:28:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:28:26] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2022-05-18 16:28:26] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:28:26] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10775692324819397088
Running compilation step : cd /tmp/ltsmin10775692324819397088;'/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'
Compilation finished in 2229 ms.
Running link step : cd /tmp/ltsmin10775692324819397088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10775692324819397088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1141444380690637306.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 16:28:42] [INFO ] Flatten gal took : 44 ms
[2022-05-18 16:28:42] [INFO ] Flatten gal took : 39 ms
[2022-05-18 16:28:42] [INFO ] Time to serialize gal into /tmp/LTL7157712160695009474.gal : 6 ms
[2022-05-18 16:28:42] [INFO ] Time to serialize properties into /tmp/LTL14430091425637356942.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/LTL7157712160695009474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14430091425637356942.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/LTL7157712...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F(("(((((Check_Sources_E_1>=1)&&(ORB_Lock>=1))||((Check_Sources_E_6>=1)&&(ORB_Lock>=1)))||(((ORB_Lock>=1)&&(Check_Sources_E_7>=...2991
Formula 0 simplified : !FGF("(((((Check_Sources_E_1>=1)&&(ORB_Lock>=1))||((Check_Sources_E_6>=1)&&(ORB_Lock>=1)))||(((ORB_Lock>=1)&&(Check_Sources_E_7>=1))...2977
Detected timeout of ITS tools.
[2022-05-18 16:28:57] [INFO ] Flatten gal took : 34 ms
[2022-05-18 16:28:57] [INFO ] Applying decomposition
[2022-05-18 16:28:57] [INFO ] Flatten gal took : 33 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/graph16279734903907899258.txt' '-o' '/tmp/graph16279734903907899258.bin' '-w' '/tmp/graph16279734903907899258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16279734903907899258.bin' '-l' '-1' '-v' '-w' '/tmp/graph16279734903907899258.weights' '-q' '0' '-e' '0.001'
[2022-05-18 16:28:57] [INFO ] Decomposing Gal with order
[2022-05-18 16:28:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 16:28:57] [INFO ] Removed a total of 676 redundant transitions.
[2022-05-18 16:28:57] [INFO ] Flatten gal took : 106 ms
[2022-05-18 16:28:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 339 labels/synchronizations in 17 ms.
[2022-05-18 16:28:57] [INFO ] Time to serialize gal into /tmp/LTL1765113100922140013.gal : 5 ms
[2022-05-18 16:28:57] [INFO ] Time to serialize properties into /tmp/LTL13204756330223122644.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/LTL1765113100922140013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13204756330223122644.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/LTL1765113...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F(("(((((i5.u20.Check_Sources_E_1>=1)&&(i4.u28.ORB_Lock>=1))||((i5.u24.Check_Sources_E_6>=1)&&(i4.u28.ORB_Lock>=1)))||(((i4.u28...3869
Formula 0 simplified : !FGF("(((((i5.u20.Check_Sources_E_1>=1)&&(i4.u28.ORB_Lock>=1))||((i5.u24.Check_Sources_E_6>=1)&&(i4.u28.ORB_Lock>=1)))||(((i4.u28.OR...3855
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13690611759105641549
[2022-05-18 16:29:12] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13690611759105641549
Running compilation step : cd /tmp/ltsmin13690611759105641549;'/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'
Compilation finished in 1345 ms.
Running link step : cd /tmp/ltsmin13690611759105641549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13690611759105641549;'/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([]((LTLAPp1==true)))&&(LTLAPp2==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 3809 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-01 finished in 113154 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G((G(!X(p1))||p0)) U (p2 U p3)) U p2))'
Support contains 61 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 979/979 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 570 transition count 978
Applied a total of 2 rules in 22 ms. Remains 570 /571 variables (removed 1) and now considering 978/979 (removed 1) transitions.
[2022-05-18 16:29:17] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:29:17] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 16:29:18] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
[2022-05-18 16:29:18] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:29:18] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 16:29:19] [INFO ] Implicit Places using invariants in 421 ms returned []
[2022-05-18 16:29:19] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:29:19] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 16:29:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:29:25] [INFO ] Implicit Places using invariants and state equation in 6811 ms returned []
Implicit Place search using SMT with State Equation took 7234 ms to find 0 implicit places.
[2022-05-18 16:29:25] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:29:25] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 16:29:26] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/571 places, 978/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/571 places, 978/979 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p2), p1, (AND (NOT p0) p1), (NOT p3), true, (AND p1 (NOT p3)), (NOT p3)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (AND (GEQ s88 1) (GEQ s172 1) (GEQ s209 1)) (AND (GEQ s88 1) (GEQ s257 1) (GEQ s543 1)) (AND (GEQ s44 1) (GEQ s88 1) (GEQ s257 1)) (AND (GEQ s88 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-02 finished in 9380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U !F(p0)))))'
Support contains 9 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 979/979 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 570 transition count 978
Applied a total of 2 rules in 16 ms. Remains 570 /571 variables (removed 1) and now considering 978/979 (removed 1) transitions.
[2022-05-18 16:29:27] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:29:27] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 16:29:28] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
[2022-05-18 16:29:28] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:29:28] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 16:29:28] [INFO ] Implicit Places using invariants in 441 ms returned []
[2022-05-18 16:29:28] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:29:28] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 16:29:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:29:32] [INFO ] Implicit Places using invariants and state equation in 4364 ms returned []
Implicit Place search using SMT with State Equation took 4808 ms to find 0 implicit places.
[2022-05-18 16:29:32] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:29:32] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 16:29:33] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/571 places, 978/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/571 places, 978/979 transitions.
Stuttering acceptance computed with spot in 115 ms :[p0, p0, true, p0]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s376 1) (GEQ s506 1)) (AND (GEQ s271 1) (GEQ s506 1)) (AND (GEQ s139 1) (GEQ s506 1)) (AND (GEQ s506 1) (GEQ s510 1)) (AND (GEQ s506 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-03 finished in 6750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U p1))'
Support contains 18 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 979/979 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 571 transition count 930
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 522 transition count 930
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 98 place count 522 transition count 859
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 240 place count 451 transition count 859
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 338 place count 402 transition count 810
Applied a total of 338 rules in 47 ms. Remains 402 /571 variables (removed 169) and now considering 810/979 (removed 169) transitions.
[2022-05-18 16:29:33] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:33] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:29:34] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
[2022-05-18 16:29:34] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:34] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:29:34] [INFO ] Implicit Places using invariants in 349 ms returned []
[2022-05-18 16:29:34] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:34] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 16:29:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:29:39] [INFO ] Implicit Places using invariants and state equation in 4383 ms returned []
Implicit Place search using SMT with State Equation took 4734 ms to find 0 implicit places.
[2022-05-18 16:29:39] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-18 16:29:39] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:39] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 16:29:39] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/571 places, 810/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/571 places, 810/979 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s69 1) (GEQ s384 1) (GEQ s236 1) (GEQ s205 1) (GEQ s136 1) (GEQ s264 1) (GEQ s350 1) (GEQ s181 1)), p0:(OR (AND (GEQ s77 1) (GEQ s231 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5736 reset in 343 ms.
Product exploration explored 100000 steps with 5774 reset in 341 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 (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 379 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 364 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2022-05-18 16:29:41] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:41] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 16:29:41] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 16:29:42] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 84 ms returned sat
[2022-05-18 16:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:29:43] [INFO ] [Real]Absence check using state equation in 1083 ms returned sat
[2022-05-18 16:29:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:29:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 16:29:43] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 28 ms returned sat
[2022-05-18 16:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:29:45] [INFO ] [Nat]Absence check using state equation in 1644 ms returned sat
[2022-05-18 16:29:45] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:29:45] [INFO ] [Nat]Added 96 Read/Feed constraints in 231 ms returned sat
[2022-05-18 16:29:45] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 0 ms to minimize.
[2022-05-18 16:29:45] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-18 16:29:45] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2022-05-18 16:29:45] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2022-05-18 16:29:46] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 0 ms to minimize.
[2022-05-18 16:29:46] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2022-05-18 16:29:46] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2022-05-18 16:29:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1000 ms
[2022-05-18 16:29:46] [INFO ] Computed and/alt/rep : 376/1317/368 causal constraints (skipped 424 transitions) in 43 ms.
[2022-05-18 16:29:48] [INFO ] Added : 206 causal constraints over 42 iterations in 2320 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 18 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 810/810 transitions.
Applied a total of 0 rules in 17 ms. Remains 402 /402 variables (removed 0) and now considering 810/810 (removed 0) transitions.
[2022-05-18 16:29:48] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:48] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:29:49] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
[2022-05-18 16:29:49] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:49] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:29:49] [INFO ] Implicit Places using invariants in 374 ms returned []
[2022-05-18 16:29:49] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:49] [INFO ] Computed 40 place invariants in 7 ms
[2022-05-18 16:29:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:29:53] [INFO ] Implicit Places using invariants and state equation in 3768 ms returned []
Implicit Place search using SMT with State Equation took 4143 ms to find 0 implicit places.
[2022-05-18 16:29:53] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-18 16:29:53] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:53] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 16:29:53] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 810/810 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 (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 347 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p0), (NOT p0)]
[2022-05-18 16:29:54] [INFO ] Flow matrix only has 794 transitions (discarded 16 similar events)
// Phase 1: matrix 794 rows 402 cols
[2022-05-18 16:29:54] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 16:29:55] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 16:29:55] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 84 ms returned sat
[2022-05-18 16:29:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:29:56] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2022-05-18 16:29:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:29:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-18 16:29:56] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 29 ms returned sat
[2022-05-18 16:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:29:58] [INFO ] [Nat]Absence check using state equation in 1666 ms returned sat
[2022-05-18 16:29:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:29:58] [INFO ] [Nat]Added 96 Read/Feed constraints in 227 ms returned sat
[2022-05-18 16:29:58] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 0 ms to minimize.
[2022-05-18 16:29:59] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2022-05-18 16:29:59] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2022-05-18 16:29:59] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2022-05-18 16:29:59] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 10 ms to minimize.
[2022-05-18 16:29:59] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2022-05-18 16:29:59] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2022-05-18 16:29:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 997 ms
[2022-05-18 16:29:59] [INFO ] Computed and/alt/rep : 376/1317/368 causal constraints (skipped 424 transitions) in 46 ms.
[2022-05-18 16:30:01] [INFO ] Added : 206 causal constraints over 42 iterations in 2273 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5747 reset in 358 ms.
Product exploration explored 100000 steps with 5758 reset in 380 ms.
Built C files in :
/tmp/ltsmin5490729567866549455
[2022-05-18 16:30:02] [INFO ] Computing symmetric may disable matrix : 810 transitions.
[2022-05-18 16:30:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:30:02] [INFO ] Computing symmetric may enable matrix : 810 transitions.
[2022-05-18 16:30:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:30:02] [INFO ] Computing Do-Not-Accords matrix : 810 transitions.
[2022-05-18 16:30:02] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 16:30:02] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5490729567866549455
Running compilation step : cd /tmp/ltsmin5490729567866549455;'/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'
Compilation finished in 2183 ms.
Running link step : cd /tmp/ltsmin5490729567866549455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5490729567866549455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12410168510324442347.hoa' '--buchi-type=spotba'
LTSmin run took 3299 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-05 finished in 34596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!((!p1 U p2)||p0) U p2)||G(p2))))'
Support contains 8 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 979/979 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 570 transition count 978
Applied a total of 2 rules in 20 ms. Remains 570 /571 variables (removed 1) and now considering 978/979 (removed 1) transitions.
[2022-05-18 16:30:08] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:08] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 16:30:09] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
[2022-05-18 16:30:09] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:09] [INFO ] Computed 40 place invariants in 21 ms
[2022-05-18 16:30:09] [INFO ] Implicit Places using invariants in 438 ms returned []
[2022-05-18 16:30:09] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:09] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 16:30:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:30:16] [INFO ] Implicit Places using invariants and state equation in 6827 ms returned []
Implicit Place search using SMT with State Equation took 7267 ms to find 0 implicit places.
[2022-05-18 16:30:16] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:16] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 16:30:17] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/571 places, 978/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/571 places, 978/979 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), true, true]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(OR p2 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s198 1) (GEQ s423 1) (GEQ s536 1)), p0:(OR (AND (GEQ s43 1) (GEQ s201 1) (GEQ s369 1)) (AND (GEQ s198 1) (GEQ s423 1) (GEQ s536 1))), p1:(AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1370 steps with 0 reset in 8 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-08 finished in 9201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(X(X((F(p1)&&p0))))||G(p2))))))'
Support contains 6 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 979/979 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 570 transition count 978
Applied a total of 2 rules in 32 ms. Remains 570 /571 variables (removed 1) and now considering 978/979 (removed 1) transitions.
[2022-05-18 16:30:17] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:17] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 16:30:18] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
[2022-05-18 16:30:18] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:18] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 16:30:19] [INFO ] Implicit Places using invariants in 463 ms returned []
[2022-05-18 16:30:19] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:19] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 16:30:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:30:24] [INFO ] Implicit Places using invariants and state equation in 5257 ms returned []
Implicit Place search using SMT with State Equation took 5728 ms to find 0 implicit places.
[2022-05-18 16:30:24] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:24] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 16:30:25] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/571 places, 978/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/571 places, 978/979 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(AND (GEQ s439 1) (GEQ s562 1)), p2:(OR (LT s19 9) (LT s82 1) (LT s257 1)), p1:(GEQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 114 reset in 312 ms.
Stack based approach found an accepted trace after 55640 steps with 63 reset with depth 2390 and stack size 2383 in 214 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-10 finished in 8429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 979/979 transitions.
Applied a total of 0 rules in 14 ms. Remains 571 /571 variables (removed 0) and now considering 979/979 (removed 0) transitions.
[2022-05-18 16:30:26] [INFO ] Flow matrix only has 963 transitions (discarded 16 similar events)
// Phase 1: matrix 963 rows 571 cols
[2022-05-18 16:30:26] [INFO ] Computed 40 place invariants in 29 ms
[2022-05-18 16:30:27] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
[2022-05-18 16:30:27] [INFO ] Flow matrix only has 963 transitions (discarded 16 similar events)
// Phase 1: matrix 963 rows 571 cols
[2022-05-18 16:30:27] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 16:30:27] [INFO ] Implicit Places using invariants in 445 ms returned []
[2022-05-18 16:30:27] [INFO ] Flow matrix only has 963 transitions (discarded 16 similar events)
// Phase 1: matrix 963 rows 571 cols
[2022-05-18 16:30:27] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 16:30:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:30:35] [INFO ] Implicit Places using invariants and state equation in 7529 ms returned []
Implicit Place search using SMT with State Equation took 7979 ms to find 0 implicit places.
[2022-05-18 16:30:35] [INFO ] Flow matrix only has 963 transitions (discarded 16 similar events)
// Phase 1: matrix 963 rows 571 cols
[2022-05-18 16:30:35] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 16:30:35] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 571/571 places, 979/979 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s422 1), p1:(GEQ s86 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2069 steps with 4 reset in 11 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-11 finished in 9981 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((F(p0) U p1))))||G(p2)))'
Support contains 6 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 979/979 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 570 transition count 978
Applied a total of 2 rules in 20 ms. Remains 570 /571 variables (removed 1) and now considering 978/979 (removed 1) transitions.
[2022-05-18 16:30:36] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:36] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 16:30:37] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
[2022-05-18 16:30:37] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:37] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 16:30:37] [INFO ] Implicit Places using invariants in 434 ms returned []
[2022-05-18 16:30:37] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:37] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 16:30:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:30:43] [INFO ] Implicit Places using invariants and state equation in 5820 ms returned []
Implicit Place search using SMT with State Equation took 6261 ms to find 0 implicit places.
[2022-05-18 16:30:43] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:43] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 16:30:44] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/571 places, 978/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/571 places, 978/979 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(GEQ s524 1), p1:(AND (GEQ s234 1) (GEQ s525 1)), p0:(AND (GEQ s232 1) (GEQ s328 1) (GEQ s373 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14895 steps with 22 reset in 45 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-12 finished in 8610 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(F(G(p0))))&&p1)))'
Support contains 3 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 979/979 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 570 transition count 978
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 570 transition count 978
Applied a total of 2 rules in 20 ms. Remains 570 /571 variables (removed 1) and now considering 978/979 (removed 1) transitions.
[2022-05-18 16:30:44] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:44] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 16:30:45] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
[2022-05-18 16:30:45] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:45] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 16:30:46] [INFO ] Implicit Places using invariants in 470 ms returned []
[2022-05-18 16:30:46] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:46] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 16:30:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:30:51] [INFO ] Implicit Places using invariants and state equation in 5413 ms returned []
Implicit Place search using SMT with State Equation took 5885 ms to find 0 implicit places.
[2022-05-18 16:30:51] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 570 cols
[2022-05-18 16:30:51] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 16:30:52] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 570/571 places, 978/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 570/571 places, 978/979 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s381 1), p0:(AND (GEQ s32 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-13 finished in 7920 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U ((F(p2) U G(p0))&&p1)))))'
Support contains 5 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 979/979 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 571 transition count 923
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 515 transition count 923
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 515 transition count 859
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 451 transition count 859
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 352 place count 395 transition count 803
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 358 place count 389 transition count 797
Iterating global reduction 2 with 6 rules applied. Total rules applied 364 place count 389 transition count 797
Applied a total of 364 rules in 48 ms. Remains 389 /571 variables (removed 182) and now considering 797/979 (removed 182) transitions.
[2022-05-18 16:30:52] [INFO ] Flow matrix only has 781 transitions (discarded 16 similar events)
// Phase 1: matrix 781 rows 389 cols
[2022-05-18 16:30:52] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 16:30:53] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
[2022-05-18 16:30:53] [INFO ] Flow matrix only has 781 transitions (discarded 16 similar events)
// Phase 1: matrix 781 rows 389 cols
[2022-05-18 16:30:53] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:30:53] [INFO ] Implicit Places using invariants in 350 ms returned []
[2022-05-18 16:30:53] [INFO ] Flow matrix only has 781 transitions (discarded 16 similar events)
// Phase 1: matrix 781 rows 389 cols
[2022-05-18 16:30:53] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-18 16:30:53] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 16:30:55] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned []
Implicit Place search using SMT with State Equation took 2769 ms to find 0 implicit places.
[2022-05-18 16:30:55] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-18 16:30:55] [INFO ] Flow matrix only has 781 transitions (discarded 16 similar events)
// Phase 1: matrix 781 rows 389 cols
[2022-05-18 16:30:55] [INFO ] Computed 40 place invariants in 7 ms
[2022-05-18 16:30:56] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 389/571 places, 797/979 transitions.
Finished structural reductions, in 1 iterations. Remains : 389/571 places, 797/979 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={1} source=3 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s221 1) (GEQ s317 1)), p0:(AND (GEQ s60 1) (GEQ s117 1) (GEQ s142 1)), p2:(AND (GEQ s221 1) (GEQ s317 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5852 steps with 0 reset in 27 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-15 finished in 4081 ms.
All properties solved by simple procedures.
Total runtime 329701 ms.

BK_STOP 1652891456808

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-S02J04T08"
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-S02J04T08, 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-165277016900596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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