fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r307-tajo-171654460900308
Last Updated
July 7, 2024

About the Execution of 2023-gold for PolyORBNT-PT-S10J30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13159.436 3600000.00 13616922.00 324.90 FT?TFFTFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460900308.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-PT-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460900308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 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 PolyORBNT-PT-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717133797975

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 05:36:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:36:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:36:40] [INFO ] Load time of PNML (sax parser for PT used): 710 ms
[2024-05-31 05:36:40] [INFO ] Transformed 664 places.
[2024-05-31 05:36:40] [INFO ] Transformed 12050 transitions.
[2024-05-31 05:36:40] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 917 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-31 05:36:40] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-31 05:36:40] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-31 05:36:40] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 114 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 123 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2024-05-31 05:36:41] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-31 05:36:41] [INFO ] Computed 92 invariants in 91 ms
[2024-05-31 05:36:42] [INFO ] Dead Transitions using invariants and state equation in 1677 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2024-05-31 05:36:42] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2024-05-31 05:36:42] [INFO ] Computed 92 invariants in 45 ms
[2024-05-31 05:36:43] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-31 05:36:43] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2024-05-31 05:36:43] [INFO ] Invariant cache hit.
[2024-05-31 05:36:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:36:51] [INFO ] Implicit Places using invariants and state equation in 8129 ms returned []
Implicit Place search using SMT with State Equation took 8914 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 24 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10788 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 114 out of 664 places after structural reductions.
[2024-05-31 05:36:52] [INFO ] Flatten gal took : 294 ms
[2024-05-31 05:36:52] [INFO ] Flatten gal took : 156 ms
[2024-05-31 05:36:52] [INFO ] Input system was already deterministic with 1325 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 20) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 05:36:53] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2024-05-31 05:36:53] [INFO ] Invariant cache hit.
[2024-05-31 05:36:53] [INFO ] [Real]Absence check using 62 positive place invariants in 15 ms returned sat
[2024-05-31 05:36:53] [INFO ] [Real]Absence check using 62 positive and 30 generalized place invariants in 29 ms returned sat
[2024-05-31 05:36:54] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-31 05:36:54] [INFO ] [Nat]Absence check using 62 positive place invariants in 43 ms returned sat
[2024-05-31 05:36:54] [INFO ] [Nat]Absence check using 62 positive and 30 generalized place invariants in 29 ms returned sat
[2024-05-31 05:37:06] [INFO ] After 12238ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-31 05:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:37:07] [INFO ] After 636ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-31 05:37:07] [INFO ] Deduced a trap composed of 194 places in 366 ms of which 8 ms to minimize.
[2024-05-31 05:37:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5736 ms
[2024-05-31 05:37:13] [INFO ] After 6876ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 632 ms.
[2024-05-31 05:37:13] [INFO ] After 19973ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 79 place count 620 transition count 1290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 80 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 148 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 584 transition count 1255
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 582 transition count 1253
Applied a total of 154 rules in 301 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2024-05-31 05:37:14] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2024-05-31 05:37:14] [INFO ] Computed 82 invariants in 17 ms
[2024-05-31 05:37:14] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 986 ms. Remains : 582/664 places, 1253/1325 transitions.
Incomplete random walk after 10000 steps, including 701 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :2
Finished Best-First random walk after 2017 steps, including 13 resets, run visited all 1 properties in 5 ms. (steps per millisecond=403 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 13 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 33 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2024-05-31 05:37:15] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-05-31 05:37:15] [INFO ] Computed 82 invariants in 19 ms
[2024-05-31 05:37:16] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
[2024-05-31 05:37:16] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:37:16] [INFO ] Invariant cache hit.
[2024-05-31 05:37:17] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-31 05:37:17] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:37:17] [INFO ] Invariant cache hit.
[2024-05-31 05:37:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:37:24] [INFO ] Implicit Places using invariants and state equation in 7581 ms returned []
Implicit Place search using SMT with State Equation took 8087 ms to find 0 implicit places.
[2024-05-31 05:37:24] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:37:24] [INFO ] Invariant cache hit.
[2024-05-31 05:37:25] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10292 ms. Remains : 653/664 places, 1324/1325 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 217 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s102 7) (GEQ s180 1) (GEQ s511 1) (GEQ s572 1) (GEQ s647 1)) (AND (GEQ s102 7) (GEQ s111 2) (GEQ s437 1) (GEQ s572 1)) (AND (GEQ s102 7) ...], 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 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-00 finished in 10580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 33 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1251
Applied a total of 148 rules in 117 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2024-05-31 05:37:26] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 05:37:26] [INFO ] Computed 82 invariants in 14 ms
[2024-05-31 05:37:26] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
[2024-05-31 05:37:26] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:26] [INFO ] Invariant cache hit.
[2024-05-31 05:37:27] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-05-31 05:37:27] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:27] [INFO ] Invariant cache hit.
[2024-05-31 05:37:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:37:34] [INFO ] Implicit Places using invariants and state equation in 7296 ms returned []
Implicit Place search using SMT with State Equation took 7996 ms to find 0 implicit places.
[2024-05-31 05:37:34] [INFO ] Redundant transitions in 88 ms returned []
[2024-05-31 05:37:34] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:34] [INFO ] Invariant cache hit.
[2024-05-31 05:37:35] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/664 places, 1251/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9627 ms. Remains : 580/664 places, 1251/1325 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s67 1) (LT s144 1) (LT s533 1)) (OR (LT s67 1) (LT s482 1) (LT s533 1)) (OR (LT s67 1) (LT s92 1) (LT s533 1)) (OR (LT s67 1) (LT s383 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8181 reset in 946 ms.
Product exploration explored 100000 steps with 8143 reset in 984 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 96 steps, including 8 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 33 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 29 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 05:37:37] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:37] [INFO ] Invariant cache hit.
[2024-05-31 05:37:38] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
[2024-05-31 05:37:38] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:38] [INFO ] Invariant cache hit.
[2024-05-31 05:37:39] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-31 05:37:39] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:39] [INFO ] Invariant cache hit.
[2024-05-31 05:37:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:37:44] [INFO ] Implicit Places using invariants and state equation in 5634 ms returned []
Implicit Place search using SMT with State Equation took 6156 ms to find 0 implicit places.
[2024-05-31 05:37:44] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-31 05:37:44] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:44] [INFO ] Invariant cache hit.
[2024-05-31 05:37:45] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7470 ms. Remains : 580/580 places, 1251/1251 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 130 steps, including 11 resets, run visited all 1 properties in 3 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8192 reset in 1060 ms.
Product exploration explored 100000 steps with 8195 reset in 919 ms.
Built C files in :
/tmp/ltsmin8710593934086816386
[2024-05-31 05:37:47] [INFO ] Computing symmetric may disable matrix : 1251 transitions.
[2024-05-31 05:37:47] [INFO ] Computation of Complete disable matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:37:47] [INFO ] Computing symmetric may enable matrix : 1251 transitions.
[2024-05-31 05:37:47] [INFO ] Computation of Complete enable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:37:48] [INFO ] Computing Do-Not-Accords matrix : 1251 transitions.
[2024-05-31 05:37:48] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:37:48] [INFO ] Built C files in 344ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8710593934086816386
Running compilation step : cd /tmp/ltsmin8710593934086816386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8710593934086816386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8710593934086816386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 33 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 60 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 05:37:51] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:51] [INFO ] Invariant cache hit.
[2024-05-31 05:37:51] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
[2024-05-31 05:37:51] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:51] [INFO ] Invariant cache hit.
[2024-05-31 05:37:52] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-31 05:37:52] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:52] [INFO ] Invariant cache hit.
[2024-05-31 05:37:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:37:59] [INFO ] Implicit Places using invariants and state equation in 6874 ms returned []
Implicit Place search using SMT with State Equation took 7360 ms to find 0 implicit places.
[2024-05-31 05:37:59] [INFO ] Redundant transitions in 99 ms returned []
[2024-05-31 05:37:59] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 05:37:59] [INFO ] Invariant cache hit.
[2024-05-31 05:38:00] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8917 ms. Remains : 580/580 places, 1251/1251 transitions.
Built C files in :
/tmp/ltsmin11931369301458228501
[2024-05-31 05:38:00] [INFO ] Computing symmetric may disable matrix : 1251 transitions.
[2024-05-31 05:38:00] [INFO ] Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:38:00] [INFO ] Computing symmetric may enable matrix : 1251 transitions.
[2024-05-31 05:38:00] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:38:00] [INFO ] Computing Do-Not-Accords matrix : 1251 transitions.
[2024-05-31 05:38:00] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:38:00] [INFO ] Built C files in 421ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11931369301458228501
Running compilation step : cd /tmp/ltsmin11931369301458228501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11931369301458228501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11931369301458228501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 05:38:03] [INFO ] Flatten gal took : 92 ms
[2024-05-31 05:38:03] [INFO ] Flatten gal took : 83 ms
[2024-05-31 05:38:03] [INFO ] Time to serialize gal into /tmp/LTL14991638107106875930.gal : 19 ms
[2024-05-31 05:38:03] [INFO ] Time to serialize properties into /tmp/LTL6449843698048302245.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14991638107106875930.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7693084483226749998.hoa' '-atoms' '/tmp/LTL6449843698048302245.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6449843698048302245.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7693084483226749998.hoa
Detected timeout of ITS tools.
[2024-05-31 05:38:19] [INFO ] Flatten gal took : 82 ms
[2024-05-31 05:38:19] [INFO ] Flatten gal took : 78 ms
[2024-05-31 05:38:19] [INFO ] Time to serialize gal into /tmp/LTL11157863980142999176.gal : 16 ms
[2024-05-31 05:38:19] [INFO ] Time to serialize properties into /tmp/LTL5322258363835613782.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11157863980142999176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5322258363835613782.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((mi1<1)||(QueueJobB_1_14<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_17<1))||(block<1)))&&((((mi1<1)||(QueueJobB_1_9<1))||...1446
Formula 0 simplified : FG!"((((((((mi1<1)||(QueueJobB_1_14<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_17<1))||(block<1)))&&((((mi1<1)||(QueueJobB_1_9<1))||(b...1440
Detected timeout of ITS tools.
[2024-05-31 05:38:34] [INFO ] Flatten gal took : 77 ms
[2024-05-31 05:38:34] [INFO ] Applying decomposition
[2024-05-31 05:38:34] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7710545864231114841.txt' '-o' '/tmp/graph7710545864231114841.bin' '-w' '/tmp/graph7710545864231114841.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7710545864231114841.bin' '-l' '-1' '-v' '-w' '/tmp/graph7710545864231114841.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:38:34] [INFO ] Decomposing Gal with order
[2024-05-31 05:38:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:38:35] [INFO ] Removed a total of 3070 redundant transitions.
[2024-05-31 05:38:35] [INFO ] Flatten gal took : 220 ms
[2024-05-31 05:38:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 43 ms.
[2024-05-31 05:38:35] [INFO ] Time to serialize gal into /tmp/LTL14882878142717725315.gal : 14 ms
[2024-05-31 05:38:35] [INFO ] Time to serialize properties into /tmp/LTL15921625231679827870.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14882878142717725315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15921625231679827870.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i10.u41.mi1<1)||(i10.u41.QueueJobB_1_14<1))||(i10.u41.block<1))&&(((i10.u41.mi1<1)||(i10.u41.QueueJobB_1_17<1))||(i10....2190
Formula 0 simplified : FG!"((((((((i10.u41.mi1<1)||(i10.u41.QueueJobB_1_14<1))||(i10.u41.block<1))&&(((i10.u41.mi1<1)||(i10.u41.QueueJobB_1_17<1))||(i10.u4...2184
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10405979313497768404
[2024-05-31 05:38:50] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10405979313497768404
Running compilation step : cd /tmp/ltsmin10405979313497768404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2639 ms.
Running link step : cd /tmp/ltsmin10405979313497768404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10405979313497768404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-02 finished in 99535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(!p1 U (p2||G(!p1)))))))'
Support contains 14 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 25 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2024-05-31 05:39:05] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-05-31 05:39:05] [INFO ] Computed 82 invariants in 16 ms
[2024-05-31 05:39:06] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
[2024-05-31 05:39:06] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:06] [INFO ] Invariant cache hit.
[2024-05-31 05:39:06] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-31 05:39:06] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:06] [INFO ] Invariant cache hit.
[2024-05-31 05:39:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:39:14] [INFO ] Implicit Places using invariants and state equation in 7644 ms returned []
Implicit Place search using SMT with State Equation took 8127 ms to find 0 implicit places.
[2024-05-31 05:39:14] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:14] [INFO ] Invariant cache hit.
[2024-05-31 05:39:15] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10161 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s310 3), p2:(AND (LT s239 1) (NOT (OR (AND (GEQ s102 8) (GEQ s374 2) (GEQ s572 1)) (AND (GEQ s102 8) (GEQ s111 1) (GEQ s208 1) (GEQ s572 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5601 reset in 921 ms.
Product exploration explored 100000 steps with 5605 reset in 911 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), true, (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (OR (NOT p0) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Finished Best-First random walk after 84 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), true, (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (AND (NOT p2) p1))), (F (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))]
Property proved to be false thanks to negative knowledge :(F (OR (NOT p0) (AND (NOT p2) p1)))
Knowledge based reduction with 6 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J30-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-05 finished in 12561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 25 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2024-05-31 05:39:18] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:18] [INFO ] Invariant cache hit.
[2024-05-31 05:39:18] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
[2024-05-31 05:39:18] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:18] [INFO ] Invariant cache hit.
[2024-05-31 05:39:19] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-31 05:39:19] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:19] [INFO ] Invariant cache hit.
[2024-05-31 05:39:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:39:26] [INFO ] Implicit Places using invariants and state equation in 6915 ms returned []
Implicit Place search using SMT with State Equation took 7496 ms to find 0 implicit places.
[2024-05-31 05:39:26] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:26] [INFO ] Invariant cache hit.
[2024-05-31 05:39:27] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9298 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s20 1)], 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, null][false, false, false]]
Product exploration explored 100000 steps with 6965 reset in 638 ms.
Product exploration explored 100000 steps with 6958 reset in 653 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 05:39:29] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:29] [INFO ] Invariant cache hit.
[2024-05-31 05:39:29] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2024-05-31 05:39:29] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 49 ms returned sat
[2024-05-31 05:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:39:32] [INFO ] [Real]Absence check using state equation in 2322 ms returned sat
[2024-05-31 05:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:39:32] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2024-05-31 05:39:33] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 46 ms returned sat
[2024-05-31 05:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:39:37] [INFO ] [Nat]Absence check using state equation in 4645 ms returned sat
[2024-05-31 05:39:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:39:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2024-05-31 05:39:37] [INFO ] Computed and/alt/rep : 831/2537/831 causal constraints (skipped 473 transitions) in 110 ms.
[2024-05-31 05:39:38] [INFO ] Added : 15 causal constraints over 3 iterations in 480 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 11 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-31 05:39:38] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:38] [INFO ] Invariant cache hit.
[2024-05-31 05:39:39] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
[2024-05-31 05:39:39] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:39] [INFO ] Invariant cache hit.
[2024-05-31 05:39:39] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-31 05:39:39] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:39] [INFO ] Invariant cache hit.
[2024-05-31 05:39:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:39:48] [INFO ] Implicit Places using invariants and state equation in 8512 ms returned []
Implicit Place search using SMT with State Equation took 9059 ms to find 0 implicit places.
[2024-05-31 05:39:48] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:48] [INFO ] Invariant cache hit.
[2024-05-31 05:39:49] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10983 ms. Remains : 653/653 places, 1324/1324 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 05:39:49] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:39:49] [INFO ] Invariant cache hit.
[2024-05-31 05:39:50] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2024-05-31 05:39:50] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 47 ms returned sat
[2024-05-31 05:39:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:39:52] [INFO ] [Real]Absence check using state equation in 2288 ms returned sat
[2024-05-31 05:39:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:39:53] [INFO ] [Nat]Absence check using 62 positive place invariants in 31 ms returned sat
[2024-05-31 05:39:53] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 52 ms returned sat
[2024-05-31 05:39:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:39:59] [INFO ] [Nat]Absence check using state equation in 5896 ms returned sat
[2024-05-31 05:39:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:39:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2024-05-31 05:39:59] [INFO ] Computed and/alt/rep : 831/2537/831 causal constraints (skipped 473 transitions) in 117 ms.
[2024-05-31 05:40:00] [INFO ] Added : 15 causal constraints over 3 iterations in 568 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6966 reset in 564 ms.
Product exploration explored 100000 steps with 6948 reset in 801 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 653 transition count 1324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 33 place count 653 transition count 1325
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 653 transition count 1325
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 71 place count 653 transition count 1325
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 104 place count 620 transition count 1292
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 137 place count 620 transition count 1292
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 137 rules in 192 ms. Remains 620 /653 variables (removed 33) and now considering 1292/1324 (removed 32) transitions.
[2024-05-31 05:40:02] [INFO ] Flow matrix only has 1283 transitions (discarded 9 similar events)
// Phase 1: matrix 1283 rows 620 cols
[2024-05-31 05:40:02] [INFO ] Computed 82 invariants in 18 ms
[2024-05-31 05:40:02] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
[2024-05-31 05:40:02] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-31 05:40:02] [INFO ] Flow matrix only has 1283 transitions (discarded 9 similar events)
[2024-05-31 05:40:02] [INFO ] Invariant cache hit.
[2024-05-31 05:40:03] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 620/653 places, 1292/1324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1685 ms. Remains : 620/653 places, 1292/1324 transitions.
Built C files in :
/tmp/ltsmin15301790539016484313
[2024-05-31 05:40:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15301790539016484313
Running compilation step : cd /tmp/ltsmin15301790539016484313;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2756 ms.
Running link step : cd /tmp/ltsmin15301790539016484313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15301790539016484313;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10379071297103965714.hoa' '--buchi-type=spotba'
LTSmin run took 3774 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-06 finished in 52150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 22 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 663 transition count 1324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 663 transition count 1324
Applied a total of 2 rules in 25 ms. Remains 663 /664 variables (removed 1) and now considering 1324/1325 (removed 1) transitions.
[2024-05-31 05:40:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 663 cols
[2024-05-31 05:40:10] [INFO ] Computed 92 invariants in 16 ms
[2024-05-31 05:40:11] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
[2024-05-31 05:40:11] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:11] [INFO ] Invariant cache hit.
[2024-05-31 05:40:11] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-31 05:40:11] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:11] [INFO ] Invariant cache hit.
[2024-05-31 05:40:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:40:20] [INFO ] Implicit Places using invariants and state equation in 8410 ms returned []
Implicit Place search using SMT with State Equation took 8945 ms to find 0 implicit places.
[2024-05-31 05:40:20] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:20] [INFO ] Invariant cache hit.
[2024-05-31 05:40:21] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10986 ms. Remains : 663/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s104 1) (LT s448 1) (LT s453 1) (LT s607 1)) (OR (LT s104 1) (LT s135 1) (LT s176 1) (LT s607 1)) (OR (LT s104 1) (LT s235 1) (LT s554 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-07 finished in 11066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&G(!p1)))))'
Support contains 5 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 581 transition count 1252
Applied a total of 146 rules in 85 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2024-05-31 05:40:21] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2024-05-31 05:40:21] [INFO ] Computed 82 invariants in 14 ms
[2024-05-31 05:40:21] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
[2024-05-31 05:40:21] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2024-05-31 05:40:21] [INFO ] Invariant cache hit.
[2024-05-31 05:40:22] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-31 05:40:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2024-05-31 05:40:22] [INFO ] Invariant cache hit.
[2024-05-31 05:40:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:40:28] [INFO ] Implicit Places using invariants and state equation in 6062 ms returned []
Implicit Place search using SMT with State Equation took 6534 ms to find 0 implicit places.
[2024-05-31 05:40:28] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-31 05:40:28] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2024-05-31 05:40:28] [INFO ] Invariant cache hit.
[2024-05-31 05:40:29] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7809 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, p0, (AND p0 p1), p1]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s250 1) (GEQ s326 1)), p1:(AND (GEQ s381 1) (GEQ s467 1) (GEQ s534 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 56064 steps with 4019 reset in 373 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-08 finished in 8279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 28 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2024-05-31 05:40:29] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2024-05-31 05:40:29] [INFO ] Computed 82 invariants in 13 ms
[2024-05-31 05:40:30] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
[2024-05-31 05:40:30] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:30] [INFO ] Invariant cache hit.
[2024-05-31 05:40:30] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-31 05:40:30] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:30] [INFO ] Invariant cache hit.
[2024-05-31 05:40:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:40:39] [INFO ] Implicit Places using invariants and state equation in 8831 ms returned []
Implicit Place search using SMT with State Equation took 9371 ms to find 0 implicit places.
[2024-05-31 05:40:39] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:39] [INFO ] Invariant cache hit.
[2024-05-31 05:40:40] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11164 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s382 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-09 finished in 11256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 38 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2024-05-31 05:40:40] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:40] [INFO ] Invariant cache hit.
[2024-05-31 05:40:41] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
[2024-05-31 05:40:41] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:41] [INFO ] Invariant cache hit.
[2024-05-31 05:40:42] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-31 05:40:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:42] [INFO ] Invariant cache hit.
[2024-05-31 05:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:40:49] [INFO ] Implicit Places using invariants and state equation in 7628 ms returned []
Implicit Place search using SMT with State Equation took 8180 ms to find 0 implicit places.
[2024-05-31 05:40:49] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:49] [INFO ] Invariant cache hit.
[2024-05-31 05:40:50] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9951 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s289 1), p1:(AND (GEQ s213 1) (GEQ s266 10))], 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][false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-10 finished in 10087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(!p1))))'
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 29 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2024-05-31 05:40:50] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:50] [INFO ] Invariant cache hit.
[2024-05-31 05:40:51] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
[2024-05-31 05:40:51] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:51] [INFO ] Invariant cache hit.
[2024-05-31 05:40:52] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-31 05:40:52] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:40:52] [INFO ] Invariant cache hit.
[2024-05-31 05:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:41:01] [INFO ] Implicit Places using invariants and state equation in 8794 ms returned []
Implicit Place search using SMT with State Equation took 9353 ms to find 0 implicit places.
[2024-05-31 05:41:01] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:41:01] [INFO ] Invariant cache hit.
[2024-05-31 05:41:02] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11262 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 78 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s310 3), p0:(OR (LT s262 1) (LT s284 1))], 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, null][false, false, false]]
Product exploration explored 100000 steps with 5605 reset in 457 ms.
Stuttering criterion allowed to conclude after 6728 steps with 375 reset in 34 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-12 finished in 11851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&(G(p1)||G(F(p2))))))'
Support contains 7 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 62 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2024-05-31 05:41:02] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:41:02] [INFO ] Invariant cache hit.
[2024-05-31 05:41:03] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
[2024-05-31 05:41:03] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:41:03] [INFO ] Invariant cache hit.
[2024-05-31 05:41:04] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-31 05:41:04] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:41:04] [INFO ] Invariant cache hit.
[2024-05-31 05:41:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:41:12] [INFO ] Implicit Places using invariants and state equation in 8115 ms returned []
Implicit Place search using SMT with State Equation took 8630 ms to find 0 implicit places.
[2024-05-31 05:41:12] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2024-05-31 05:41:12] [INFO ] Invariant cache hit.
[2024-05-31 05:41:13] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10617 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s529 1) (GEQ s590 1)), p2:(LT s310 3), p0:(AND (GEQ s102 8) (GEQ s208 1) (GEQ s511 1) (GEQ s572 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 53 steps with 2 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-13 finished in 10980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1291
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 68 place count 620 transition count 1255
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 140 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 106 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2024-05-31 05:41:13] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2024-05-31 05:41:13] [INFO ] Computed 82 invariants in 32 ms
[2024-05-31 05:41:14] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
[2024-05-31 05:41:14] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 05:41:14] [INFO ] Invariant cache hit.
[2024-05-31 05:41:15] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-31 05:41:15] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 05:41:15] [INFO ] Invariant cache hit.
[2024-05-31 05:41:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:41:21] [INFO ] Implicit Places using invariants and state equation in 6533 ms returned []
Implicit Place search using SMT with State Equation took 7100 ms to find 0 implicit places.
[2024-05-31 05:41:21] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-31 05:41:21] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2024-05-31 05:41:21] [INFO ] Invariant cache hit.
[2024-05-31 05:41:22] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8679 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s431 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-14 finished in 8717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-31 05:41:22] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18180234018402785296
[2024-05-31 05:41:22] [INFO ] Computing symmetric may disable matrix : 1325 transitions.
[2024-05-31 05:41:22] [INFO ] Applying decomposition
[2024-05-31 05:41:22] [INFO ] Computation of Complete disable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:41:22] [INFO ] Flatten gal took : 57 ms
[2024-05-31 05:41:22] [INFO ] Computing symmetric may enable matrix : 1325 transitions.
[2024-05-31 05:41:22] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6006209982546542079.txt' '-o' '/tmp/graph6006209982546542079.bin' '-w' '/tmp/graph6006209982546542079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6006209982546542079.bin' '-l' '-1' '-v' '-w' '/tmp/graph6006209982546542079.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:41:22] [INFO ] Decomposing Gal with order
[2024-05-31 05:41:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:41:23] [INFO ] Computing Do-Not-Accords matrix : 1325 transitions.
[2024-05-31 05:41:23] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:41:23] [INFO ] Built C files in 508ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18180234018402785296
Running compilation step : cd /tmp/ltsmin18180234018402785296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 05:41:23] [INFO ] Removed a total of 1291 redundant transitions.
[2024-05-31 05:41:23] [INFO ] Flatten gal took : 206 ms
[2024-05-31 05:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 403 labels/synchronizations in 58 ms.
[2024-05-31 05:41:23] [INFO ] Time to serialize gal into /tmp/LTLFireability9826620495965448602.gal : 41 ms
[2024-05-31 05:41:23] [INFO ] Time to serialize properties into /tmp/LTLFireability9147157375104343095.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9826620495965448602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9147157375104343095.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i13.u38.mi1<1)||(i13.u38.QueueJobB_1_14<1))||(i13.u38.block<1))&&(((i13.u38.mi1<1)||(i13.u38.QueueJobB_1_17<1))||(i13....2190
Formula 0 simplified : FG!"((((((((i13.u38.mi1<1)||(i13.u38.QueueJobB_1_14<1))||(i13.u38.block<1))&&(((i13.u38.mi1<1)||(i13.u38.QueueJobB_1_17<1))||(i13.u3...2184
Compilation finished in 4681 ms.
Running link step : cd /tmp/ltsmin18180234018402785296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin18180234018402785296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-31 06:02:58] [INFO ] Flatten gal took : 148 ms
[2024-05-31 06:02:58] [INFO ] Time to serialize gal into /tmp/LTLFireability6135355386339663625.gal : 24 ms
[2024-05-31 06:02:58] [INFO ] Time to serialize properties into /tmp/LTLFireability2924673324114477453.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6135355386339663625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2924673324114477453.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((mi1<1)||(QueueJobB_1_14<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_17<1))||(block<1)))&&((((mi1<1)||(QueueJobB_1_9<1))||...1446
Formula 0 simplified : FG!"((((((((mi1<1)||(QueueJobB_1_14<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_17<1))||(block<1)))&&((((mi1<1)||(QueueJobB_1_9<1))||(b...1440
Detected timeout of ITS tools.
[2024-05-31 06:24:33] [INFO ] Flatten gal took : 127 ms
[2024-05-31 06:24:33] [INFO ] Input system was already deterministic with 1325 transitions.
[2024-05-31 06:24:33] [INFO ] Transformed 664 places.
[2024-05-31 06:24:33] [INFO ] Transformed 1325 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 06:25:04] [INFO ] Time to serialize gal into /tmp/LTLFireability13581342650661876714.gal : 7 ms
[2024-05-31 06:25:04] [INFO ] Time to serialize properties into /tmp/LTLFireability13765415591753763184.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13581342650661876714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13765415591753763184.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((((((((mi1<1)||(QueueJobB_1_14<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_17<1))||(block<1)))&&((((mi1<1)||(QueueJobB_1_9<1))||...1446
Formula 0 simplified : FG!"((((((((mi1<1)||(QueueJobB_1_14<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_17<1))||(block<1)))&&((((mi1<1)||(QueueJobB_1_9<1))||(b...1440
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5775516 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16011944 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBNT-PT-S10J30"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-PT-S10J30, 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 r307-tajo-171654460900308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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