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.r297-tall-167873950600564.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 ltsminxred
Input is PolyORBLF-PT-S04J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950600564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 13K Feb 26 14:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 14:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 14:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 145K Feb 26 14:15 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 8.8K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Feb 26 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 77K Feb 26 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 371K Feb 26 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.6M 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-PT-S04J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679568328406

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 10:45:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 10:45:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 10:45:30] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-03-23 10:45:30] [INFO ] Transformed 618 places.
[2023-03-23 10:45:30] [INFO ] Transformed 3190 transitions.
[2023-03-23 10:45:30] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 172 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Applied a total of 4 rules in 82 ms. Remains 614 /618 variables (removed 4) and now considering 1564/1564 (removed 0) transitions.
[2023-03-23 10:45:31] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 614 cols
[2023-03-23 10:45:31] [INFO ] Computed 50 place invariants in 93 ms
[2023-03-23 10:45:32] [INFO ] Dead Transitions using invariants and state equation in 1809 ms found 324 transitions.
Found 324 dead transitions using SMT.
Drop transitions removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
[2023-03-23 10:45:32] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
// Phase 1: matrix 1216 rows 614 cols
[2023-03-23 10:45:32] [INFO ] Computed 50 place invariants in 30 ms
[2023-03-23 10:45:33] [INFO ] Implicit Places using invariants in 510 ms returned [135, 201, 330, 365, 487, 556]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 525 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/618 places, 1240/1564 transitions.
Applied a total of 0 rules in 15 ms. Remains 608 /608 variables (removed 0) and now considering 1240/1240 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2463 ms. Remains : 608/618 places, 1240/1564 transitions.
Support contains 172 out of 608 places after structural reductions.
[2023-03-23 10:45:33] [INFO ] Flatten gal took : 130 ms
[2023-03-23 10:45:33] [INFO ] Flatten gal took : 94 ms
[2023-03-23 10:45:34] [INFO ] Input system was already deterministic with 1240 transitions.
Support contains 171 out of 608 places (down from 172) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 30) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2023-03-23 10:45:35] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
// Phase 1: matrix 1216 rows 608 cols
[2023-03-23 10:45:35] [INFO ] Computed 44 place invariants in 33 ms
[2023-03-23 10:45:35] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 10:45:35] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 33 ms returned sat
[2023-03-23 10:45:35] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-23 10:45:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-23 10:45:35] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 38 ms returned sat
[2023-03-23 10:46:00] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 608 transition count 1186
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 554 transition count 1186
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 554 transition count 1114
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 482 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 479 transition count 1111
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 479 transition count 1111
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 374 place count 421 transition count 1053
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 386 place count 421 transition count 1041
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 398 place count 409 transition count 1041
Applied a total of 398 rules in 182 ms. Remains 409 /608 variables (removed 199) and now considering 1041/1240 (removed 199) transitions.
[2023-03-23 10:46:00] [INFO ] Flow matrix only has 1017 transitions (discarded 24 similar events)
// Phase 1: matrix 1017 rows 409 cols
[2023-03-23 10:46:00] [INFO ] Computed 44 place invariants in 22 ms
[2023-03-23 10:46:01] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1003 ms. Remains : 409/608 places, 1041/1240 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 208711 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208711 steps, saw 146865 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:46:04] [INFO ] Flow matrix only has 1017 transitions (discarded 24 similar events)
[2023-03-23 10:46:04] [INFO ] Invariant cache hit.
[2023-03-23 10:46:04] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-23 10:46:04] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 26 ms returned sat
[2023-03-23 10:46:04] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:46:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-23 10:46:05] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-23 10:46:07] [INFO ] After 2294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:46:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:46:09] [INFO ] After 1749ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:46:09] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 6 ms to minimize.
[2023-03-23 10:46:09] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2023-03-23 10:46:09] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2023-03-23 10:46:10] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2023-03-23 10:46:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1335 ms
[2023-03-23 10:46:10] [INFO ] After 3120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 425 ms.
[2023-03-23 10:46:10] [INFO ] After 5963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 1041/1041 transitions.
Applied a total of 0 rules in 25 ms. Remains 409 /409 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 409/409 places, 1041/1041 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 1041/1041 transitions.
Applied a total of 0 rules in 41 ms. Remains 409 /409 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2023-03-23 10:46:10] [INFO ] Flow matrix only has 1017 transitions (discarded 24 similar events)
[2023-03-23 10:46:10] [INFO ] Invariant cache hit.
[2023-03-23 10:46:11] [INFO ] Implicit Places using invariants in 623 ms returned []
[2023-03-23 10:46:11] [INFO ] Flow matrix only has 1017 transitions (discarded 24 similar events)
[2023-03-23 10:46:11] [INFO ] Invariant cache hit.
[2023-03-23 10:46:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:46:26] [INFO ] Implicit Places using invariants and state equation in 14826 ms returned []
Implicit Place search using SMT with State Equation took 15454 ms to find 0 implicit places.
[2023-03-23 10:46:26] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-23 10:46:26] [INFO ] Flow matrix only has 1017 transitions (discarded 24 similar events)
[2023-03-23 10:46:26] [INFO ] Invariant cache hit.
[2023-03-23 10:46:27] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16448 ms. Remains : 409/409 places, 1041/1041 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 409 transition count 1017
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 404 transition count 1067
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 78 place count 404 transition count 1023
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 404 transition count 1017
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 398 transition count 1017
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 398 transition count 1006
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 112 place count 387 transition count 1006
Applied a total of 112 rules in 117 ms. Remains 387 /409 variables (removed 22) and now considering 1006/1041 (removed 35) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1006 rows 387 cols
[2023-03-23 10:46:27] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-23 10:46:27] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-23 10:46:27] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-23 10:46:27] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:46:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-23 10:46:27] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 26 ms returned sat
[2023-03-23 10:46:30] [INFO ] After 3145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:46:31] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2023-03-23 10:46:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-23 10:46:31] [INFO ] After 3367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-23 10:46:31] [INFO ] After 3818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U p1))'
Support contains 18 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 608 transition count 1210
Reduce places removed 30 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 42 rules applied. Total rules applied 72 place count 578 transition count 1198
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 84 place count 566 transition count 1198
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 84 place count 566 transition count 1126
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 228 place count 494 transition count 1126
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 336 place count 440 transition count 1072
Applied a total of 336 rules in 73 ms. Remains 440 /608 variables (removed 168) and now considering 1072/1240 (removed 168) transitions.
[2023-03-23 10:46:31] [INFO ] Flow matrix only has 1048 transitions (discarded 24 similar events)
// Phase 1: matrix 1048 rows 440 cols
[2023-03-23 10:46:31] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-23 10:46:32] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
[2023-03-23 10:46:32] [INFO ] Flow matrix only has 1048 transitions (discarded 24 similar events)
[2023-03-23 10:46:32] [INFO ] Invariant cache hit.
[2023-03-23 10:46:33] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-23 10:46:33] [INFO ] Flow matrix only has 1048 transitions (discarded 24 similar events)
[2023-03-23 10:46:33] [INFO ] Invariant cache hit.
[2023-03-23 10:46:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:46:40] [INFO ] Implicit Places using invariants and state equation in 7598 ms returned []
Implicit Place search using SMT with State Equation took 8140 ms to find 0 implicit places.
[2023-03-23 10:46:40] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-23 10:46:40] [INFO ] Flow matrix only has 1048 transitions (discarded 24 similar events)
[2023-03-23 10:46:40] [INFO ] Invariant cache hit.
[2023-03-23 10:46:41] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 440/608 places, 1072/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10107 ms. Remains : 440/608 places, 1072/1240 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), p0]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s118 1) (GEQ s312 1) (GEQ s44 1) (GEQ s361 1) (GEQ s12 1) (GEQ s263 1)), p0:(OR (AND (GEQ s138 1) (GEQ s184 1)) (AND (GEQ s27 1) (GEQ s134 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11 reset in 622 ms.
Stack based approach found an accepted trace after 364 steps with 0 reset with depth 365 and stack size 365 in 3 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-01 finished in 11002 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(X(G(p0))))'
Support contains 42 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 45 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-23 10:46:42] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-23 10:46:42] [INFO ] Computed 44 place invariants in 28 ms
[2023-03-23 10:46:44] [INFO ] Dead Transitions using invariants and state equation in 1472 ms found 0 transitions.
[2023-03-23 10:46:44] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:46:44] [INFO ] Invariant cache hit.
[2023-03-23 10:46:44] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-23 10:46:44] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:46:44] [INFO ] Invariant cache hit.
[2023-03-23 10:46:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:46:57] [INFO ] Implicit Places using invariants and state equation in 12195 ms returned []
Implicit Place search using SMT with State Equation took 12841 ms to find 0 implicit places.
[2023-03-23 10:46:57] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:46:57] [INFO ] Invariant cache hit.
[2023-03-23 10:46:58] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15878 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s253 1) (GEQ s564 1) (GEQ s65 1) (GEQ s126 1) (GEQ s192 1) (GEQ s249 1) (GEQ s197 1) (GEQ s555 1) (GEQ s76 1) (GEQ s13 1) (GEQ s16 1) (GEQ s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-02 finished in 16020 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(F(p0)))'
Support contains 13 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Applied a total of 0 rules in 9 ms. Remains 608 /608 variables (removed 0) and now considering 1240/1240 (removed 0) transitions.
[2023-03-23 10:46:58] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
// Phase 1: matrix 1216 rows 608 cols
[2023-03-23 10:46:58] [INFO ] Computed 44 place invariants in 24 ms
[2023-03-23 10:47:00] [INFO ] Dead Transitions using invariants and state equation in 1530 ms found 0 transitions.
[2023-03-23 10:47:00] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
[2023-03-23 10:47:00] [INFO ] Invariant cache hit.
[2023-03-23 10:47:00] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-03-23 10:47:00] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
[2023-03-23 10:47:00] [INFO ] Invariant cache hit.
[2023-03-23 10:47:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:47:14] [INFO ] Implicit Places using invariants and state equation in 13956 ms returned []
Implicit Place search using SMT with State Equation took 14584 ms to find 0 implicit places.
[2023-03-23 10:47:14] [INFO ] Flow matrix only has 1216 transitions (discarded 24 similar events)
[2023-03-23 10:47:14] [INFO ] Invariant cache hit.
[2023-03-23 10:47:16] [INFO ] Dead Transitions using invariants and state equation in 1428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17553 ms. Remains : 608/608 places, 1240/1240 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NOT (OR (GEQ s271 1) (GEQ s130 1) (GEQ s343 1) (GEQ s354 1) (GEQ s541 1) (GEQ s464 1))) (AND (GEQ s425 1) (GEQ s599 1)) (AND (GEQ s509 1) (GEQ s59...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 729 ms.
Product exploration explored 100000 steps with 50000 reset in 654 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-03 finished in 19190 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))||F(p1)))'
Support contains 27 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 24 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-23 10:47:18] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-23 10:47:18] [INFO ] Computed 44 place invariants in 31 ms
[2023-03-23 10:47:19] [INFO ] Dead Transitions using invariants and state equation in 1554 ms found 0 transitions.
[2023-03-23 10:47:19] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:47:19] [INFO ] Invariant cache hit.
[2023-03-23 10:47:20] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-23 10:47:20] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:47:20] [INFO ] Invariant cache hit.
[2023-03-23 10:47:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:47:29] [INFO ] Implicit Places using invariants and state equation in 9583 ms returned []
Implicit Place search using SMT with State Equation took 10186 ms to find 0 implicit places.
[2023-03-23 10:47:29] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:47:29] [INFO ] Invariant cache hit.
[2023-03-23 10:47:31] [INFO ] Dead Transitions using invariants and state equation in 1416 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13187 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s214 9) (GEQ s307 1) (GEQ s379 1)) (AND (GEQ s9 1) (GEQ s214 9) (GEQ s355 1)) (AND (GEQ s214 9) (GEQ s241 1) (GEQ s379 1)) (AND (GEQ s179...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 19905 steps with 4 reset in 117 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-04 finished in 13429 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(X(G(p0))) U (p1&&(p2 U p3))))'
Support contains 62 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 30 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-23 10:47:31] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:47:31] [INFO ] Invariant cache hit.
[2023-03-23 10:47:32] [INFO ] Dead Transitions using invariants and state equation in 1492 ms found 0 transitions.
[2023-03-23 10:47:32] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:47:32] [INFO ] Invariant cache hit.
[2023-03-23 10:47:33] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-23 10:47:33] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:47:33] [INFO ] Invariant cache hit.
[2023-03-23 10:47:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:47:44] [INFO ] Implicit Places using invariants and state equation in 10949 ms returned []
Implicit Place search using SMT with State Equation took 11629 ms to find 0 implicit places.
[2023-03-23 10:47:44] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:47:44] [INFO ] Invariant cache hit.
[2023-03-23 10:47:46] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14681 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (NOT p3), (NOT p0), true, (AND (NOT p0) (NOT p3)), (NOT p3)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s454 1) (GEQ s579 1) (GEQ s295 1) (GEQ s191 1) (GEQ s400 1) (GEQ s574 1)), p3:(OR (AND (GEQ s40 1) (GEQ s498 1)) (AND (GEQ s40 1) (GEQ s95 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 14985 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(p0)))'
Support contains 8 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 608 transition count 1186
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 554 transition count 1186
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 554 transition count 1114
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 482 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 479 transition count 1111
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 479 transition count 1111
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 366 place count 425 transition count 1057
Applied a total of 366 rules in 66 ms. Remains 425 /608 variables (removed 183) and now considering 1057/1240 (removed 183) transitions.
[2023-03-23 10:47:46] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
// Phase 1: matrix 1033 rows 425 cols
[2023-03-23 10:47:46] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-23 10:47:47] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
[2023-03-23 10:47:47] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:47:47] [INFO ] Invariant cache hit.
[2023-03-23 10:47:47] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-23 10:47:47] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:47:47] [INFO ] Invariant cache hit.
[2023-03-23 10:47:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:48:22] [INFO ] Performed 0/425 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2023-03-23 10:48:39] [INFO ] Implicit Places using invariants and state equation in 51139 ms returned []
Implicit Place search using SMT with State Equation took 51656 ms to find 0 implicit places.
[2023-03-23 10:48:39] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-23 10:48:39] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:48:39] [INFO ] Invariant cache hit.
[2023-03-23 10:48:39] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/608 places, 1057/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53503 ms. Remains : 425/608 places, 1057/1240 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s32 1) (GEQ s73 1) (GEQ s367 1)) (AND (GEQ s32 1) (GEQ s73 1) (GEQ s229 1)) (AND (GEQ s32 1) (GEQ s73 1) (GEQ s75 1)) (AND (GEQ s32 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4293 reset in 430 ms.
Product exploration explored 100000 steps with 4307 reset in 477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2023-03-23 10:48:41] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:48:41] [INFO ] Invariant cache hit.
[2023-03-23 10:48:41] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-23 10:48:41] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 63 ms returned sat
[2023-03-23 10:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 10:48:44] [INFO ] [Real]Absence check using state equation in 2991 ms returned sat
[2023-03-23 10:48:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 10:48:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-23 10:48:45] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 38 ms returned sat
[2023-03-23 10:48:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 10:48:47] [INFO ] [Nat]Absence check using state equation in 2393 ms returned sat
[2023-03-23 10:48:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:48:49] [INFO ] [Nat]Added 120 Read/Feed constraints in 1417 ms returned sat
[2023-03-23 10:48:49] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2023-03-23 10:48:49] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2023-03-23 10:48:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2023-03-23 10:48:49] [INFO ] Computed and/alt/rep : 711/4348/693 causal constraints (skipped 336 transitions) in 86 ms.
[2023-03-23 10:48:55] [INFO ] Added : 311 causal constraints over 63 iterations in 5693 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1057/1057 transitions.
Applied a total of 0 rules in 27 ms. Remains 425 /425 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
[2023-03-23 10:48:55] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:48:55] [INFO ] Invariant cache hit.
[2023-03-23 10:48:56] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
[2023-03-23 10:48:56] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:48:56] [INFO ] Invariant cache hit.
[2023-03-23 10:48:56] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-23 10:48:56] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:48:56] [INFO ] Invariant cache hit.
[2023-03-23 10:48:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:49:07] [INFO ] Implicit Places using invariants and state equation in 10951 ms returned []
Implicit Place search using SMT with State Equation took 11494 ms to find 0 implicit places.
[2023-03-23 10:49:07] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-23 10:49:07] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:49:07] [INFO ] Invariant cache hit.
[2023-03-23 10:49:08] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13224 ms. Remains : 425/425 places, 1057/1057 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2023-03-23 10:49:09] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:49:09] [INFO ] Invariant cache hit.
[2023-03-23 10:49:09] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-23 10:49:09] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 65 ms returned sat
[2023-03-23 10:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 10:49:12] [INFO ] [Real]Absence check using state equation in 3068 ms returned sat
[2023-03-23 10:49:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 10:49:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-23 10:49:13] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 49 ms returned sat
[2023-03-23 10:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 10:49:15] [INFO ] [Nat]Absence check using state equation in 2314 ms returned sat
[2023-03-23 10:49:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:49:16] [INFO ] [Nat]Added 120 Read/Feed constraints in 1347 ms returned sat
[2023-03-23 10:49:17] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 0 ms to minimize.
[2023-03-23 10:49:17] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
[2023-03-23 10:49:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2023-03-23 10:49:17] [INFO ] Computed and/alt/rep : 711/4348/693 causal constraints (skipped 336 transitions) in 85 ms.
[2023-03-23 10:49:22] [INFO ] Added : 311 causal constraints over 63 iterations in 5622 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4328 reset in 441 ms.
Product exploration explored 100000 steps with 4282 reset in 438 ms.
Support contains 8 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1057/1057 transitions.
Applied a total of 0 rules in 16 ms. Remains 425 /425 variables (removed 0) and now considering 1057/1057 (removed 0) transitions.
[2023-03-23 10:49:23] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:49:23] [INFO ] Invariant cache hit.
[2023-03-23 10:49:24] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
[2023-03-23 10:49:24] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:49:24] [INFO ] Invariant cache hit.
[2023-03-23 10:49:25] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-23 10:49:25] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:49:25] [INFO ] Invariant cache hit.
[2023-03-23 10:49:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:49:38] [INFO ] Implicit Places using invariants and state equation in 13359 ms returned []
Implicit Place search using SMT with State Equation took 13875 ms to find 0 implicit places.
[2023-03-23 10:49:38] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-23 10:49:38] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:49:38] [INFO ] Invariant cache hit.
[2023-03-23 10:49:39] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15542 ms. Remains : 425/425 places, 1057/1057 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-06 finished in 113212 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(X(X(G(p0)))))'
Support contains 6 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 19 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-23 10:49:39] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-23 10:49:39] [INFO ] Computed 44 place invariants in 27 ms
[2023-03-23 10:49:41] [INFO ] Dead Transitions using invariants and state equation in 1453 ms found 0 transitions.
[2023-03-23 10:49:41] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:49:41] [INFO ] Invariant cache hit.
[2023-03-23 10:49:41] [INFO ] Implicit Places using invariants in 662 ms returned []
[2023-03-23 10:49:41] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:49:41] [INFO ] Invariant cache hit.
[2023-03-23 10:49:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:49:51] [INFO ] Implicit Places using invariants and state equation in 9966 ms returned []
Implicit Place search using SMT with State Equation took 10636 ms to find 0 implicit places.
[2023-03-23 10:49:51] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:49:51] [INFO ] Invariant cache hit.
[2023-03-23 10:49:53] [INFO ] Dead Transitions using invariants and state equation in 1541 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13652 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s142 1) (GEQ s34 1) (GEQ s519 1) (GEQ s129 1) (GEQ s415 1) (GEQ s378 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-07 finished in 13806 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||F((G(p2)&&p1)))))'
Support contains 11 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 608 transition count 1202
Reduce places removed 38 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 45 rules applied. Total rules applied 83 place count 570 transition count 1195
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 90 place count 563 transition count 1195
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 90 place count 563 transition count 1116
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 248 place count 484 transition count 1116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 480 transition count 1112
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 480 transition count 1112
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 326 place count 445 transition count 1077
Applied a total of 326 rules in 59 ms. Remains 445 /608 variables (removed 163) and now considering 1077/1240 (removed 163) transitions.
[2023-03-23 10:49:53] [INFO ] Flow matrix only has 1053 transitions (discarded 24 similar events)
// Phase 1: matrix 1053 rows 445 cols
[2023-03-23 10:49:53] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-23 10:49:54] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
[2023-03-23 10:49:54] [INFO ] Flow matrix only has 1053 transitions (discarded 24 similar events)
[2023-03-23 10:49:54] [INFO ] Invariant cache hit.
[2023-03-23 10:49:54] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-23 10:49:54] [INFO ] Flow matrix only has 1053 transitions (discarded 24 similar events)
[2023-03-23 10:49:54] [INFO ] Invariant cache hit.
[2023-03-23 10:49:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:50:09] [INFO ] Implicit Places using invariants and state equation in 14403 ms returned []
Implicit Place search using SMT with State Equation took 14918 ms to find 0 implicit places.
[2023-03-23 10:50:09] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-23 10:50:09] [INFO ] Flow matrix only has 1053 transitions (discarded 24 similar events)
[2023-03-23 10:50:09] [INFO ] Invariant cache hit.
[2023-03-23 10:50:10] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 445/608 places, 1077/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16784 ms. Remains : 445/608 places, 1077/1240 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s62 1) (GEQ s275 1) (GEQ s305 1)), p1:(AND (GEQ s93 1) (GEQ s169 1)), p2:(AND (OR (LT s18 1) (LT s177 1) (LT s195 1)) (GEQ s81 1) (GEQ s230 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2272 steps with 0 reset in 8 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-08 finished in 16943 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(X(G((((p0 U p1)&&X(!p0)) U X(p2))))))'
Support contains 6 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 25 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-23 10:50:10] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-23 10:50:10] [INFO ] Computed 44 place invariants in 32 ms
[2023-03-23 10:50:11] [INFO ] Dead Transitions using invariants and state equation in 1554 ms found 0 transitions.
[2023-03-23 10:50:11] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:50:11] [INFO ] Invariant cache hit.
[2023-03-23 10:50:12] [INFO ] Implicit Places using invariants in 657 ms returned []
[2023-03-23 10:50:12] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:50:12] [INFO ] Invariant cache hit.
[2023-03-23 10:50:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:50:21] [INFO ] Implicit Places using invariants and state equation in 9044 ms returned []
Implicit Place search using SMT with State Equation took 9703 ms to find 0 implicit places.
[2023-03-23 10:50:21] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:50:21] [INFO ] Invariant cache hit.
[2023-03-23 10:50:23] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12801 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 402 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR p1 p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s417 1) (GEQ s587 1)), p0:(AND (GEQ s141 1) (GEQ s372 1)), p2:(AND (GEQ s321 1) (GEQ s373 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-10 finished in 13232 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)||G(p1)))'
Support contains 5 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 608 transition count 1186
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 554 transition count 1186
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 554 transition count 1114
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 482 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 479 transition count 1111
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 479 transition count 1111
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 376 place count 420 transition count 1052
Applied a total of 376 rules in 53 ms. Remains 420 /608 variables (removed 188) and now considering 1052/1240 (removed 188) transitions.
[2023-03-23 10:50:23] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
// Phase 1: matrix 1028 rows 420 cols
[2023-03-23 10:50:23] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-23 10:50:24] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
[2023-03-23 10:50:24] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2023-03-23 10:50:24] [INFO ] Invariant cache hit.
[2023-03-23 10:50:24] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-23 10:50:24] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2023-03-23 10:50:25] [INFO ] Invariant cache hit.
[2023-03-23 10:50:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:50:32] [INFO ] Implicit Places using invariants and state equation in 7921 ms returned []
Implicit Place search using SMT with State Equation took 8384 ms to find 0 implicit places.
[2023-03-23 10:50:32] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-23 10:50:32] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2023-03-23 10:50:32] [INFO ] Invariant cache hit.
[2023-03-23 10:50:33] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/608 places, 1052/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10201 ms. Remains : 420/608 places, 1052/1240 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s111 1) (GEQ s387 2)), p1:(AND (GEQ s40 1) (GEQ s180 1) (GEQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8814 steps with 38 reset in 37 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-12 finished in 10323 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&&F((p1&&G(p2))))))'
Support contains 7 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 26 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-23 10:50:33] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-23 10:50:33] [INFO ] Computed 44 place invariants in 35 ms
[2023-03-23 10:50:35] [INFO ] Dead Transitions using invariants and state equation in 1559 ms found 0 transitions.
[2023-03-23 10:50:35] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:50:35] [INFO ] Invariant cache hit.
[2023-03-23 10:50:36] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-23 10:50:36] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:50:36] [INFO ] Invariant cache hit.
[2023-03-23 10:50:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:50:45] [INFO ] Implicit Places using invariants and state equation in 9509 ms returned []
Implicit Place search using SMT with State Equation took 10138 ms to find 0 implicit places.
[2023-03-23 10:50:45] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:50:45] [INFO ] Invariant cache hit.
[2023-03-23 10:50:47] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13072 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s402 10) (LT s552 1) (LT s578 1)), p1:(GEQ s43 1), p2:(AND (GEQ s214 9) (GEQ s233 1) (GEQ s355 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 366 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-13 finished in 13287 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(F((p0||G(p1)))))'
Support contains 5 out of 608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1228
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1228
Applied a total of 24 rules in 22 ms. Remains 596 /608 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
[2023-03-23 10:50:47] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:50:47] [INFO ] Invariant cache hit.
[2023-03-23 10:50:48] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
[2023-03-23 10:50:48] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:50:48] [INFO ] Invariant cache hit.
[2023-03-23 10:50:49] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-23 10:50:49] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:50:49] [INFO ] Invariant cache hit.
[2023-03-23 10:50:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:51:03] [INFO ] Implicit Places using invariants and state equation in 14006 ms returned []
Implicit Place search using SMT with State Equation took 14626 ms to find 0 implicit places.
[2023-03-23 10:51:03] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:51:03] [INFO ] Invariant cache hit.
[2023-03-23 10:51:04] [INFO ] Dead Transitions using invariants and state equation in 1500 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/608 places, 1228/1240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17649 ms. Remains : 596/608 places, 1228/1240 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s173 1) (LT s179 1) (LT s214 9)), p0:(AND (GEQ s7 1) (GEQ s448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 33 reset in 377 ms.
Product exploration explored 100000 steps with 38 reset in 356 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 (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Finished Best-First random walk after 5670 steps, including 1 resets, run visited all 2 properties in 21 ms. (steps per millisecond=270 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1228/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 596 /596 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2023-03-23 10:51:06] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:51:06] [INFO ] Invariant cache hit.
[2023-03-23 10:51:08] [INFO ] Dead Transitions using invariants and state equation in 1495 ms found 0 transitions.
[2023-03-23 10:51:08] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:51:08] [INFO ] Invariant cache hit.
[2023-03-23 10:51:08] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-23 10:51:08] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:51:08] [INFO ] Invariant cache hit.
[2023-03-23 10:51:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:51:16] [INFO ] Implicit Places using invariants and state equation in 8247 ms returned []
Implicit Place search using SMT with State Equation took 8862 ms to find 0 implicit places.
[2023-03-23 10:51:16] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:51:16] [INFO ] Invariant cache hit.
[2023-03-23 10:51:18] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11898 ms. Remains : 596/596 places, 1228/1228 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 (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :1
Finished Best-First random walk after 5444 steps, including 1 resets, run visited all 1 properties in 14 ms. (steps per millisecond=388 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 38 reset in 326 ms.
Product exploration explored 100000 steps with 38 reset in 365 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1228/1228 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1228
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 30 place count 596 transition count 1276
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 66 place count 596 transition count 1276
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 584 transition count 1264
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 584 transition count 1264
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 156 places in 1 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 192 place count 584 transition count 1264
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 213 place count 563 transition count 1243
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 234 place count 563 transition count 1243
Deduced a syphon composed of 138 places in 1 ms
Applied a total of 234 rules in 102 ms. Remains 563 /596 variables (removed 33) and now considering 1243/1228 (removed -15) transitions.
[2023-03-23 10:51:20] [INFO ] Flow matrix only has 1219 transitions (discarded 24 similar events)
// Phase 1: matrix 1219 rows 563 cols
[2023-03-23 10:51:20] [INFO ] Computed 44 place invariants in 27 ms
[2023-03-23 10:51:21] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
[2023-03-23 10:51:21] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-23 10:51:21] [INFO ] Flow matrix only has 1219 transitions (discarded 24 similar events)
[2023-03-23 10:51:21] [INFO ] Invariant cache hit.
[2023-03-23 10:51:22] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/596 places, 1243/1228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2351 ms. Remains : 563/596 places, 1243/1228 transitions.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1228/1228 transitions.
Applied a total of 0 rules in 18 ms. Remains 596 /596 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2023-03-23 10:51:22] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 596 cols
[2023-03-23 10:51:22] [INFO ] Computed 44 place invariants in 32 ms
[2023-03-23 10:51:24] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
[2023-03-23 10:51:24] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:51:24] [INFO ] Invariant cache hit.
[2023-03-23 10:51:24] [INFO ] Implicit Places using invariants in 625 ms returned []
[2023-03-23 10:51:24] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:51:24] [INFO ] Invariant cache hit.
[2023-03-23 10:51:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:51:36] [INFO ] Implicit Places using invariants and state equation in 11742 ms returned []
Implicit Place search using SMT with State Equation took 12368 ms to find 0 implicit places.
[2023-03-23 10:51:36] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2023-03-23 10:51:36] [INFO ] Invariant cache hit.
[2023-03-23 10:51:37] [INFO ] Dead Transitions using invariants and state equation in 1489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15406 ms. Remains : 596/596 places, 1228/1228 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-14 finished in 50900 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 2 out of 608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 608 transition count 1186
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 554 transition count 1186
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 554 transition count 1114
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 482 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 479 transition count 1111
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 479 transition count 1111
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
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 378 place count 419 transition count 1051
Applied a total of 378 rules in 56 ms. Remains 419 /608 variables (removed 189) and now considering 1051/1240 (removed 189) transitions.
[2023-03-23 10:51:38] [INFO ] Flow matrix only has 1027 transitions (discarded 24 similar events)
// Phase 1: matrix 1027 rows 419 cols
[2023-03-23 10:51:38] [INFO ] Computed 44 place invariants in 23 ms
[2023-03-23 10:51:39] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
[2023-03-23 10:51:39] [INFO ] Flow matrix only has 1027 transitions (discarded 24 similar events)
[2023-03-23 10:51:39] [INFO ] Invariant cache hit.
[2023-03-23 10:51:39] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-23 10:51:39] [INFO ] Flow matrix only has 1027 transitions (discarded 24 similar events)
[2023-03-23 10:51:39] [INFO ] Invariant cache hit.
[2023-03-23 10:51:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:51:46] [INFO ] Implicit Places using invariants and state equation in 6736 ms returned []
Implicit Place search using SMT with State Equation took 7237 ms to find 0 implicit places.
[2023-03-23 10:51:46] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-23 10:51:46] [INFO ] Flow matrix only has 1027 transitions (discarded 24 similar events)
[2023-03-23 10:51:46] [INFO ] Invariant cache hit.
[2023-03-23 10:51:47] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/608 places, 1051/1240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8994 ms. Remains : 419/608 places, 1051/1240 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s66 1) (GEQ s341 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21600 steps with 12 reset in 86 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-15 finished in 9141 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(p0)))'
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(F((p0||G(p1)))))'
Found a Shortening insensitive property : PolyORBLF-PT-S04J06T06-LTLFireability-14
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 608 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 608/608 places, 1240/1240 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 608 transition count 1192
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 560 transition count 1192
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 96 place count 560 transition count 1120
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 240 place count 488 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 243 place count 485 transition count 1117
Iterating global reduction 2 with 3 rules applied. Total rules applied 246 place count 485 transition count 1117
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
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 366 place count 425 transition count 1057
Applied a total of 366 rules in 64 ms. Remains 425 /608 variables (removed 183) and now considering 1057/1240 (removed 183) transitions.
[2023-03-23 10:51:47] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
// Phase 1: matrix 1033 rows 425 cols
[2023-03-23 10:51:47] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-23 10:51:48] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
[2023-03-23 10:51:48] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:51:48] [INFO ] Invariant cache hit.
[2023-03-23 10:51:48] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-23 10:51:48] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:51:48] [INFO ] Invariant cache hit.
[2023-03-23 10:51:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 10:51:58] [INFO ] Implicit Places using invariants and state equation in 9485 ms returned []
Implicit Place search using SMT with State Equation took 10026 ms to find 0 implicit places.
[2023-03-23 10:51:58] [INFO ] Flow matrix only has 1033 transitions (discarded 24 similar events)
[2023-03-23 10:51:58] [INFO ] Invariant cache hit.
[2023-03-23 10:51:59] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 425/608 places, 1057/1240 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11781 ms. Remains : 425/608 places, 1057/1240 transitions.
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s122 1) (LT s125 1) (LT s151 9)), p0:(AND (GEQ s7 1) (GEQ s312 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 64 reset in 418 ms.
Stack based approach found an accepted trace after 93607 steps with 57 reset with depth 2159 and stack size 2159 in 410 ms.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-14 finished in 12770 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-23 10:52:00] [INFO ] Flatten gal took : 62 ms
[2023-03-23 10:52:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-23 10:52:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 608 places, 1240 transitions and 5504 arcs took 9 ms.
Total runtime 389759 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1341/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1341/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-LTLFireability-06
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-LTLFireability-14

BK_STOP 1679568722462

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBLF-PT-S04J06T06-LTLFireability-06
ltl formula formula --ltl=/tmp/1341/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 608 places, 1240 transitions and 5504 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.420 real 0.070 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1341/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1341/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1341/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1341/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55fb800993f4]
1: pnml2lts-mc(+0xa2496) [0x55fb80099496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f74c00c2140]
3: pnml2lts-mc(+0x405be5) [0x55fb803fcbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55fb801623f9]
5: pnml2lts-mc(+0x164ac4) [0x55fb8015bac4]
6: pnml2lts-mc(+0x272e0a) [0x55fb80269e0a]
7: pnml2lts-mc(+0xb61f0) [0x55fb800ad1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f74bff154d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f74bff1567a]
10: pnml2lts-mc(+0xa1581) [0x55fb80098581]
11: pnml2lts-mc(+0xa1910) [0x55fb80098910]
12: pnml2lts-mc(+0xa32a2) [0x55fb8009a2a2]
13: pnml2lts-mc(+0xa50f4) [0x55fb8009c0f4]
14: pnml2lts-mc(+0x3f34b3) [0x55fb803ea4b3]
15: pnml2lts-mc(+0x7c63d) [0x55fb8007363d]
16: pnml2lts-mc(+0x67d86) [0x55fb8005ed86]
17: pnml2lts-mc(+0x60a8a) [0x55fb80057a8a]
18: pnml2lts-mc(+0x5eb15) [0x55fb80055b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f74bfefdd0a]
20: pnml2lts-mc(+0x6075e) [0x55fb8005775e]
ltl formula name PolyORBLF-PT-S04J06T06-LTLFireability-14
ltl formula formula --ltl=/tmp/1341/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 608 places, 1240 transitions and 5504 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.060 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1341/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1341/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1341/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1341/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S04J06T06, 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 r297-tall-167873950600564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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