Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.7K Feb 26 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 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-COL-S04J04T10-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678851994186

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T10
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-15 03:46:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 03:46:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 03:46:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 03:46:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 03:46:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 522 ms
[2023-03-15 03:46:36] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 870 PT places and 5136.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 03:46:36] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-15 03:46:36] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 3 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 28) seen :26
Finished Best-First random walk after 13 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=13 )
[2023-03-15 03:46:36] [INFO ] Flatten gal took : 27 ms
[2023-03-15 03:46:36] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-15 03:46:36] [INFO ] Unfolded HLPN to a Petri net with 870 places and 5034 transitions 34774 arcs in 102 ms.
[2023-03-15 03:46:36] [INFO ] Unfolded 13 HLPN properties in 2 ms.
[2023-03-15 03:46:36] [INFO ] Reduced 60 identical enabling conditions.
[2023-03-15 03:46:36] [INFO ] Reduced 440 identical enabling conditions.
[2023-03-15 03:46:36] [INFO ] Reduced 2210 identical enabling conditions.
[2023-03-15 03:46:36] [INFO ] Reduced 2210 identical enabling conditions.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 401 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 74 ms. Remains 870 /870 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
[2023-03-15 03:46:37] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2023-03-15 03:46:37] [INFO ] Computed 58 place invariants in 166 ms
[2023-03-15 03:46:38] [INFO ] Dead Transitions using invariants and state equation in 1313 ms found 540 transitions.
Found 540 dead transitions using SMT.
Drop transitions removed 540 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 540 transitions.
[2023-03-15 03:46:38] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
// Phase 1: matrix 1744 rows 870 cols
[2023-03-15 03:46:38] [INFO ] Computed 58 place invariants in 65 ms
[2023-03-15 03:46:38] [INFO ] Implicit Places using invariants in 363 ms returned [672, 673, 674, 675, 676, 677, 678, 679, 680, 681]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 370 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 860/870 places, 1784/2324 transitions.
Applied a total of 0 rules in 22 ms. Remains 860 /860 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1810 ms. Remains : 860/870 places, 1784/2324 transitions.
Support contains 401 out of 860 places after structural reductions.
[2023-03-15 03:46:38] [INFO ] Flatten gal took : 161 ms
[2023-03-15 03:46:39] [INFO ] Flatten gal took : 132 ms
[2023-03-15 03:46:39] [INFO ] Input system was already deterministic with 1784 transitions.
Finished random walk after 993 steps, including 0 resets, run visited all 28 properties in 90 ms. (steps per millisecond=11 )
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p0)&&F(p1))))))'
Support contains 21 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 860 transition count 1724
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 800 transition count 1714
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 790 transition count 1714
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 140 place count 790 transition count 1614
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 340 place count 690 transition count 1614
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 380 place count 670 transition count 1594
Applied a total of 380 rules in 142 ms. Remains 670 /860 variables (removed 190) and now considering 1594/1784 (removed 190) transitions.
[2023-03-15 03:46:40] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
// Phase 1: matrix 1554 rows 670 cols
[2023-03-15 03:46:40] [INFO ] Computed 48 place invariants in 26 ms
[2023-03-15 03:46:40] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
[2023-03-15 03:46:40] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:46:40] [INFO ] Invariant cache hit.
[2023-03-15 03:46:41] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-15 03:46:41] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:46:41] [INFO ] Invariant cache hit.
[2023-03-15 03:46:42] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:46:55] [INFO ] Implicit Places using invariants and state equation in 14234 ms returned []
Implicit Place search using SMT with State Equation took 14807 ms to find 0 implicit places.
[2023-03-15 03:46:55] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-15 03:46:55] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:46:55] [INFO ] Invariant cache hit.
[2023-03-15 03:46:56] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 670/860 places, 1594/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16292 ms. Remains : 670/860 places, 1594/1784 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s575 1) (LT s615 1)) (OR (LT s576 1) (LT s615 1)) (OR (LT s579 1) (LT s615 1)) (OR (LT s580 1) (LT s615 1)) (OR (LT s581 1) (LT s615 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12858 reset in 628 ms.
Product exploration explored 100000 steps with 12922 reset in 534 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 369 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-15 03:46:59] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:46:59] [INFO ] Invariant cache hit.
[2023-03-15 03:46:59] [INFO ] [Real]Absence check using 16 positive place invariants in 26 ms returned sat
[2023-03-15 03:47:00] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 233 ms returned sat
[2023-03-15 03:47:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 03:47:01] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2023-03-15 03:47:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 03:47:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 47 ms returned sat
[2023-03-15 03:47:02] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 88 ms returned sat
[2023-03-15 03:47:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 03:47:04] [INFO ] [Nat]Absence check using state equation in 2371 ms returned sat
[2023-03-15 03:47:04] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:47:06] [INFO ] [Nat]Added 200 Read/Feed constraints in 1664 ms returned sat
[2023-03-15 03:47:06] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
[2023-03-15 03:47:09] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3243 ms
Could not prove EG (NOT p0)
Support contains 21 out of 670 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 670/670 places, 1594/1594 transitions.
Applied a total of 0 rules in 44 ms. Remains 670 /670 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2023-03-15 03:47:09] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:47:09] [INFO ] Invariant cache hit.
[2023-03-15 03:47:10] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
[2023-03-15 03:47:10] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:47:10] [INFO ] Invariant cache hit.
[2023-03-15 03:47:11] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-15 03:47:11] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:47:11] [INFO ] Invariant cache hit.
[2023-03-15 03:47:11] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:47:27] [INFO ] Implicit Places using invariants and state equation in 16336 ms returned []
Implicit Place search using SMT with State Equation took 16864 ms to find 0 implicit places.
[2023-03-15 03:47:27] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-15 03:47:27] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:47:27] [INFO ] Invariant cache hit.
[2023-03-15 03:47:28] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18270 ms. Remains : 670/670 places, 1594/1594 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 280 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 333 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2023-03-15 03:47:29] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:47:29] [INFO ] Invariant cache hit.
[2023-03-15 03:47:29] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2023-03-15 03:47:30] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 238 ms returned sat
[2023-03-15 03:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 03:47:31] [INFO ] [Real]Absence check using state equation in 1448 ms returned sat
[2023-03-15 03:47:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 03:47:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 35 ms returned sat
[2023-03-15 03:47:32] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 88 ms returned sat
[2023-03-15 03:47:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 03:47:35] [INFO ] [Nat]Absence check using state equation in 2546 ms returned sat
[2023-03-15 03:47:35] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:47:36] [INFO ] [Nat]Added 200 Read/Feed constraints in 1673 ms returned sat
[2023-03-15 03:47:37] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2023-03-15 03:47:40] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3234 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 412 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 12816 reset in 497 ms.
Product exploration explored 100000 steps with 12731 reset in 509 ms.
Built C files in :
/tmp/ltsmin5381036280407724843
[2023-03-15 03:47:41] [INFO ] Too many transitions (1594) to apply POR reductions. Disabling POR matrices.
[2023-03-15 03:47:41] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5381036280407724843
Running compilation step : cd /tmp/ltsmin5381036280407724843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5381036280407724843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5381036280407724843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 21 out of 670 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 670/670 places, 1594/1594 transitions.
Applied a total of 0 rules in 36 ms. Remains 670 /670 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2023-03-15 03:47:44] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:47:44] [INFO ] Invariant cache hit.
[2023-03-15 03:47:45] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
[2023-03-15 03:47:45] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:47:45] [INFO ] Invariant cache hit.
[2023-03-15 03:47:45] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-15 03:47:45] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:47:45] [INFO ] Invariant cache hit.
[2023-03-15 03:47:46] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:47:59] [INFO ] Implicit Places using invariants and state equation in 14229 ms returned []
Implicit Place search using SMT with State Equation took 14739 ms to find 0 implicit places.
[2023-03-15 03:48:00] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 03:48:00] [INFO ] Flow matrix only has 1554 transitions (discarded 40 similar events)
[2023-03-15 03:48:00] [INFO ] Invariant cache hit.
[2023-03-15 03:48:00] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16006 ms. Remains : 670/670 places, 1594/1594 transitions.
Built C files in :
/tmp/ltsmin16709261323046359585
[2023-03-15 03:48:00] [INFO ] Too many transitions (1594) to apply POR reductions. Disabling POR matrices.
[2023-03-15 03:48:00] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16709261323046359585
Running compilation step : cd /tmp/ltsmin16709261323046359585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2893 ms.
Running link step : cd /tmp/ltsmin16709261323046359585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin16709261323046359585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13856074263213797993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 03:48:15] [INFO ] Flatten gal took : 90 ms
[2023-03-15 03:48:15] [INFO ] Flatten gal took : 85 ms
[2023-03-15 03:48:15] [INFO ] Time to serialize gal into /tmp/LTL16605478879667259564.gal : 17 ms
[2023-03-15 03:48:15] [INFO ] Time to serialize properties into /tmp/LTL8448485357401748990.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16605478879667259564.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3194886893395985434.hoa' '-atoms' '/tmp/LTL8448485357401748990.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8448485357401748990.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3194886893395985434.hoa
Detected timeout of ITS tools.
[2023-03-15 03:48:31] [INFO ] Flatten gal took : 64 ms
[2023-03-15 03:48:31] [INFO ] Flatten gal took : 68 ms
[2023-03-15 03:48:31] [INFO ] Time to serialize gal into /tmp/LTL14120502427558021189.gal : 10 ms
[2023-03-15 03:48:31] [INFO ] Time to serialize properties into /tmp/LTL6344769882619612841.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14120502427558021189.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6344769882619612841.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((((CanInjectEvent_0<1)||(DataOnSrc_0<1))||((PlaceSources_0<1)||(cSources_0<1)))&&(((CanInjectEvent_0<1)||(DataOnSrc_1<1))...1031
Formula 0 simplified : G(F!"(((((CanInjectEvent_0<1)||(DataOnSrc_0<1))||((PlaceSources_0<1)||(cSources_0<1)))&&(((CanInjectEvent_0<1)||(DataOnSrc_1<1))||((...1019
Detected timeout of ITS tools.
[2023-03-15 03:48:46] [INFO ] Flatten gal took : 61 ms
[2023-03-15 03:48:46] [INFO ] Applying decomposition
[2023-03-15 03:48:46] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1121506077711557219.txt' '-o' '/tmp/graph1121506077711557219.bin' '-w' '/tmp/graph1121506077711557219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1121506077711557219.bin' '-l' '-1' '-v' '-w' '/tmp/graph1121506077711557219.weights' '-q' '0' '-e' '0.001'
[2023-03-15 03:48:46] [INFO ] Decomposing Gal with order
[2023-03-15 03:48:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 03:48:47] [INFO ] Removed a total of 1011 redundant transitions.
[2023-03-15 03:48:47] [INFO ] Flatten gal took : 362 ms
[2023-03-15 03:48:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 530 labels/synchronizations in 41 ms.
[2023-03-15 03:48:47] [INFO ] Time to serialize gal into /tmp/LTL16907191693002874951.gal : 20 ms
[2023-03-15 03:48:47] [INFO ] Time to serialize properties into /tmp/LTL10592513758062934936.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16907191693002874951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10592513758062934936.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((((i6.u14.CanInjectEvent_0<1)||(i7.u1.DataOnSrc_0<1))||((i7.u1.PlaceSources_0<1)||(i6.u14.cSources_0<1)))&&(((i6.u14.CanI...1379
Formula 0 simplified : G(F!"(((((i6.u14.CanInjectEvent_0<1)||(i7.u1.DataOnSrc_0<1))||((i7.u1.PlaceSources_0<1)||(i6.u14.cSources_0<1)))&&(((i6.u14.CanInjec...1367
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11773009269256003364
[2023-03-15 03:49:02] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11773009269256003364
Running compilation step : cd /tmp/ltsmin11773009269256003364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11773009269256003364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11773009269256003364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-02 finished in 145260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 856 transition count 1694
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 766 transition count 1694
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 766 transition count 1594
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 666 transition count 1594
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 390 place count 656 transition count 1584
Iterating global reduction 2 with 10 rules applied. Total rules applied 400 place count 656 transition count 1584
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 556 transition count 1484
Applied a total of 600 rules in 91 ms. Remains 556 /860 variables (removed 304) and now considering 1484/1784 (removed 300) transitions.
[2023-03-15 03:49:05] [INFO ] Flow matrix only has 1444 transitions (discarded 40 similar events)
// Phase 1: matrix 1444 rows 556 cols
[2023-03-15 03:49:05] [INFO ] Computed 44 place invariants in 25 ms
[2023-03-15 03:49:06] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
[2023-03-15 03:49:06] [INFO ] Flow matrix only has 1444 transitions (discarded 40 similar events)
[2023-03-15 03:49:06] [INFO ] Invariant cache hit.
[2023-03-15 03:49:06] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-15 03:49:06] [INFO ] Flow matrix only has 1444 transitions (discarded 40 similar events)
[2023-03-15 03:49:06] [INFO ] Invariant cache hit.
[2023-03-15 03:49:07] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:49:21] [INFO ] Implicit Places using invariants and state equation in 14835 ms returned []
Implicit Place search using SMT with State Equation took 15275 ms to find 0 implicit places.
[2023-03-15 03:49:21] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 03:49:21] [INFO ] Flow matrix only has 1444 transitions (discarded 40 similar events)
[2023-03-15 03:49:21] [INFO ] Invariant cache hit.
[2023-03-15 03:49:22] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/860 places, 1484/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16689 ms. Remains : 556/860 places, 1484/1784 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s180 1) (GEQ s239 1) (GEQ s244 1)) (AND (GEQ s180 1) (GEQ s239 1) (GEQ s246 1)) (AND (GEQ s180 1) (GEQ s239 1) (GEQ s248 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4791 steps with 0 reset in 37 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-03 finished in 16792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 22 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 856 transition count 1734
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 806 transition count 1724
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 796 transition count 1724
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 120 place count 796 transition count 1614
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 340 place count 686 transition count 1614
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 350 place count 676 transition count 1604
Iterating global reduction 3 with 10 rules applied. Total rules applied 360 place count 676 transition count 1604
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 540 place count 586 transition count 1514
Applied a total of 540 rules in 86 ms. Remains 586 /860 variables (removed 274) and now considering 1514/1784 (removed 270) transitions.
[2023-03-15 03:49:22] [INFO ] Flow matrix only has 1474 transitions (discarded 40 similar events)
// Phase 1: matrix 1474 rows 586 cols
[2023-03-15 03:49:22] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-15 03:49:22] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
[2023-03-15 03:49:22] [INFO ] Flow matrix only has 1474 transitions (discarded 40 similar events)
[2023-03-15 03:49:22] [INFO ] Invariant cache hit.
[2023-03-15 03:49:23] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-15 03:49:23] [INFO ] Flow matrix only has 1474 transitions (discarded 40 similar events)
[2023-03-15 03:49:23] [INFO ] Invariant cache hit.
[2023-03-15 03:49:23] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:49:38] [INFO ] Implicit Places using invariants and state equation in 15403 ms returned []
Implicit Place search using SMT with State Equation took 15868 ms to find 0 implicit places.
[2023-03-15 03:49:38] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 03:49:38] [INFO ] Flow matrix only has 1474 transitions (discarded 40 similar events)
[2023-03-15 03:49:38] [INFO ] Invariant cache hit.
[2023-03-15 03:49:39] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/860 places, 1514/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17205 ms. Remains : 586/860 places, 1514/1784 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s183 1) (GEQ s280 1)) (AND (GEQ s183 1) (GEQ s279 1)) (AND (GEQ s183 1) (GEQ s278 1)) (AND (GEQ s183 1) (GEQ s277 1)) (AND (GEQ s183 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7 reset in 444 ms.
Stack based approach found an accepted trace after 1873 steps with 0 reset with depth 1874 and stack size 1874 in 10 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-04 finished in 17787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 41 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 856 transition count 1694
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 766 transition count 1694
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 766 transition count 1634
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 706 transition count 1634
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 310 place count 696 transition count 1624
Iterating global reduction 2 with 10 rules applied. Total rules applied 320 place count 696 transition count 1624
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 520 place count 596 transition count 1524
Applied a total of 520 rules in 67 ms. Remains 596 /860 variables (removed 264) and now considering 1524/1784 (removed 260) transitions.
[2023-03-15 03:49:40] [INFO ] Flow matrix only has 1484 transitions (discarded 40 similar events)
// Phase 1: matrix 1484 rows 596 cols
[2023-03-15 03:49:40] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-15 03:49:40] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
[2023-03-15 03:49:40] [INFO ] Flow matrix only has 1484 transitions (discarded 40 similar events)
[2023-03-15 03:49:40] [INFO ] Invariant cache hit.
[2023-03-15 03:49:41] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-15 03:49:41] [INFO ] Flow matrix only has 1484 transitions (discarded 40 similar events)
[2023-03-15 03:49:41] [INFO ] Invariant cache hit.
[2023-03-15 03:49:41] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:49:52] [INFO ] Implicit Places using invariants and state equation in 11329 ms returned []
Implicit Place search using SMT with State Equation took 11780 ms to find 0 implicit places.
[2023-03-15 03:49:52] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-15 03:49:52] [INFO ] Flow matrix only has 1484 transitions (discarded 40 similar events)
[2023-03-15 03:49:52] [INFO ] Invariant cache hit.
[2023-03-15 03:49:53] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 596/860 places, 1524/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13117 ms. Remains : 596/860 places, 1524/1784 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s172 10) (GEQ s213 1)) (AND (GEQ s172 10) (GEQ s214 1)) (AND (GEQ s172 10) (GEQ s215 1)) (AND (GEQ s172 10) (GEQ s209 1)) (AND (GEQ s172 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 79795 steps with 1243 reset in 416 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-05 finished in 13589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X((!p0||G(p1)))))'
Support contains 21 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Applied a total of 4 rules in 19 ms. Remains 856 /860 variables (removed 4) and now considering 1784/1784 (removed 0) transitions.
[2023-03-15 03:49:53] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
// Phase 1: matrix 1744 rows 856 cols
[2023-03-15 03:49:53] [INFO ] Computed 44 place invariants in 30 ms
[2023-03-15 03:49:54] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
[2023-03-15 03:49:54] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
[2023-03-15 03:49:54] [INFO ] Invariant cache hit.
[2023-03-15 03:49:54] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-15 03:49:54] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
[2023-03-15 03:49:54] [INFO ] Invariant cache hit.
[2023-03-15 03:49:55] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:50:15] [INFO ] Implicit Places using invariants and state equation in 20547 ms returned []
Implicit Place search using SMT with State Equation took 21117 ms to find 0 implicit places.
[2023-03-15 03:50:15] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
[2023-03-15 03:50:15] [INFO ] Invariant cache hit.
[2023-03-15 03:50:16] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 856/860 places, 1784/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22520 ms. Remains : 856/860 places, 1784/1784 transitions.
Stuttering acceptance computed with spot in 215 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s197 1) (GEQ s204 1)) (AND (GEQ s196 1) (GEQ s204 1)) (AND (GEQ s192 1) (GEQ s204 1)) (AND (GEQ s193 1) (GEQ s204 1)) (AND (GEQ s194 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 729 ms.
Product exploration explored 100000 steps with 50000 reset in 819 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 (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-06 finished in 24431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U G(!p1))||X(F((G(p2)||(X(p2)&&p3))))))'
Support contains 87 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Applied a total of 24 rules in 29 ms. Remains 846 /860 variables (removed 14) and now considering 1774/1784 (removed 10) transitions.
[2023-03-15 03:50:18] [INFO ] Flow matrix only has 1734 transitions (discarded 40 similar events)
// Phase 1: matrix 1734 rows 846 cols
[2023-03-15 03:50:18] [INFO ] Computed 44 place invariants in 29 ms
[2023-03-15 03:50:18] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
[2023-03-15 03:50:18] [INFO ] Flow matrix only has 1734 transitions (discarded 40 similar events)
[2023-03-15 03:50:18] [INFO ] Invariant cache hit.
[2023-03-15 03:50:19] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-15 03:50:19] [INFO ] Flow matrix only has 1734 transitions (discarded 40 similar events)
[2023-03-15 03:50:19] [INFO ] Invariant cache hit.
[2023-03-15 03:50:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:50:22] [INFO ] Implicit Places using invariants and state equation in 3549 ms returned []
Implicit Place search using SMT with State Equation took 4032 ms to find 0 implicit places.
[2023-03-15 03:50:22] [INFO ] Flow matrix only has 1734 transitions (discarded 40 similar events)
[2023-03-15 03:50:22] [INFO ] Invariant cache hit.
[2023-03-15 03:50:23] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 846/860 places, 1774/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5429 ms. Remains : 846/860 places, 1774/1784 transitions.
Stuttering acceptance computed with spot in 475 ms :[(AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0 p3), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 9}, { cond=(AND p1 p2 p3), acceptance={0} source=2 dest: 9}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=2 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={0, 1} source=2 dest: 9}, { cond=(AND p1 p3), acceptance={} source=2 dest: 10}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p3), acceptance={} source=3 dest: 7}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={1} source=9 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=9 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={0, 1} source=9 dest: 9}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=9 dest: 10}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=10 dest: 4}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=10 dest: 7}]], initial=0, aps=[p1:(OR (AND (GEQ s387 1) (GEQ s650 1) (GEQ s666 1)) (AND (GEQ s387 1) (GEQ s650 1) (GEQ s665 1)) (AND (GEQ s387 1) (GEQ s650 1) (GEQ s664 1)) (AND (GEQ s3...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 40008 reset in 2002 ms.
Product exploration explored 100000 steps with 39953 reset in 2016 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND p1 p2 p3)), (X (NOT (AND p1 (NOT p2) p3))), (X (AND p1 p3)), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 p3))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p1 (NOT p0) p3))), (X (X (NOT (AND p1 (NOT p0) p3))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) p3 p2)
Knowledge based reduction with 49 factoid took 2420 ms. Reduced automaton from 11 states, 49 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-09 finished in 12396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 66 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 41 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 03:50:30] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
// Phase 1: matrix 1724 rows 836 cols
[2023-03-15 03:50:30] [INFO ] Computed 44 place invariants in 28 ms
[2023-03-15 03:50:31] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
[2023-03-15 03:50:31] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:50:31] [INFO ] Invariant cache hit.
[2023-03-15 03:50:31] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-15 03:50:31] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:50:31] [INFO ] Invariant cache hit.
[2023-03-15 03:50:32] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:52:14] [INFO ] Performed 624/836 implicitness test of which 0 returned IMPLICIT in 101 seconds.
[2023-03-15 03:52:17] [INFO ] Implicit Places using invariants and state equation in 105955 ms returned []
Implicit Place search using SMT with State Equation took 106474 ms to find 0 implicit places.
[2023-03-15 03:52:17] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:52:17] [INFO ] Invariant cache hit.
[2023-03-15 03:52:18] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107930 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s108 1) (GEQ s287 1)) (AND (GEQ s127 1) (GEQ s287 1)) (AND (GEQ s137 1) (GEQ s287 1)) (AND (GEQ s118 1) (GEQ s287 1)) (AND (GEQ s99 1) (G...], 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]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-10 finished in 108066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&G(F(p2))))'
Support contains 33 out of 860 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 856 transition count 1734
Reduce places removed 50 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 70 rules applied. Total rules applied 120 place count 806 transition count 1714
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 140 place count 786 transition count 1714
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 140 place count 786 transition count 1604
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 360 place count 676 transition count 1604
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 370 place count 666 transition count 1594
Iterating global reduction 3 with 10 rules applied. Total rules applied 380 place count 666 transition count 1594
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 440 place count 636 transition count 1564
Applied a total of 440 rules in 77 ms. Remains 636 /860 variables (removed 224) and now considering 1564/1784 (removed 220) transitions.
[2023-03-15 03:52:18] [INFO ] Flow matrix only has 1524 transitions (discarded 40 similar events)
// Phase 1: matrix 1524 rows 636 cols
[2023-03-15 03:52:18] [INFO ] Computed 44 place invariants in 23 ms
[2023-03-15 03:52:19] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
[2023-03-15 03:52:19] [INFO ] Flow matrix only has 1524 transitions (discarded 40 similar events)
[2023-03-15 03:52:19] [INFO ] Invariant cache hit.
[2023-03-15 03:52:19] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-15 03:52:19] [INFO ] Flow matrix only has 1524 transitions (discarded 40 similar events)
[2023-03-15 03:52:19] [INFO ] Invariant cache hit.
[2023-03-15 03:52:20] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:52:32] [INFO ] Implicit Places using invariants and state equation in 12717 ms returned []
Implicit Place search using SMT with State Equation took 13178 ms to find 0 implicit places.
[2023-03-15 03:52:32] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 03:52:32] [INFO ] Flow matrix only has 1524 transitions (discarded 40 similar events)
[2023-03-15 03:52:32] [INFO ] Invariant cache hit.
[2023-03-15 03:52:33] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 636/860 places, 1564/1784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14544 ms. Remains : 636/860 places, 1564/1784 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s409 1) (GEQ s414 1)) (AND (GEQ s409 1) (GEQ s413 1)) (AND (GEQ s409 1) (GEQ s422 1)) (AND (GEQ s409 1) (GEQ s421 1)) (AND (GEQ s409 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6366 steps with 178 reset in 29 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-11 finished in 14857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&G(p1)&&X(p2)) U p3)))'
Support contains 93 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 36 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 03:52:33] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
// Phase 1: matrix 1724 rows 836 cols
[2023-03-15 03:52:33] [INFO ] Computed 44 place invariants in 29 ms
[2023-03-15 03:52:34] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
[2023-03-15 03:52:34] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:52:34] [INFO ] Invariant cache hit.
[2023-03-15 03:52:34] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-15 03:52:34] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:52:34] [INFO ] Invariant cache hit.
[2023-03-15 03:52:35] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:52:54] [INFO ] Implicit Places using invariants and state equation in 19993 ms returned []
Implicit Place search using SMT with State Equation took 20486 ms to find 0 implicit places.
[2023-03-15 03:52:54] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:52:54] [INFO ] Invariant cache hit.
[2023-03-15 03:52:55] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21859 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p3), (OR (NOT p1) (NOT p3) (NOT p2)), true, (NOT p3)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p3) p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (AND (GEQ s152 1) (GEQ s172 1)) (AND (GEQ s156 1) (GEQ s176 1)) (AND (GEQ s157 1) (GEQ s177 1)) (AND (GEQ s160 1) (GEQ s180 1)) (AND (GEQ s161 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-12 finished in 22095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 42 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 36 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 03:52:55] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:52:55] [INFO ] Invariant cache hit.
[2023-03-15 03:52:56] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
[2023-03-15 03:52:56] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:52:56] [INFO ] Invariant cache hit.
[2023-03-15 03:52:56] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-15 03:52:56] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:52:56] [INFO ] Invariant cache hit.
[2023-03-15 03:52:57] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:53:19] [INFO ] Implicit Places using invariants and state equation in 22364 ms returned []
Implicit Place search using SMT with State Equation took 22891 ms to find 0 implicit places.
[2023-03-15 03:53:19] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:19] [INFO ] Invariant cache hit.
[2023-03-15 03:53:19] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24290 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s204 1) (GEQ s205 1) (GEQ s257 1)) (AND (GEQ s204 1) (GEQ s205 1) (GEQ s258 1)) (AND (GEQ s204 1) (GEQ s205 1) (GEQ s255 1)) (AND (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-13 finished in 24391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(F(!p0))||(!p1 U (p2||G(!p1)))))||(X((X(F(!p0))||(!p1 U (p2||G(!p1)))))&&G(p3)))))'
Support contains 55 out of 860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 39 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 03:53:19] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:19] [INFO ] Invariant cache hit.
[2023-03-15 03:53:20] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
[2023-03-15 03:53:20] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:20] [INFO ] Invariant cache hit.
[2023-03-15 03:53:21] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-15 03:53:21] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:21] [INFO ] Invariant cache hit.
[2023-03-15 03:53:21] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:53:35] [INFO ] Implicit Places using invariants and state equation in 14491 ms returned []
Implicit Place search using SMT with State Equation took 14999 ms to find 0 implicit places.
[2023-03-15 03:53:35] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:35] [INFO ] Invariant cache hit.
[2023-03-15 03:53:36] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16359 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 526 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p3) (NOT p2) p1 p0), (AND (NOT p3) (NOT p2) p0 p1), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p1 p0 (NOT p3)), (AND (NOT p2) p1 p0 (NOT p3))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=0 dest: 3}, { cond=p3, acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=3 dest: 3}], [{ cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=4 dest: 8}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=5 dest: 8}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=6 dest: 8}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=6 dest: 10}], [{ cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=7 dest: 8}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=7 dest: 9}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=7 dest: 10}], [{ cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={0} source=8 dest: 6}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0, 1} source=8 dest: 6}, { cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=8 dest: 8}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=8 dest: 10}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=8 dest: 10}], [{ cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=9 dest: 8}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=9 dest: 9}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=9 dest: 10}], [{ cond=(OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0, 1} source=10 dest: 8}, { cond=(OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)), acceptance={} source=10 dest: 10}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={1} source=10 dest: 10}]], initial=0, aps=[p3:(AND (LT s598 2) (LT s597 2) (LT s600 2) (LT s599 2) (LT s602 2) (LT s601 2) (LT s603 2) (LT s594 2) (LT s596 2) (LT s595 2)), p2:(AND (NOT (OR (AND (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 191 reset in 644 ms.
Product exploration explored 100000 steps with 216 reset in 666 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 p3 p2 (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)))), (X (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (X p3), (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p3 p2 p0) (AND p3 (NOT p1) p0))))), (X (X p3)), (X (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))))]
Knowledge based reduction with 17 factoid took 1160 ms. Reduced automaton from 11 states, 52 edges and 4 AP (stutter sensitive) to 11 states, 52 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 492 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p3) p1 (NOT p2) p0), (AND (NOT p3) p1 p0 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2) p0 (NOT p3)), (AND p1 (NOT p2) p0 (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 03:53:40] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:40] [INFO ] Invariant cache hit.
[2023-03-15 03:53:41] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 03:53:41] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 33 ms returned sat
[2023-03-15 03:53:41] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-15 03:53:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 03:53:41] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 30 ms returned sat
[2023-03-15 03:53:41] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p3 p2 (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (OR (AND p3 p2 p0) (AND p3 (NOT p1) p0)))), (X (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (X p3), (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p3 p2 p0) (AND p3 (NOT p1) p0))))), (X (X p3)), (X (X (NOT (OR (AND (NOT p3) p2 p0) (AND (NOT p3) (NOT p1) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (G (NOT (OR (AND (NOT p1) p0 (NOT p3)) (AND p2 p0 (NOT p3))))), (G (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p2) p0 p3))), (G (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(X (X (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (F (OR (AND (NOT p1) p0 p3) (AND p2 p0 p3))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0) p3))), (F (NOT p3)), (F (AND p1 (NOT p2) (NOT p0) p3))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 (NOT p2) p0 (NOT p3))))
Knowledge based reduction with 22 factoid took 1097 ms. Reduced automaton from 11 states, 52 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-14 finished in 22706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G((p1||(!p0&&F(p2))))))))'
Support contains 85 out of 860 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 860/860 places, 1784/1784 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 856 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 846 transition count 1774
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 846 transition count 1774
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 836 transition count 1764
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 836 transition count 1764
Applied a total of 44 rules in 39 ms. Remains 836 /860 variables (removed 24) and now considering 1764/1784 (removed 20) transitions.
[2023-03-15 03:53:42] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:42] [INFO ] Invariant cache hit.
[2023-03-15 03:53:43] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
[2023-03-15 03:53:43] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:43] [INFO ] Invariant cache hit.
[2023-03-15 03:53:43] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-15 03:53:43] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:43] [INFO ] Invariant cache hit.
[2023-03-15 03:53:44] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 03:53:57] [INFO ] Implicit Places using invariants and state equation in 14171 ms returned []
Implicit Place search using SMT with State Equation took 14625 ms to find 0 implicit places.
[2023-03-15 03:53:57] [INFO ] Flow matrix only has 1724 transitions (discarded 40 similar events)
[2023-03-15 03:53:57] [INFO ] Invariant cache hit.
[2023-03-15 03:53:58] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/860 places, 1764/1784 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16104 ms. Remains : 836/860 places, 1764/1784 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S04J04T10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s563 6) (LT s573 1) (LT s666 1) (LT s667 3)) (OR (LT s563 6) (LT s565 1) (LT s664 1) (LT s665 1) (LT s667 2)) (OR (LT s563 6) (LT s568 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S04J04T10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T10-LTLFireability-15 finished in 16262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p0)&&F(p1))))))'
[2023-03-15 03:53:59] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14191194477256785557
[2023-03-15 03:53:59] [INFO ] Too many transitions (1784) to apply POR reductions. Disabling POR matrices.
[2023-03-15 03:53:59] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14191194477256785557
Running compilation step : cd /tmp/ltsmin14191194477256785557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-15 03:53:59] [INFO ] Applying decomposition
[2023-03-15 03:53:59] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12080124289409506768.txt' '-o' '/tmp/graph12080124289409506768.bin' '-w' '/tmp/graph12080124289409506768.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12080124289409506768.bin' '-l' '-1' '-v' '-w' '/tmp/graph12080124289409506768.weights' '-q' '0' '-e' '0.001'
[2023-03-15 03:53:59] [INFO ] Decomposing Gal with order
[2023-03-15 03:53:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 03:53:59] [INFO ] Removed a total of 1480 redundant transitions.
[2023-03-15 03:53:59] [INFO ] Flatten gal took : 177 ms
[2023-03-15 03:53:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 31 ms.
[2023-03-15 03:53:59] [INFO ] Time to serialize gal into /tmp/LTLFireability9675242374740424482.gal : 15 ms
[2023-03-15 03:53:59] [INFO ] Time to serialize properties into /tmp/LTLFireability14169109522412979289.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9675242374740424482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14169109522412979289.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((((u89.CanInjectEvent_0<1)||(i0.u3.DataOnSrc_0<1))||((i0.u3.PlaceSources_0<1)||(u89.cSources_0<1)))&&(((u89.CanInjectEven...1385
Formula 0 simplified : G(F!"(((((u89.CanInjectEvent_0<1)||(i0.u3.DataOnSrc_0<1))||((i0.u3.PlaceSources_0<1)||(u89.cSources_0<1)))&&(((u89.CanInjectEvent_0<...1373
Compilation finished in 3716 ms.
Running link step : cd /tmp/ltsmin14191194477256785557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14191194477256785557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp0==true))&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-15 04:16:27] [INFO ] Applying decomposition
[2023-03-15 04:16:27] [INFO ] Flatten gal took : 143 ms
[2023-03-15 04:16:28] [INFO ] Decomposing Gal with order
[2023-03-15 04:16:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 04:16:28] [INFO ] Removed a total of 5327 redundant transitions.
[2023-03-15 04:16:28] [INFO ] Flatten gal took : 303 ms
[2023-03-15 04:16:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 75 ms.
[2023-03-15 04:16:28] [INFO ] Time to serialize gal into /tmp/LTLFireability2695222224218370045.gal : 25 ms
[2023-03-15 04:16:28] [INFO ] Time to serialize properties into /tmp/LTLFireability15165317162849972277.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2695222224218370045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15165317162849972277.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((((CanInjectEvent.CanInjectEvent_0<1)||(Sources0.DataOnSrc_0<1))||((Sources0.PlaceSources_0<1)||(cSources.cSources_0<1)))...1547
Formula 0 simplified : G(F!"(((((CanInjectEvent.CanInjectEvent_0<1)||(Sources0.DataOnSrc_0<1))||((Sources0.PlaceSources_0<1)||(cSources.cSources_0<1)))&&((...1535
Detected timeout of ITS tools.
[2023-03-15 04:38:57] [INFO ] Flatten gal took : 223 ms
[2023-03-15 04:38:58] [INFO ] Input system was already deterministic with 1784 transitions.
[2023-03-15 04:38:58] [INFO ] Transformed 860 places.
[2023-03-15 04:38:58] [INFO ] Transformed 1784 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 04:39:28] [INFO ] Time to serialize gal into /tmp/LTLFireability14890161023451831849.gal : 16 ms
[2023-03-15 04:39:28] [INFO ] Time to serialize properties into /tmp/LTLFireability9449673824734627700.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14890161023451831849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9449673824734627700.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((G("(((((CanInjectEvent_0<1)||(DataOnSrc_0<1))||((PlaceSources_0<1)||(cSources_0<1)))&&(((CanInjectEvent_0<1)||(DataOnSrc_1<1))...1031
Formula 0 simplified : G(F!"(((((CanInjectEvent_0<1)||(DataOnSrc_0<1))||((PlaceSources_0<1)||(cSources_0<1)))&&(((CanInjectEvent_0<1)||(DataOnSrc_1<1))||((...1019
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9416608 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16184720 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S04J04T10"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S04J04T10, 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 r293-tall-167873945400412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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