Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602600084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FlexibleBarrier-PT-14a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602600084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 10:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 13 10:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 10:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 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 FlexibleBarrier-PT-14a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-14a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717182718218

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:11:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:11:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:11:59] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-31 19:11:59] [INFO ] Transformed 171 places.
[2024-05-31 19:11:59] [INFO ] Transformed 578 transitions.
[2024-05-31 19:11:59] [INFO ] Found NUPN structural information;
[2024-05-31 19:11:59] [INFO ] Parsed PT model containing 171 places and 578 transitions and 2719 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 408/408 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 171 transition count 394
Applied a total of 14 rules in 36 ms. Remains 171 /171 variables (removed 0) and now considering 394/408 (removed 14) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-31 19:11:59] [INFO ] Computed 16 invariants in 17 ms
[2024-05-31 19:11:59] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-31 19:11:59] [INFO ] Invariant cache hit.
[2024-05-31 19:12:00] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-31 19:12:00] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-31 19:12:00] [INFO ] Invariant cache hit.
[2024-05-31 19:12:00] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 15593 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14556 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 30461ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 30488ms
Starting structural reductions in LTL mode, iteration 1 : 171/171 places, 394/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31086 ms. Remains : 171/171 places, 394/408 transitions.
Support contains 30 out of 171 places after structural reductions.
[2024-05-31 19:12:30] [INFO ] Flatten gal took : 45 ms
[2024-05-31 19:12:30] [INFO ] Flatten gal took : 22 ms
[2024-05-31 19:12:31] [INFO ] Input system was already deterministic with 394 transitions.
Support contains 29 out of 171 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 26
RANDOM walk for 14030 steps (2 resets) in 379 ms. (36 steps per ms) remains 0/26 properties
FORMULA FlexibleBarrier-PT-14a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 129 edges and 171 vertex of which 30 / 171 are part of one of the 10 SCC in 2 ms
Free SCC test removed 20 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 85 place count 109 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 115 transitions
Redundant transition composition rules discarded 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 200 place count 109 transition count 172
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 202 place count 109 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 204 place count 107 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 206 place count 107 transition count 170
Applied a total of 206 rules in 69 ms. Remains 107 /171 variables (removed 64) and now considering 170/394 (removed 224) transitions.
[2024-05-31 19:12:31] [INFO ] Flow matrix only has 147 transitions (discarded 23 similar events)
// Phase 1: matrix 147 rows 107 cols
[2024-05-31 19:12:31] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:12:31] [INFO ] Implicit Places using invariants in 85 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/171 places, 170/394 transitions.
Graph (trivial) has 134 edges and 106 vertex of which 30 / 106 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 86 transition count 117
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 73 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 72 transition count 116
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 29 place count 72 transition count 102
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 57 place count 58 transition count 102
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 91 place count 41 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 105 place count 41 transition count 71
Applied a total of 105 rules in 13 ms. Remains 41 /106 variables (removed 65) and now considering 71/170 (removed 99) transitions.
[2024-05-31 19:12:31] [INFO ] Flow matrix only has 54 transitions (discarded 17 similar events)
// Phase 1: matrix 54 rows 41 cols
[2024-05-31 19:12:31] [INFO ] Computed 15 invariants in 0 ms
[2024-05-31 19:12:31] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 19:12:31] [INFO ] Flow matrix only has 54 transitions (discarded 17 similar events)
[2024-05-31 19:12:31] [INFO ] Invariant cache hit.
[2024-05-31 19:12:31] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 19:12:31] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/171 places, 71/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 41/171 places, 71/394 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-00 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F((X(p0)&&p1))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-31 19:12:32] [INFO ] Computed 16 invariants in 3 ms
[2024-05-31 19:12:32] [INFO ] Implicit Places using invariants in 92 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-01
Product exploration explored 100000 steps with 588 reset in 478 ms.
Stack based approach found an accepted trace after 71 steps with 1 reset with depth 26 and stack size 26 in 1 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-01 finished in 785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-31 19:12:32] [INFO ] Invariant cache hit.
[2024-05-31 19:12:32] [INFO ] Implicit Places using invariants in 132 ms returned [169, 170]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 142 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 169/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-02 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1||(p2&&X(G(p1)))))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-31 19:12:33] [INFO ] Invariant cache hit.
[2024-05-31 19:12:33] [INFO ] Implicit Places using invariants in 82 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-04
Product exploration explored 100000 steps with 396 reset in 382 ms.
Stack based approach found an accepted trace after 110 steps with 0 reset with depth 111 and stack size 111 in 1 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-04 finished in 787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G((p1&&X(p2)))))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-31 19:12:33] [INFO ] Invariant cache hit.
[2024-05-31 19:12:33] [INFO ] Implicit Places using invariants in 80 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1035 steps with 0 reset in 9 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-05 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((F(!p0)||X(p1)) U X(p2))))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-31 19:12:34] [INFO ] Invariant cache hit.
[2024-05-31 19:12:34] [INFO ] Implicit Places using invariants in 82 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) (NOT p1)), p0]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-06
Product exploration explored 100000 steps with 3102 reset in 459 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-06 finished in 759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 135 edges and 171 vertex of which 36 / 171 are part of one of the 12 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 85 place count 105 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 0 with 102 rules applied. Total rules applied 187 place count 105 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 187 place count 105 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 189 place count 104 transition count 159
Applied a total of 189 rules in 26 ms. Remains 104 /171 variables (removed 67) and now considering 159/394 (removed 235) transitions.
[2024-05-31 19:12:35] [INFO ] Flow matrix only has 134 transitions (discarded 25 similar events)
// Phase 1: matrix 134 rows 104 cols
[2024-05-31 19:12:35] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:12:35] [INFO ] Implicit Places using invariants in 84 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/171 places, 159/394 transitions.
Graph (trivial) has 137 edges and 103 vertex of which 36 / 103 are part of one of the 12 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 79 transition count 97
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 65 transition count 97
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29 place count 65 transition count 83
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 57 place count 51 transition count 83
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 89 place count 35 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 35 transition count 54
Applied a total of 102 rules in 7 ms. Remains 35 /103 variables (removed 68) and now considering 54/159 (removed 105) transitions.
[2024-05-31 19:12:35] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
// Phase 1: matrix 39 rows 35 cols
[2024-05-31 19:12:35] [INFO ] Computed 15 invariants in 1 ms
[2024-05-31 19:12:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 19:12:35] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-31 19:12:35] [INFO ] Invariant cache hit.
[2024-05-31 19:12:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-31 19:12:35] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/171 places, 54/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 35/171 places, 54/394 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-07 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(!p0))) U (p1||G(p0)))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-31 19:12:35] [INFO ] Computed 16 invariants in 3 ms
[2024-05-31 19:12:35] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 19:12:35] [INFO ] Invariant cache hit.
[2024-05-31 19:12:35] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-31 19:12:35] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-31 19:12:35] [INFO ] Invariant cache hit.
[2024-05-31 19:12:35] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 611 constraints, problems are : Problem set: 0 solved, 393 unsolved in 15070 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/171 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/565 variables, 171/358 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 253/611 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 393/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 1004 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14343 ms.
Refiners :[Domain max(s): 171/171 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 171/171 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 29616ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 29622ms
Finished structural reductions in LTL mode , in 1 iterations and 29901 ms. Remains : 171/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 285 ms :[p0, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-09
Product exploration explored 100000 steps with 769 reset in 395 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-09 finished in 30608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((p1 U (p2||G(p1))))))))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 127 edges and 171 vertex of which 27 / 171 are part of one of the 9 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 112 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 117 transitions
Redundant transition composition rules discarded 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 200 place count 112 transition count 182
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 203 place count 112 transition count 182
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 206 place count 109 transition count 179
Iterating global reduction 0 with 3 rules applied. Total rules applied 209 place count 109 transition count 179
Applied a total of 209 rules in 30 ms. Remains 109 /171 variables (removed 62) and now considering 179/394 (removed 215) transitions.
[2024-05-31 19:13:05] [INFO ] Flow matrix only has 157 transitions (discarded 22 similar events)
// Phase 1: matrix 157 rows 109 cols
[2024-05-31 19:13:05] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:13:05] [INFO ] Implicit Places using invariants in 78 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/171 places, 179/394 transitions.
Graph (trivial) has 136 edges and 108 vertex of which 27 / 108 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 90 transition count 129
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 76 transition count 129
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29 place count 76 transition count 115
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 57 place count 62 transition count 115
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 95 place count 43 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 109 place count 43 transition count 82
Applied a total of 109 rules in 8 ms. Remains 43 /108 variables (removed 65) and now considering 82/179 (removed 97) transitions.
[2024-05-31 19:13:06] [INFO ] Flow matrix only has 64 transitions (discarded 18 similar events)
// Phase 1: matrix 64 rows 43 cols
[2024-05-31 19:13:06] [INFO ] Computed 15 invariants in 0 ms
[2024-05-31 19:13:06] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 19:13:06] [INFO ] Flow matrix only has 64 transitions (discarded 18 similar events)
[2024-05-31 19:13:06] [INFO ] Invariant cache hit.
[2024-05-31 19:13:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 19:13:06] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/171 places, 82/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 43/171 places, 82/394 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-10 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-31 19:13:06] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:13:06] [INFO ] Implicit Places using invariants in 86 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-11 finished in 200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((X(p1)||p0))&&X(F(p2))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2024-05-31 19:13:06] [INFO ] Invariant cache hit.
[2024-05-31 19:13:06] [INFO ] Implicit Places using invariants in 84 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-14
Product exploration explored 100000 steps with 1076 reset in 359 ms.
Product exploration explored 100000 steps with 1123 reset in 386 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 15929 steps (3 resets) in 77 ms. (204 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 170 cols
[2024-05-31 19:13:08] [INFO ] Computed 15 invariants in 3 ms
[2024-05-31 19:13:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 19:13:08] [INFO ] Invariant cache hit.
[2024-05-31 19:13:08] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-05-31 19:13:08] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-31 19:13:08] [INFO ] Invariant cache hit.
[2024-05-31 19:13:08] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 15/184 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/564 variables, 170/355 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 183/538 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/564 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 538 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14229 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 170/170 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 15/184 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/564 variables, 170/355 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 183/538 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 393/931 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/564 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 931 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14295 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 170/170 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 28688ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 28691ms
Finished structural reductions in LTL mode , in 1 iterations and 28869 ms. Remains : 170/170 places, 394/394 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 6289 steps (1 resets) in 36 ms. (169 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 244 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 1136 reset in 363 ms.
Product exploration explored 100000 steps with 1177 reset in 388 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 394/394 transitions.
Graph (trivial) has 202 edges and 170 vertex of which 95 / 170 are part of one of the 14 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 89 transition count 225
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 18 place count 89 transition count 225
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 32 place count 89 transition count 225
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 89 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 87 transition count 224
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 87 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 56 place count 87 transition count 259
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 84 transition count 253
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 84 transition count 253
Deduced a syphon composed of 46 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 143 transitions
Redundant transition composition rules discarded 143 transitions
Iterating global reduction 1 with 143 rules applied. Total rules applied 205 place count 84 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 205 place count 84 transition count 112
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 84 transition count 112
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 219 place count 71 transition count 98
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 232 place count 71 transition count 98
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 232 rules in 27 ms. Remains 71 /170 variables (removed 99) and now considering 98/394 (removed 296) transitions.
[2024-05-31 19:13:39] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-31 19:13:39] [INFO ] Flow matrix only has 83 transitions (discarded 15 similar events)
// Phase 1: matrix 83 rows 71 cols
[2024-05-31 19:13:39] [INFO ] Computed 15 invariants in 1 ms
[2024-05-31 19:13:39] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 5 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-31 19:13:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 14/29 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/29 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 82/153 variables, 71/100 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 29/129 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/129 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 1/154 variables, 1/130 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/130 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/154 variables, 0/130 constraints. Problems are: Problem set: 41 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 130 constraints, problems are : Problem set: 41 solved, 56 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 71/71 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 41 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 35/71 variables, 15/15 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 14/29 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/29 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 82/153 variables, 71/100 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 29/129 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 56/185 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/185 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 1/154 variables, 1/186 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/186 constraints. Problems are: Problem set: 41 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/186 constraints. Problems are: Problem set: 41 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 186 constraints, problems are : Problem set: 41 solved, 56 unsolved in 922 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 71/71 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 56/97 constraints, Known Traps: 14/14 constraints]
After SMT, in 2423ms problems are : Problem set: 41 solved, 56 unsolved
Search for dead transitions found 41 dead transitions in 2425ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) removed 41 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 71/170 places, 57/394 transitions.
Graph (complete) has 107 edges and 71 vertex of which 37 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 37 /71 variables (removed 34) and now considering 57/57 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/170 places, 57/394 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2462 ms. Remains : 37/170 places, 57/394 transitions.
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 170 cols
[2024-05-31 19:13:42] [INFO ] Computed 15 invariants in 3 ms
[2024-05-31 19:13:42] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 19:13:42] [INFO ] Invariant cache hit.
[2024-05-31 19:13:42] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-05-31 19:13:42] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-31 19:13:42] [INFO ] Invariant cache hit.
[2024-05-31 19:13:42] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 15/184 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/564 variables, 170/355 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 183/538 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/564 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 538 constraints, problems are : Problem set: 0 solved, 393 unsolved in 14428 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 170/170 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 15/184 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/564 variables, 170/355 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 183/538 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 393/931 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/564 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 931 constraints, problems are : Problem set: 0 solved, 393 unsolved in 13927 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 170/170 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 28545ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 28550ms
Finished structural reductions in LTL mode , in 1 iterations and 28743 ms. Remains : 170/170 places, 394/394 transitions.
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-14 finished in 64760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2024-05-31 19:14:11] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:14:11] [INFO ] Implicit Places using invariants in 83 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-LTLFireability-15
Product exploration explored 100000 steps with 783 reset in 380 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA FlexibleBarrier-PT-14a-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-14a-LTLFireability-15 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((X(p1)||p0))&&X(F(p2))))))'
[2024-05-31 19:14:11] [INFO ] Flatten gal took : 19 ms
[2024-05-31 19:14:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 19:14:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 171 places, 394 transitions and 1647 arcs took 5 ms.
Total runtime 132483 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FlexibleBarrier-PT-14a-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717182852043

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FlexibleBarrier-PT-14a-LTLFireability-14
ltl formula formula --ltl=/tmp/1143/ltl_0_
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 171 places, 394 transitions and 1647 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.030 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1143/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1143/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1143/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1143/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 172 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 172, there are 442 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~5!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6
pnml2lts-mc( 0/ 4): unique states count: 20
pnml2lts-mc( 0/ 4): unique transitions count: 415
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 3
pnml2lts-mc( 0/ 4): - claim success count: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 571 transitions, fanout: 20.393
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 15.9 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 397 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="FlexibleBarrier-PT-14a"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-14a, 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 r496-tall-171640602600084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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