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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16217.107 3600000.00 7254943.00 303888.20 FFTTFT?TFFFTTTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 29 14:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 29 14:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 29 14:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 151K Apr 29 14:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K May 9 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 9 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K May 9 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 807K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652895237769

Running Version 202205111006
[2022-05-18 17:33:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 17:33:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 17:33:59] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2022-05-18 17:33:59] [INFO ] Transformed 690 places.
[2022-05-18 17:33:59] [INFO ] Transformed 1434 transitions.
[2022-05-18 17:33:59] [INFO ] Parsed PT model containing 690 places and 1434 transitions in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
[2022-05-18 17:33:59] [INFO ] Reduced 88 identical enabling conditions.
[2022-05-18 17:33:59] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 342 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Applied a total of 2 rules in 52 ms. Remains 688 /690 variables (removed 2) and now considering 1306/1306 (removed 0) transitions.
[2022-05-18 17:33:59] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 688 cols
[2022-05-18 17:33:59] [INFO ] Computed 52 place invariants in 78 ms
[2022-05-18 17:34:01] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
[2022-05-18 17:34:01] [INFO ] Flow matrix only has 1202 transitions (discarded 16 similar events)
// Phase 1: matrix 1202 rows 688 cols
[2022-05-18 17:34:01] [INFO ] Computed 52 place invariants in 51 ms
[2022-05-18 17:34:01] [INFO ] Implicit Places using invariants in 537 ms returned []
[2022-05-18 17:34:01] [INFO ] Flow matrix only has 1202 transitions (discarded 16 similar events)
// Phase 1: matrix 1202 rows 688 cols
[2022-05-18 17:34:01] [INFO ] Computed 52 place invariants in 30 ms
[2022-05-18 17:34:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 17:34:08] [INFO ] Implicit Places using invariants and state equation in 6280 ms returned []
Implicit Place search using SMT with State Equation took 6820 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 688/690 places, 1218/1306 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 686 transition count 1202
Reduce places removed 8 places and 16 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 10 place count 678 transition count 1186
Deduced a syphon composed of 8 places in 2 ms
Applied a total of 10 rules in 25 ms. Remains 678 /688 variables (removed 10) and now considering 1186/1218 (removed 32) transitions.
[2022-05-18 17:34:08] [INFO ] Flow matrix only has 1170 transitions (discarded 16 similar events)
// Phase 1: matrix 1170 rows 678 cols
[2022-05-18 17:34:08] [INFO ] Computed 60 place invariants in 23 ms
[2022-05-18 17:34:08] [INFO ] Implicit Places using invariants in 363 ms returned []
[2022-05-18 17:34:08] [INFO ] Flow matrix only has 1170 transitions (discarded 16 similar events)
// Phase 1: matrix 1170 rows 678 cols
[2022-05-18 17:34:08] [INFO ] Computed 60 place invariants in 17 ms
[2022-05-18 17:34:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 17:34:14] [INFO ] Implicit Places using invariants and state equation in 5977 ms returned []
Implicit Place search using SMT with State Equation took 6347 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 678/690 places, 1186/1306 transitions.
Finished structural reductions, in 2 iterations. Remains : 678/690 places, 1186/1306 transitions.
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Support contains 334 out of 670 places after structural reductions.
[2022-05-18 17:34:14] [INFO ] Flatten gal took : 156 ms
[2022-05-18 17:34:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 17:34:14] [INFO ] Flatten gal took : 96 ms
[2022-05-18 17:34:15] [INFO ] Input system was already deterministic with 1186 transitions.
Support contains 276 out of 670 places (down from 334) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 535 ms. (steps per millisecond=18 ) properties (out of 34) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-18 17:34:16] [INFO ] Flow matrix only has 1170 transitions (discarded 16 similar events)
// Phase 1: matrix 1170 rows 670 cols
[2022-05-18 17:34:16] [INFO ] Computed 52 place invariants in 19 ms
[2022-05-18 17:34:16] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-05-18 17:34:16] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 32 ms returned sat
[2022-05-18 17:34:16] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-18 17:34:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-18 17:34:16] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 37 ms returned sat
[2022-05-18 17:34:16] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((false U G(p0))&&X(F(X(p1)))))))'
Support contains 17 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 662 transition count 1178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 654 transition count 1170
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 654 transition count 1170
Applied a total of 32 rules in 93 ms. Remains 654 /670 variables (removed 16) and now considering 1170/1186 (removed 16) transitions.
[2022-05-18 17:34:17] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:34:17] [INFO ] Computed 52 place invariants in 22 ms
[2022-05-18 17:34:18] [INFO ] Dead Transitions using invariants and state equation in 1274 ms found 0 transitions.
[2022-05-18 17:34:18] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:34:18] [INFO ] Computed 52 place invariants in 14 ms
[2022-05-18 17:34:19] [INFO ] Implicit Places using invariants in 646 ms returned [67, 175, 283, 334, 445, 468, 546, 553]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 651 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/670 places, 1170/1186 transitions.
Applied a total of 0 rules in 13 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 646/670 places, 1170/1186 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p0:(OR (AND (GEQ s543 1) (GEQ s638 1)) (AND (GEQ s132 1) (GEQ s638 1)) (AND (GEQ s432 1) (GEQ s638 1)) (AND (GEQ s546 1) (GEQ s638 1)) (AND (GEQ s282 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-00 finished in 2434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!X(p0) U X((X(p1)&&X(p0))))))'
Support contains 25 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 662 transition count 1178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 654 transition count 1170
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 654 transition count 1170
Applied a total of 32 rules in 39 ms. Remains 654 /670 variables (removed 16) and now considering 1170/1186 (removed 16) transitions.
[2022-05-18 17:34:19] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:34:19] [INFO ] Computed 52 place invariants in 22 ms
[2022-05-18 17:34:20] [INFO ] Dead Transitions using invariants and state equation in 1298 ms found 0 transitions.
[2022-05-18 17:34:20] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:34:20] [INFO ] Computed 52 place invariants in 22 ms
[2022-05-18 17:34:21] [INFO ] Implicit Places using invariants in 502 ms returned [67, 175, 283, 334, 445, 468, 546, 553]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 508 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/670 places, 1170/1186 transitions.
Applied a total of 0 rules in 11 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 646/670 places, 1170/1186 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s578 1) (GEQ s636 1)) (AND (GEQ s428 1) (GEQ s636 1)) (AND (GEQ s234 1) (GEQ s636 1)) (AND (GEQ s75 1) (GEQ s636 1)) (AND (GEQ s596 1) (G...], 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 62 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-01 finished in 2001 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U X((p1 U p2))) U p3))'
Support contains 35 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 662 transition count 1178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 654 transition count 1170
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 654 transition count 1170
Applied a total of 32 rules in 25 ms. Remains 654 /670 variables (removed 16) and now considering 1170/1186 (removed 16) transitions.
[2022-05-18 17:34:21] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:34:21] [INFO ] Computed 52 place invariants in 22 ms
[2022-05-18 17:34:22] [INFO ] Dead Transitions using invariants and state equation in 1215 ms found 0 transitions.
[2022-05-18 17:34:22] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:34:22] [INFO ] Computed 52 place invariants in 20 ms
[2022-05-18 17:34:23] [INFO ] Implicit Places using invariants in 555 ms returned [67, 175, 283, 334, 445, 468, 546, 553]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 559 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/670 places, 1170/1186 transitions.
Applied a total of 0 rules in 9 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 646/670 places, 1170/1186 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, p3, p2, p2, (AND p2 p3), (AND p2 p3)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p3, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p3 p2), acceptance={} source=4 dest: 0}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p3) p1 (NOT p2))), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p3 p2), acceptance={} source=5 dest: 0}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p3:(OR (GEQ s79 1) (GEQ s49 1) (GEQ s36 1) (GEQ s158 1) (GEQ s165 1) (GEQ s267 1) (GEQ s328 1) (GEQ s224 1)), p0:(OR (AND (GEQ s62 1) (GEQ s66 10) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 640 ms.
Product exploration explored 100000 steps with 50000 reset in 602 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p3) p1 (NOT p2))))), (X (NOT (AND p3 p2))), (X (X (NOT p2))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p3) p1 (NOT p2)))))), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))
Knowledge based reduction with 22 factoid took 590 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-03 finished in 3919 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(!((true U (p0 U p1)) U p0))))))'
Support contains 33 out of 670 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 670 transition count 1130
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 614 transition count 1122
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 606 transition count 1122
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 128 place count 606 transition count 1050
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 272 place count 534 transition count 1050
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 352 place count 494 transition count 1010
Applied a total of 352 rules in 112 ms. Remains 494 /670 variables (removed 176) and now considering 1010/1186 (removed 176) transitions.
[2022-05-18 17:34:25] [INFO ] Flow matrix only has 994 transitions (discarded 16 similar events)
// Phase 1: matrix 994 rows 494 cols
[2022-05-18 17:34:25] [INFO ] Computed 52 place invariants in 12 ms
[2022-05-18 17:34:26] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
[2022-05-18 17:34:26] [INFO ] Flow matrix only has 994 transitions (discarded 16 similar events)
// Phase 1: matrix 994 rows 494 cols
[2022-05-18 17:34:26] [INFO ] Computed 52 place invariants in 12 ms
[2022-05-18 17:34:26] [INFO ] Implicit Places using invariants in 468 ms returned []
[2022-05-18 17:34:26] [INFO ] Flow matrix only has 994 transitions (discarded 16 similar events)
// Phase 1: matrix 994 rows 494 cols
[2022-05-18 17:34:26] [INFO ] Computed 52 place invariants in 16 ms
[2022-05-18 17:34:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 17:34:34] [INFO ] Implicit Places using invariants and state equation in 7852 ms returned []
Implicit Place search using SMT with State Equation took 8327 ms to find 0 implicit places.
[2022-05-18 17:34:34] [INFO ] Redundant transitions in 77 ms returned []
[2022-05-18 17:34:34] [INFO ] Flow matrix only has 994 transitions (discarded 16 similar events)
// Phase 1: matrix 994 rows 494 cols
[2022-05-18 17:34:34] [INFO ] Computed 52 place invariants in 18 ms
[2022-05-18 17:34:35] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 494/670 places, 1010/1186 transitions.
Finished structural reductions, in 1 iterations. Remains : 494/670 places, 1010/1186 transitions.
Stuttering acceptance computed with spot in 95 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s347 1) (GEQ s45 1) (GEQ s113 1) (GEQ s378 1) (GEQ s50 1) (GEQ s489 1) (GEQ s294 1) (GEQ s121 1) (GEQ s237 1) (GEQ s406 1) (GEQ s310 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 32 reset in 672 ms.
Stack based approach found an accepted trace after 810 steps with 0 reset with depth 811 and stack size 811 in 7 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-04 finished in 10869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U !p1)))||F((X(X(p2))&&p3))))'
Support contains 36 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Applied a total of 0 rules in 8 ms. Remains 670 /670 variables (removed 0) and now considering 1186/1186 (removed 0) transitions.
[2022-05-18 17:34:36] [INFO ] Flow matrix only has 1170 transitions (discarded 16 similar events)
// Phase 1: matrix 1170 rows 670 cols
[2022-05-18 17:34:36] [INFO ] Computed 52 place invariants in 18 ms
[2022-05-18 17:34:37] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
[2022-05-18 17:34:37] [INFO ] Flow matrix only has 1170 transitions (discarded 16 similar events)
// Phase 1: matrix 1170 rows 670 cols
[2022-05-18 17:34:37] [INFO ] Computed 52 place invariants in 13 ms
[2022-05-18 17:34:38] [INFO ] Implicit Places using invariants in 532 ms returned [67, 176, 287, 338, 454, 479, 559, 566]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 536 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 662/670 places, 1186/1186 transitions.
Applied a total of 0 rules in 14 ms. Remains 662 /662 variables (removed 0) and now considering 1186/1186 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 662/670 places, 1186/1186 transitions.
Stuttering acceptance computed with spot in 577 ms :[(AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p2), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 7}, { cond=p3, acceptance={} source=0 dest: 8}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 5}, { cond=p3, acceptance={0} source=2 dest: 6}], [{ cond=(AND p3 p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p3 p1 p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=3 dest: 10}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND p3 p1 (NOT p0)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p3) p1 p0), acceptance={0} source=4 dest: 7}, { cond=(AND p3 p1 p0), acceptance={0} source=4 dest: 8}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND p3 p1 p0 (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 10}], [{ cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p3 p1 p0 (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=p3, acceptance={} source=9 dest: 0}, { cond=(NOT p3), acceptance={} source=9 dest: 1}], [{ cond=p3, acceptance={0} source=10 dest: 2}, { cond=(NOT p3), acceptance={0} source=10 dest: 10}]], initial=9, aps=[p3:(OR (AND (GEQ s283 1) (GEQ s440 1)) (AND (GEQ s34 1) (GEQ s283 1)) (AND (GEQ s57 1) (GEQ s567 1)) (AND (GEQ s228 1) (GEQ s552 1)) (AND (GEQ s552 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1068 ms.
Product exploration explored 100000 steps with 33333 reset in 1081 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p3)), (X (X (NOT (AND (NOT p3) p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND p3 p1 p0)))), (X (X (NOT (AND p3 p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 p1 p0 (NOT p2))))), (X (X (NOT (AND p3 p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2))
Knowledge based reduction with 10 factoid took 318 ms. Reduced automaton from 11 states, 30 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-05 finished in 4933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 670 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 670 transition count 1122
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 606 transition count 1122
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 128 place count 606 transition count 1042
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 288 place count 526 transition count 1042
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 416 place count 462 transition count 978
Applied a total of 416 rules in 62 ms. Remains 462 /670 variables (removed 208) and now considering 978/1186 (removed 208) transitions.
[2022-05-18 17:34:41] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 462 cols
[2022-05-18 17:34:41] [INFO ] Computed 52 place invariants in 11 ms
[2022-05-18 17:34:42] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
[2022-05-18 17:34:42] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 462 cols
[2022-05-18 17:34:42] [INFO ] Computed 52 place invariants in 14 ms
[2022-05-18 17:34:42] [INFO ] Implicit Places using invariants in 449 ms returned [43, 117, 196, 234, 312, 327, 383, 389]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 451 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 454/670 places, 978/1186 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 450 transition count 974
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 450 transition count 974
Applied a total of 8 rules in 37 ms. Remains 450 /454 variables (removed 4) and now considering 974/978 (removed 4) transitions.
[2022-05-18 17:34:42] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:34:42] [INFO ] Computed 44 place invariants in 11 ms
[2022-05-18 17:34:42] [INFO ] Implicit Places using invariants in 437 ms returned []
[2022-05-18 17:34:42] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:34:42] [INFO ] Computed 44 place invariants in 11 ms
[2022-05-18 17:34:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 17:34:50] [INFO ] Implicit Places using invariants and state equation in 7363 ms returned []
Implicit Place search using SMT with State Equation took 7813 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 450/670 places, 974/1186 transitions.
Finished structural reductions, in 2 iterations. Remains : 450/670 places, 974/1186 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-06 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 s19 9) (LT s101 1) (LT s123 1)) (OR (LT s19 9) (LT s172 1) (LT s388 1)) (OR (LT s19 9) (LT s172 1) (LT s243 1)) (OR (LT s19 9) (LT s172 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 366 reset in 524 ms.
Product exploration explored 100000 steps with 377 reset in 518 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 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 11 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 974/974 transitions.
Applied a total of 0 rules in 26 ms. Remains 450 /450 variables (removed 0) and now considering 974/974 (removed 0) transitions.
[2022-05-18 17:34:51] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:34:51] [INFO ] Computed 44 place invariants in 11 ms
[2022-05-18 17:34:52] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
[2022-05-18 17:34:52] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:34:52] [INFO ] Computed 44 place invariants in 20 ms
[2022-05-18 17:34:53] [INFO ] Implicit Places using invariants in 456 ms returned []
[2022-05-18 17:34:53] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:34:53] [INFO ] Computed 44 place invariants in 23 ms
[2022-05-18 17:34:53] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 17:35:00] [INFO ] Implicit Places using invariants and state equation in 7544 ms returned []
Implicit Place search using SMT with State Equation took 8001 ms to find 0 implicit places.
[2022-05-18 17:35:00] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-18 17:35:00] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:35:00] [INFO ] Computed 44 place invariants in 11 ms
[2022-05-18 17:35:01] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 450/450 places, 974/974 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 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 367 reset in 474 ms.
Product exploration explored 100000 steps with 321 reset in 508 ms.
Built C files in :
/tmp/ltsmin13104582675245106539
[2022-05-18 17:35:02] [INFO ] Computing symmetric may disable matrix : 974 transitions.
[2022-05-18 17:35:02] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:35:02] [INFO ] Computing symmetric may enable matrix : 974 transitions.
[2022-05-18 17:35:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:35:03] [INFO ] Computing Do-Not-Accords matrix : 974 transitions.
[2022-05-18 17:35:03] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:35:03] [INFO ] Built C files in 283ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13104582675245106539
Running compilation step : cd /tmp/ltsmin13104582675245106539;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2858 ms.
Running link step : cd /tmp/ltsmin13104582675245106539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin13104582675245106539;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8161394192776219120.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 974/974 transitions.
Applied a total of 0 rules in 20 ms. Remains 450 /450 variables (removed 0) and now considering 974/974 (removed 0) transitions.
[2022-05-18 17:35:17] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:35:17] [INFO ] Computed 44 place invariants in 11 ms
[2022-05-18 17:35:18] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
[2022-05-18 17:35:18] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:35:18] [INFO ] Computed 44 place invariants in 11 ms
[2022-05-18 17:35:19] [INFO ] Implicit Places using invariants in 426 ms returned []
[2022-05-18 17:35:19] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:35:19] [INFO ] Computed 44 place invariants in 10 ms
[2022-05-18 17:35:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 17:35:26] [INFO ] Implicit Places using invariants and state equation in 7661 ms returned []
Implicit Place search using SMT with State Equation took 8099 ms to find 0 implicit places.
[2022-05-18 17:35:26] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-18 17:35:26] [INFO ] Flow matrix only has 958 transitions (discarded 16 similar events)
// Phase 1: matrix 958 rows 450 cols
[2022-05-18 17:35:26] [INFO ] Computed 44 place invariants in 12 ms
[2022-05-18 17:35:27] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 450/450 places, 974/974 transitions.
Built C files in :
/tmp/ltsmin5719934750215310527
[2022-05-18 17:35:27] [INFO ] Computing symmetric may disable matrix : 974 transitions.
[2022-05-18 17:35:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:35:27] [INFO ] Computing symmetric may enable matrix : 974 transitions.
[2022-05-18 17:35:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:35:27] [INFO ] Computing Do-Not-Accords matrix : 974 transitions.
[2022-05-18 17:35:27] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:35:27] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5719934750215310527
Running compilation step : cd /tmp/ltsmin5719934750215310527;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2725 ms.
Running link step : cd /tmp/ltsmin5719934750215310527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin5719934750215310527;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11467870700179821352.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 17:35:42] [INFO ] Flatten gal took : 54 ms
[2022-05-18 17:35:42] [INFO ] Flatten gal took : 51 ms
[2022-05-18 17:35:42] [INFO ] Time to serialize gal into /tmp/LTL15136982900476318390.gal : 12 ms
[2022-05-18 17:35:42] [INFO ] Time to serialize properties into /tmp/LTL731850893775144299.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15136982900476318390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL731850893775144299.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1513698...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((cSources<9)||(ProcessingEvt_6<1))||(ModifiedSrc_1<1))&&(((cSources<9)||(ModifiedSrc_2<1))||(ProcessingEvt_3<1)))&&((((c...990
Formula 0 simplified : !GF"(((((((cSources<9)||(ProcessingEvt_6<1))||(ModifiedSrc_1<1))&&(((cSources<9)||(ModifiedSrc_2<1))||(ProcessingEvt_3<1)))&&((((cSo...984
Detected timeout of ITS tools.
[2022-05-18 17:35:57] [INFO ] Flatten gal took : 45 ms
[2022-05-18 17:35:57] [INFO ] Applying decomposition
[2022-05-18 17:35:57] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9497574397841868719.txt' '-o' '/tmp/graph9497574397841868719.bin' '-w' '/tmp/graph9497574397841868719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9497574397841868719.bin' '-l' '-1' '-v' '-w' '/tmp/graph9497574397841868719.weights' '-q' '0' '-e' '0.001'
[2022-05-18 17:35:57] [INFO ] Decomposing Gal with order
[2022-05-18 17:35:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 17:35:58] [INFO ] Removed a total of 873 redundant transitions.
[2022-05-18 17:35:58] [INFO ] Flatten gal took : 251 ms
[2022-05-18 17:35:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 475 labels/synchronizations in 35 ms.
[2022-05-18 17:35:58] [INFO ] Time to serialize gal into /tmp/LTL17975510262484594945.gal : 9 ms
[2022-05-18 17:35:58] [INFO ] Time to serialize properties into /tmp/LTL15939923045290012901.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17975510262484594945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15939923045290012901.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1797551...247
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((i0.u0.cSources<9)||(i0.u0.ProcessingEvt_6<1))||(i0.u0.ModifiedSrc_1<1))&&(((i0.u0.cSources<9)||(i0.u0.ModifiedSrc_2<1))...1278
Formula 0 simplified : !GF"(((((((i0.u0.cSources<9)||(i0.u0.ProcessingEvt_6<1))||(i0.u0.ModifiedSrc_1<1))&&(((i0.u0.cSources<9)||(i0.u0.ModifiedSrc_2<1))||...1272
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin43388995539111381
[2022-05-18 17:36:13] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin43388995539111381
Running compilation step : cd /tmp/ltsmin43388995539111381;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1597 ms.
Running link step : cd /tmp/ltsmin43388995539111381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin43388995539111381;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-06 finished in 107228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 662 transition count 1178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 662 transition count 1178
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 655 transition count 1171
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 655 transition count 1171
Applied a total of 30 rules in 26 ms. Remains 655 /670 variables (removed 15) and now considering 1171/1186 (removed 15) transitions.
[2022-05-18 17:36:28] [INFO ] Flow matrix only has 1155 transitions (discarded 16 similar events)
// Phase 1: matrix 1155 rows 655 cols
[2022-05-18 17:36:28] [INFO ] Computed 52 place invariants in 13 ms
[2022-05-18 17:36:29] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
[2022-05-18 17:36:29] [INFO ] Flow matrix only has 1155 transitions (discarded 16 similar events)
// Phase 1: matrix 1155 rows 655 cols
[2022-05-18 17:36:29] [INFO ] Computed 52 place invariants in 13 ms
[2022-05-18 17:36:30] [INFO ] Implicit Places using invariants in 611 ms returned [67, 175, 283, 334, 446, 469, 547, 554]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 614 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 647/670 places, 1171/1186 transitions.
Applied a total of 0 rules in 11 ms. Remains 647 /647 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 647/670 places, 1171/1186 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s247 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][false, false]]
Stuttering criterion allowed to conclude after 8851 steps with 20 reset in 41 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-08 finished in 2029 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 4 out of 670 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 670 transition count 1131
Reduce places removed 55 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 63 rules applied. Total rules applied 118 place count 615 transition count 1123
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 126 place count 607 transition count 1123
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 126 place count 607 transition count 1035
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 302 place count 519 transition count 1035
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 382 place count 479 transition count 995
Applied a total of 382 rules in 58 ms. Remains 479 /670 variables (removed 191) and now considering 995/1186 (removed 191) transitions.
[2022-05-18 17:36:30] [INFO ] Flow matrix only has 979 transitions (discarded 16 similar events)
// Phase 1: matrix 979 rows 479 cols
[2022-05-18 17:36:30] [INFO ] Computed 52 place invariants in 19 ms
[2022-05-18 17:36:31] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
[2022-05-18 17:36:31] [INFO ] Flow matrix only has 979 transitions (discarded 16 similar events)
// Phase 1: matrix 979 rows 479 cols
[2022-05-18 17:36:31] [INFO ] Computed 52 place invariants in 16 ms
[2022-05-18 17:36:31] [INFO ] Implicit Places using invariants in 481 ms returned [46, 122, 203, 242, 325, 342, 399, 405]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 483 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 471/670 places, 995/1186 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 467 transition count 991
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 467 transition count 991
Applied a total of 8 rules in 25 ms. Remains 467 /471 variables (removed 4) and now considering 991/995 (removed 4) transitions.
[2022-05-18 17:36:31] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
// Phase 1: matrix 975 rows 467 cols
[2022-05-18 17:36:31] [INFO ] Computed 44 place invariants in 18 ms
[2022-05-18 17:36:32] [INFO ] Implicit Places using invariants in 455 ms returned []
[2022-05-18 17:36:32] [INFO ] Flow matrix only has 975 transitions (discarded 16 similar events)
// Phase 1: matrix 975 rows 467 cols
[2022-05-18 17:36:32] [INFO ] Computed 44 place invariants in 13 ms
[2022-05-18 17:36:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 17:36:35] [INFO ] Implicit Places using invariants and state equation in 3271 ms returned []
Implicit Place search using SMT with State Equation took 3728 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 467/670 places, 991/1186 transitions.
Finished structural reductions, in 2 iterations. Remains : 467/670 places, 991/1186 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s299 1), p1:(AND (GEQ s240 10) (GEQ s260 1) (GEQ s350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 476 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-09 finished in 5116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 670 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 670 transition count 1115
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 599 transition count 1114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 598 transition count 1114
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 144 place count 598 transition count 1034
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 304 place count 518 transition count 1034
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 430 place count 455 transition count 971
Applied a total of 430 rules in 56 ms. Remains 455 /670 variables (removed 215) and now considering 971/1186 (removed 215) transitions.
[2022-05-18 17:36:35] [INFO ] Flow matrix only has 955 transitions (discarded 16 similar events)
// Phase 1: matrix 955 rows 455 cols
[2022-05-18 17:36:35] [INFO ] Computed 52 place invariants in 17 ms
[2022-05-18 17:36:36] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
[2022-05-18 17:36:36] [INFO ] Flow matrix only has 955 transitions (discarded 16 similar events)
// Phase 1: matrix 955 rows 455 cols
[2022-05-18 17:36:36] [INFO ] Computed 52 place invariants in 11 ms
[2022-05-18 17:36:36] [INFO ] Implicit Places using invariants in 502 ms returned [43, 116, 194, 231, 309, 324, 379, 385]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 505 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 447/670 places, 971/1186 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 443 transition count 967
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 443 transition count 967
Applied a total of 8 rules in 33 ms. Remains 443 /447 variables (removed 4) and now considering 967/971 (removed 4) transitions.
[2022-05-18 17:36:36] [INFO ] Flow matrix only has 951 transitions (discarded 16 similar events)
// Phase 1: matrix 951 rows 443 cols
[2022-05-18 17:36:37] [INFO ] Computed 44 place invariants in 16 ms
[2022-05-18 17:36:37] [INFO ] Implicit Places using invariants in 464 ms returned []
[2022-05-18 17:36:37] [INFO ] Flow matrix only has 951 transitions (discarded 16 similar events)
// Phase 1: matrix 951 rows 443 cols
[2022-05-18 17:36:37] [INFO ] Computed 44 place invariants in 10 ms
[2022-05-18 17:36:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 17:36:46] [INFO ] Implicit Places using invariants and state equation in 9394 ms returned []
Implicit Place search using SMT with State Equation took 9861 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 443/670 places, 967/1186 transitions.
Finished structural reductions, in 2 iterations. Remains : 443/670 places, 967/1186 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s183 1) (GEQ s406 1)), p0:(AND (GEQ s50 1) (GEQ s307 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 652 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-10 finished in 11308 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 5 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 662 transition count 1178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 654 transition count 1170
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 654 transition count 1170
Applied a total of 32 rules in 24 ms. Remains 654 /670 variables (removed 16) and now considering 1170/1186 (removed 16) transitions.
[2022-05-18 17:36:46] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:36:47] [INFO ] Computed 52 place invariants in 12 ms
[2022-05-18 17:36:48] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
[2022-05-18 17:36:48] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:36:48] [INFO ] Computed 52 place invariants in 12 ms
[2022-05-18 17:36:48] [INFO ] Implicit Places using invariants in 578 ms returned [67, 175, 283, 334, 445, 468, 546, 553]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 579 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/670 places, 1170/1186 transitions.
Applied a total of 0 rules in 9 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 646/670 places, 1170/1186 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s336 10) (LT s419 1) (LT s484 1)), p0:(OR (LT s400 1) (LT s487 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 554 ms.
Product exploration explored 100000 steps with 50000 reset in 564 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 9 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-12 finished in 3380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0)) U !p1)))'
Support contains 3 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 662 transition count 1178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 654 transition count 1170
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 654 transition count 1170
Applied a total of 32 rules in 26 ms. Remains 654 /670 variables (removed 16) and now considering 1170/1186 (removed 16) transitions.
[2022-05-18 17:36:50] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:36:50] [INFO ] Computed 52 place invariants in 20 ms
[2022-05-18 17:36:51] [INFO ] Dead Transitions using invariants and state equation in 1274 ms found 0 transitions.
[2022-05-18 17:36:51] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:36:51] [INFO ] Computed 52 place invariants in 20 ms
[2022-05-18 17:36:52] [INFO ] Implicit Places using invariants in 585 ms returned [67, 175, 283, 334, 445, 468, 546, 553]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 587 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/670 places, 1170/1186 transitions.
Applied a total of 0 rules in 9 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 646/670 places, 1170/1186 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), p1, true, p1, (OR (NOT p0) p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s14 1), p1:(AND (GEQ s155 1) (GEQ s539 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 551 ms.
Product exploration explored 100000 steps with 50000 reset in 528 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-13 finished in 3237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(X(p1))||X(p2)||G(p3)))))'
Support contains 7 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 663 transition count 1179
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 663 transition count 1179
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 656 transition count 1172
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 656 transition count 1172
Applied a total of 28 rules in 23 ms. Remains 656 /670 variables (removed 14) and now considering 1172/1186 (removed 14) transitions.
[2022-05-18 17:36:53] [INFO ] Flow matrix only has 1156 transitions (discarded 16 similar events)
// Phase 1: matrix 1156 rows 656 cols
[2022-05-18 17:36:53] [INFO ] Computed 52 place invariants in 21 ms
[2022-05-18 17:36:54] [INFO ] Dead Transitions using invariants and state equation in 1250 ms found 0 transitions.
[2022-05-18 17:36:54] [INFO ] Flow matrix only has 1156 transitions (discarded 16 similar events)
// Phase 1: matrix 1156 rows 656 cols
[2022-05-18 17:36:54] [INFO ] Computed 52 place invariants in 12 ms
[2022-05-18 17:36:55] [INFO ] Implicit Places using invariants in 568 ms returned [67, 175, 284, 335, 447, 470, 548, 555]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 570 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 648/670 places, 1172/1186 transitions.
Applied a total of 0 rules in 12 ms. Remains 648 /648 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 648/670 places, 1172/1186 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-14 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=(AND p0 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p3), acceptance={} source=6 dest: 0}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={} source=7 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p3 p1), acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(GEQ s344 1), p3:(AND (GEQ s401 1) (GEQ s595 1)), p1:(OR (LT s213 1) (LT s443 1)), p2:(OR (AND (GEQ s401 1) (GEQ s595 1)) (AND (GEQ s545 1) (GEQ s640 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-14 finished in 2123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||p1)))'
Support contains 4 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 1186/1186 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 662 transition count 1178
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 654 transition count 1170
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 654 transition count 1170
Applied a total of 32 rules in 26 ms. Remains 654 /670 variables (removed 16) and now considering 1170/1186 (removed 16) transitions.
[2022-05-18 17:36:55] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:36:55] [INFO ] Computed 52 place invariants in 20 ms
[2022-05-18 17:36:57] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
[2022-05-18 17:36:57] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2022-05-18 17:36:57] [INFO ] Computed 52 place invariants in 12 ms
[2022-05-18 17:36:57] [INFO ] Implicit Places using invariants in 553 ms returned [67, 175, 283, 334, 445, 468, 546, 553]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 555 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/670 places, 1170/1186 transitions.
Applied a total of 0 rules in 7 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 646/670 places, 1170/1186 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s354 1), p0:(AND (GEQ s280 1) (GEQ s353 1) (GEQ s605 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4334 steps with 0 reset in 18 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-15 finished in 2076 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-18 17:36:57] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin671936820393708008
[2022-05-18 17:36:58] [INFO ] Computing symmetric may disable matrix : 1186 transitions.
[2022-05-18 17:36:58] [INFO ] Applying decomposition
[2022-05-18 17:36:58] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:36:58] [INFO ] Computing symmetric may enable matrix : 1186 transitions.
[2022-05-18 17:36:58] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:36:58] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8121372898077887821.txt' '-o' '/tmp/graph8121372898077887821.bin' '-w' '/tmp/graph8121372898077887821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8121372898077887821.bin' '-l' '-1' '-v' '-w' '/tmp/graph8121372898077887821.weights' '-q' '0' '-e' '0.001'
[2022-05-18 17:36:58] [INFO ] Decomposing Gal with order
[2022-05-18 17:36:58] [INFO ] Computing Do-Not-Accords matrix : 1186 transitions.
[2022-05-18 17:36:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 17:36:58] [INFO ] Computation of Completed DNA matrix. took 82 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:36:58] [INFO ] Built C files in 288ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin671936820393708008
Running compilation step : cd /tmp/ltsmin671936820393708008;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 17:36:58] [INFO ] Removed a total of 970 redundant transitions.
[2022-05-18 17:36:58] [INFO ] Flatten gal took : 96 ms
[2022-05-18 17:36:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 19 ms.
[2022-05-18 17:36:58] [INFO ] Time to serialize gal into /tmp/LTLFireability9331343476807763068.gal : 7 ms
[2022-05-18 17:36:58] [INFO ] Time to serialize properties into /tmp/LTLFireability10402884630273799659.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9331343476807763068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10402884630273799659.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((i15.u132.cSources<9)||(i15.u13.ProcessingEvt_6<1))||(i15.u132.ModifiedSrc_1<1))&&(((i15.u132.cSources<9)||(i15.u132.Mod...1420
Formula 0 simplified : !GF"(((((((i15.u132.cSources<9)||(i15.u13.ProcessingEvt_6<1))||(i15.u132.ModifiedSrc_1<1))&&(((i15.u132.cSources<9)||(i15.u132.Modif...1414
Compilation finished in 3813 ms.
Running link step : cd /tmp/ltsmin671936820393708008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin671936820393708008;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 17:57:57] [INFO ] Flatten gal took : 113 ms
[2022-05-18 17:57:57] [INFO ] Time to serialize gal into /tmp/LTLFireability3562444156529254199.gal : 10 ms
[2022-05-18 17:57:57] [INFO ] Time to serialize properties into /tmp/LTLFireability14007189573583991182.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3562444156529254199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14007189573583991182.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((cSources<9)||(ProcessingEvt_6<1))||(ModifiedSrc_1<1))&&(((cSources<9)||(ModifiedSrc_2<1))||(ProcessingEvt_3<1)))&&((((c...990
Formula 0 simplified : !GF"(((((((cSources<9)||(ProcessingEvt_6<1))||(ModifiedSrc_1<1))&&(((cSources<9)||(ModifiedSrc_2<1))||(ProcessingEvt_3<1)))&&((((cSo...984
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.093: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.102: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.102: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.108: Initializing POR dependencies: labels 1187, guards 1186
pins2lts-mc-linux64( 3/ 8), 7.429: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 7.429: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 7.430: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 8.103: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 8.144: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 8.171: There are 1189 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 8.171: State length is 671, there are 1189 groups
pins2lts-mc-linux64( 0/ 8), 8.171: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 8.171: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 8.171: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 8.171: Visible groups: 0 / 1189, labels: 1 / 1189
pins2lts-mc-linux64( 0/ 8), 8.171: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 8.171: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 8.251: [Blue] ~119 levels ~960 states ~1664 transitions
pins2lts-mc-linux64( 4/ 8), 8.317: [Blue] ~237 levels ~1920 states ~3048 transitions
pins2lts-mc-linux64( 4/ 8), 8.416: [Blue] ~473 levels ~3840 states ~5768 transitions
pins2lts-mc-linux64( 4/ 8), 8.687: [Blue] ~885 levels ~7680 states ~11472 transitions
pins2lts-mc-linux64( 4/ 8), 9.104: [Blue] ~1611 levels ~15360 states ~22408 transitions
pins2lts-mc-linux64( 4/ 8), 9.905: [Blue] ~3281 levels ~30720 states ~44808 transitions
pins2lts-mc-linux64( 4/ 8), 11.347: [Blue] ~5809 levels ~61440 states ~87624 transitions
pins2lts-mc-linux64( 4/ 8), 14.112: [Blue] ~11355 levels ~122880 states ~176240 transitions
pins2lts-mc-linux64( 4/ 8), 19.270: [Blue] ~20927 levels ~245760 states ~349664 transitions
pins2lts-mc-linux64( 4/ 8), 29.434: [Blue] ~38097 levels ~491520 states ~690464 transitions
pins2lts-mc-linux64( 4/ 8), 49.908: [Blue] ~78619 levels ~983040 states ~1417568 transitions
pins2lts-mc-linux64( 4/ 8), 90.166: [Blue] ~153514 levels ~1966080 states ~2848112 transitions
pins2lts-mc-linux64( 4/ 8), 170.511: [Blue] ~290274 levels ~3932160 states ~5673672 transitions
pins2lts-mc-linux64( 4/ 8), 336.617: [Blue] ~566410 levels ~7864320 states ~11393240 transitions
pins2lts-mc-linux64( 4/ 8), 675.232: [Blue] ~1068323 levels ~15728640 states ~22658144 transitions
pins2lts-mc-linux64( 2/ 8), 1327.477: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1327.533:
pins2lts-mc-linux64( 0/ 8), 1327.533: Explored 27324384 states 42392540 transitions, fanout: 1.551
pins2lts-mc-linux64( 0/ 8), 1327.533: Total exploration time 1319.330 sec (1319.290 sec minimum, 1319.312 sec on average)
pins2lts-mc-linux64( 0/ 8), 1327.533: States per second: 20711, Transitions per second: 32132
pins2lts-mc-linux64( 0/ 8), 1327.533:
pins2lts-mc-linux64( 0/ 8), 1327.533: State space has 32640005 states, 126234 are accepting
pins2lts-mc-linux64( 0/ 8), 1327.533: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1327.533: blue states: 27324384 (83.71%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1327.533: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1327.533: all-red states: 126234 (0.39%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1327.533:
pins2lts-mc-linux64( 0/ 8), 1327.533: Total memory used for local state coloring: 269.6MB
pins2lts-mc-linux64( 0/ 8), 1327.533:
pins2lts-mc-linux64( 0/ 8), 1327.533: Queue width: 8B, total height: 17671513, memory: 134.82MB
pins2lts-mc-linux64( 0/ 8), 1327.533: Tree memory: 505.0MB, 16.2 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1327.533: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1327.533: Stored 1217 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1327.533: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1327.533: Est. total memory use: 639.8MB (~1158.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin671936820393708008;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin671936820393708008;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-18 18:18:58] [INFO ] Flatten gal took : 462 ms
[2022-05-18 18:19:11] [INFO ] Input system was already deterministic with 1186 transitions.
[2022-05-18 18:19:12] [INFO ] Transformed 670 places.
[2022-05-18 18:19:12] [INFO ] Transformed 1186 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 18:19:42] [INFO ] Time to serialize gal into /tmp/LTLFireability1743049121405158643.gal : 6 ms
[2022-05-18 18:19:42] [INFO ] Time to serialize properties into /tmp/LTLFireability12774591880506789982.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1743049121405158643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12774591880506789982.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((((((cSources<9)||(ProcessingEvt_6<1))||(ModifiedSrc_1<1))&&(((cSources<9)||(ModifiedSrc_2<1))||(ProcessingEvt_3<1)))&&((((c...990
Formula 0 simplified : !GF"(((((((cSources<9)||(ProcessingEvt_6<1))||(ModifiedSrc_1<1))&&(((cSources<9)||(ModifiedSrc_2<1))||(ProcessingEvt_3<1)))&&((((cSo...984

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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