Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717249073212

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:37:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:37:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:37:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:37:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:37:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 743 ms
[2024-06-01 13:37:55] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:37:55] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 13:37:55] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 23 to 21
RANDOM walk for 40000 steps (11 resets) in 1279 ms. (31 steps per ms) remains 4/21 properties
BEST_FIRST walk for 40002 steps (12 resets) in 318 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (11 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
[2024-06-01 13:37:56] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:37:56] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 13:37:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/75 variables, 12/22 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 8 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 2/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/80 variables, 3/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/81 variables, 1/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 64/145 variables, 81/109 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 8/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 117 constraints, problems are : Problem set: 2 solved, 2 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 2/116 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 2 solved, 2 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1220ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 759 ms.
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 49 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-06-01 13:37:58] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-06-01 13:37:58] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 13:37:58] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/93 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/101 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:38:00] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:38:00] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 2/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 103 constraints, problems are : Problem set: 2 solved, 42 unsolved in 3172 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:38:02] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:38:02] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:38:02] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:38:02] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:38:02] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 5/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 5/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 150 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1485 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 15/15 constraints]
After SMT, in 4726ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 4728ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 41
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 39
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 5 ms. Remains 58 /60 variables (removed 2) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4807 ms. Remains : 58/81 places, 39/65 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:38:03] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 13:38:03] [INFO ] Flatten gal took : 48 ms
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:38:03] [INFO ] Flatten gal took : 6 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:38:03] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 71 ms.
[2024-06-01 13:38:03] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 198 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 682 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 682 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 674 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 674 transition count 1290
Applied a total of 32 rules in 133 ms. Remains 674 /690 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:38:03] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 674 cols
[2024-06-01 13:38:04] [INFO ] Computed 54 invariants in 112 ms
[2024-06-01 13:38:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 3 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 5 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 349 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 162 places in 330 ms of which 4 ms to minimize.
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:38:18] [INFO ] Deduced a trap composed of 384 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 336 places in 333 ms of which 4 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 319 places in 363 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 4.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 64 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:38:40] [INFO ] Deduced a trap composed of 351 places in 291 ms of which 3 ms to minimize.
[2024-06-01 13:38:40] [INFO ] Deduced a trap composed of 346 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:38:40] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 5 ms to minimize.
[2024-06-01 13:38:41] [INFO ] Deduced a trap composed of 374 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:38:42] [INFO ] Deduced a trap composed of 59 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:38:44] [INFO ] Deduced a trap composed of 391 places in 239 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1948 variables, and 71 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 21/21 constraints]
After SMT, in 42351ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42369ms
[2024-06-01 13:38:46] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:38:46] [INFO ] Invariant cache hit.
[2024-06-01 13:38:46] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-06-01 13:38:46] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:38:46] [INFO ] Invariant cache hit.
[2024-06-01 13:38:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:38:54] [INFO ] Implicit Places using invariants and state equation in 7685 ms returned []
Implicit Place search using SMT with State Equation took 8246 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:38:54] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:38:54] [INFO ] Invariant cache hit.
[2024-06-01 13:38:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 14 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:39:08] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:39:08] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:39:08] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 2 ms to minimize.
[2024-06-01 13:39:08] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:08] [INFO ] Deduced a trap composed of 367 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:39:09] [INFO ] Deduced a trap composed of 374 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:39:09] [INFO ] Deduced a trap composed of 165 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:39:09] [INFO ] Deduced a trap composed of 366 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 377 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 49 places in 313 ms of which 5 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 350 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 328 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 329 places in 340 ms of which 5 ms to minimize.
[2024-06-01 13:39:12] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 10 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:39:21] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 70 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:39:30] [INFO ] Deduced a trap composed of 328 places in 343 ms of which 5 ms to minimize.
[2024-06-01 13:39:30] [INFO ] Deduced a trap composed of 392 places in 310 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1948 variables, and 72 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 22/22 constraints]
After SMT, in 62259ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 62285ms
Starting structural reductions in LTL mode, iteration 1 : 674/690 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113063 ms. Remains : 674/690 places, 1290/1306 transitions.
Support contains 198 out of 674 places after structural reductions.
[2024-06-01 13:39:57] [INFO ] Flatten gal took : 133 ms
[2024-06-01 13:39:57] [INFO ] Flatten gal took : 157 ms
[2024-06-01 13:39:57] [INFO ] Input system was already deterministic with 1290 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 1700 steps (0 resets) in 24 ms. (68 steps per ms) remains 0/16 properties
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((!p0 U p1)||F(G(p2)))))))'
Support contains 30 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 17 ms. Remains 674 /674 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:39:57] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:39:57] [INFO ] Invariant cache hit.
[2024-06-01 13:39:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Deduced a trap composed of 367 places in 334 ms of which 5 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Deduced a trap composed of 374 places in 320 ms of which 5 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 165 places in 370 ms of which 18 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 366 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 377 places in 330 ms of which 5 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 350 places in 344 ms of which 4 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 328 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:40:13] [INFO ] Deduced a trap composed of 329 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:40:14] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:40:30] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1948 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 19/19 constraints]
After SMT, in 41603ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41616ms
[2024-06-01 13:40:39] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:40:39] [INFO ] Invariant cache hit.
[2024-06-01 13:40:39] [INFO ] Implicit Places using invariants in 384 ms returned [532, 533, 534, 535, 536, 537, 538, 539]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 387 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 666/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 18 ms. Remains 666 /666 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42041 ms. Remains : 666/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-00
Stuttering criterion allowed to conclude after 4088 steps with 0 reset in 40 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-00 finished in 42428 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((X(F(p1))||p0))))'
Support contains 20 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 672 transition count 1242
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 96 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 256 place count 544 transition count 1162
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 384 place count 480 transition count 1098
Applied a total of 384 rules in 92 ms. Remains 480 /674 variables (removed 194) and now considering 1098/1290 (removed 192) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 13:40:40] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 480 cols
[2024-06-01 13:40:40] [INFO ] Computed 52 invariants in 19 ms
[2024-06-01 13:40:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 4 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:40:48] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:40:49] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:40:49] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:40:49] [INFO ] Deduced a trap composed of 175 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:40:49] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:40:52] [INFO ] Deduced a trap composed of 292 places in 195 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:41:00] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:41:00] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1562 variables, and 63 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 13:41:03] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:41:12] [INFO ] Deduced a trap composed of 125 places in 212 ms of which 5 ms to minimize.
[2024-06-01 13:41:12] [INFO ] Deduced a trap composed of 159 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:41:12] [INFO ] Deduced a trap composed of 173 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:41:13] [INFO ] Deduced a trap composed of 233 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1562 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 18/18 constraints]
After SMT, in 41486ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41498ms
[2024-06-01 13:41:21] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:41:21] [INFO ] Invariant cache hit.
[2024-06-01 13:41:22] [INFO ] Implicit Places using invariants in 436 ms returned [434, 435, 436, 437, 438, 439, 440, 441]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 450 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/674 places, 1098/1290 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 464 transition count 1090
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 464 transition count 1090
Applied a total of 16 rules in 51 ms. Remains 464 /472 variables (removed 8) and now considering 1090/1098 (removed 8) transitions.
[2024-06-01 13:41:22] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2024-06-01 13:41:22] [INFO ] Computed 44 invariants in 39 ms
[2024-06-01 13:41:22] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-06-01 13:41:22] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:41:22] [INFO ] Invariant cache hit.
[2024-06-01 13:41:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:41:27] [INFO ] Implicit Places using invariants and state equation in 4323 ms returned []
Implicit Place search using SMT with State Equation took 4735 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/674 places, 1090/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46829 ms. Remains : 464/674 places, 1090/1290 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-01
Product exploration explored 100000 steps with 3719 reset in 602 ms.
Product exploration explored 100000 steps with 3715 reset in 561 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 700 steps (0 resets) in 25 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 296 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 13:41:29] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:41:29] [INFO ] Invariant cache hit.
[2024-06-01 13:41:29] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2024-06-01 13:41:29] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 66 ms returned sat
[2024-06-01 13:41:31] [INFO ] [Real]Absence check using state equation in 1510 ms returned sat
[2024-06-01 13:41:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:41:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 31 ms returned sat
[2024-06-01 13:41:32] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 63 ms returned sat
[2024-06-01 13:41:34] [INFO ] [Nat]Absence check using state equation in 2011 ms returned sat
[2024-06-01 13:41:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:41:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 343 ms returned sat
[2024-06-01 13:41:34] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-06-01 13:41:34] [INFO ] Computed and/alt/rep : 416/1461/408 causal constraints (skipped 664 transitions) in 109 ms.
[2024-06-01 13:41:37] [INFO ] Added : 105 causal constraints over 21 iterations in 2541 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 20 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 30 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Running 1088 sub problems to find dead transitions.
[2024-06-01 13:41:37] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:41:37] [INFO ] Invariant cache hit.
[2024-06-01 13:41:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:41:46] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:41:47] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:41:47] [INFO ] Deduced a trap composed of 192 places in 222 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 51 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:42:03] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:42:05] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2024-06-01 13:42:08] [INFO ] Deduced a trap composed of 170 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:42:08] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:42:09] [INFO ] Deduced a trap composed of 152 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 14/14 constraints]
After SMT, in 41787ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 41800ms
[2024-06-01 13:42:18] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:42:18] [INFO ] Invariant cache hit.
[2024-06-01 13:42:19] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 13:42:19] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:42:19] [INFO ] Invariant cache hit.
[2024-06-01 13:42:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:42:23] [INFO ] Implicit Places using invariants and state equation in 4259 ms returned []
Implicit Place search using SMT with State Equation took 4604 ms to find 0 implicit places.
[2024-06-01 13:42:23] [INFO ] Redundant transitions in 84 ms returned []
Running 1088 sub problems to find dead transitions.
[2024-06-01 13:42:23] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:42:23] [INFO ] Invariant cache hit.
[2024-06-01 13:42:23] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 7 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 192 places in 192 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
SMT process timed out in 31650ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 31663ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78192 ms. Remains : 464/464 places, 1090/1090 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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 416 steps (0 resets) in 7 ms. (52 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 13:42:55] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:42:55] [INFO ] Invariant cache hit.
[2024-06-01 13:42:56] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned sat
[2024-06-01 13:42:56] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 51 ms returned sat
[2024-06-01 13:42:58] [INFO ] [Real]Absence check using state equation in 1541 ms returned sat
[2024-06-01 13:42:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:42:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 23 ms returned sat
[2024-06-01 13:42:59] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 52 ms returned sat
[2024-06-01 13:43:00] [INFO ] [Nat]Absence check using state equation in 1781 ms returned sat
[2024-06-01 13:43:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:43:01] [INFO ] [Nat]Added 96 Read/Feed constraints in 316 ms returned sat
[2024-06-01 13:43:02] [INFO ] Deduced a trap composed of 47 places in 917 ms of which 1 ms to minimize.
[2024-06-01 13:43:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1040 ms
[2024-06-01 13:43:02] [INFO ] Computed and/alt/rep : 416/1461/408 causal constraints (skipped 664 transitions) in 85 ms.
[2024-06-01 13:43:04] [INFO ] Added : 105 causal constraints over 21 iterations in 2026 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3706 reset in 653 ms.
Product exploration explored 100000 steps with 3712 reset in 527 ms.
Support contains 20 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 47 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Running 1088 sub problems to find dead transitions.
[2024-06-01 13:43:05] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:43:05] [INFO ] Invariant cache hit.
[2024-06-01 13:43:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 3 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 13 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 2 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 192 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 51 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:43:35] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 170 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 152 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 14/14 constraints]
After SMT, in 41755ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 41773ms
[2024-06-01 13:43:47] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:43:47] [INFO ] Invariant cache hit.
[2024-06-01 13:43:47] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 13:43:47] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:43:47] [INFO ] Invariant cache hit.
[2024-06-01 13:43:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:43:52] [INFO ] Implicit Places using invariants and state equation in 4818 ms returned []
Implicit Place search using SMT with State Equation took 5209 ms to find 0 implicit places.
[2024-06-01 13:43:52] [INFO ] Redundant transitions in 13 ms returned []
Running 1088 sub problems to find dead transitions.
[2024-06-01 13:43:52] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:43:52] [INFO ] Invariant cache hit.
[2024-06-01 13:43:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 2 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:44:02] [INFO ] Deduced a trap composed of 192 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
SMT process timed out in 31578ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 31589ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78647 ms. Remains : 464/464 places, 1090/1090 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-01 finished in 224177 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(p1)||p0)))'
Support contains 18 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 672 transition count 1250
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 632 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 96 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 256 place count 544 transition count 1162
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 352 place count 496 transition count 1114
Applied a total of 352 rules in 202 ms. Remains 496 /674 variables (removed 178) and now considering 1114/1290 (removed 176) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 13:44:24] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 496 cols
[2024-06-01 13:44:24] [INFO ] Computed 52 invariants in 12 ms
[2024-06-01 13:44:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:44:33] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:44:33] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 216 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 208 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:44:35] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:44:40] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1594 variables, and 61 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 35/36 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 13:44:48] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:44:50] [INFO ] Deduced a trap composed of 178 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:44:54] [INFO ] Deduced a trap composed of 202 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:44:54] [INFO ] Deduced a trap composed of 229 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:44:55] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:44:58] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1594 variables, and 67 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 35/36 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 17/17 constraints]
After SMT, in 41720ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41732ms
[2024-06-01 13:45:06] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 13:45:06] [INFO ] Invariant cache hit.
[2024-06-01 13:45:06] [INFO ] Implicit Places using invariants in 357 ms returned [450, 451, 452, 453, 454, 455, 456, 457]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 371 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/674 places, 1114/1290 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 480 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 480 transition count 1106
Applied a total of 16 rules in 31 ms. Remains 480 /488 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
[2024-06-01 13:45:06] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 480 cols
[2024-06-01 13:45:06] [INFO ] Computed 44 invariants in 10 ms
[2024-06-01 13:45:07] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-06-01 13:45:07] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2024-06-01 13:45:07] [INFO ] Invariant cache hit.
[2024-06-01 13:45:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:45:13] [INFO ] Implicit Places using invariants and state equation in 5807 ms returned []
Implicit Place search using SMT with State Equation took 6481 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 480/674 places, 1106/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48823 ms. Remains : 480/674 places, 1106/1290 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-02
Stuttering criterion allowed to conclude after 2010 steps with 42 reset in 13 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-02 finished in 48908 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))&&(X(F(p2))||p1))))'
Support contains 28 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 672 transition count 1290
Applied a total of 2 rules in 13 ms. Remains 672 /674 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:45:13] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 13:45:13] [INFO ] Computed 52 invariants in 15 ms
[2024-06-01 13:45:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:45:27] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:45:29] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:45:30] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:45:33] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 382 places in 334 ms of which 4 ms to minimize.
[2024-06-01 13:45:34] [INFO ] Deduced a trap composed of 355 places in 310 ms of which 4 ms to minimize.
[2024-06-01 13:45:35] [INFO ] Deduced a trap composed of 361 places in 263 ms of which 3 ms to minimize.
[2024-06-01 13:45:35] [INFO ] Deduced a trap composed of 386 places in 241 ms of which 4 ms to minimize.
SMT process timed out in 22094ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22113ms
[2024-06-01 13:45:35] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:45:35] [INFO ] Invariant cache hit.
[2024-06-01 13:45:35] [INFO ] Implicit Places using invariants in 350 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 352 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 7 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22490 ms. Remains : 664/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-03 finished in 22649 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((G(p0)||(F(p2)&&p1))))'
Support contains 16 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 672 transition count 1290
Applied a total of 2 rules in 8 ms. Remains 672 /674 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:45:35] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:45:35] [INFO ] Invariant cache hit.
[2024-06-01 13:45:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:45:47] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 3 ms to minimize.
[2024-06-01 13:45:47] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 1 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 380 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:45:49] [INFO ] Deduced a trap composed of 364 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:45:49] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:45:49] [INFO ] Deduced a trap composed of 367 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:45:49] [INFO ] Deduced a trap composed of 184 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:45:50] [INFO ] Deduced a trap composed of 366 places in 288 ms of which 3 ms to minimize.
[2024-06-01 13:45:51] [INFO ] Deduced a trap composed of 382 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:45:51] [INFO ] Deduced a trap composed of 395 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:45:51] [INFO ] Deduced a trap composed of 356 places in 272 ms of which 3 ms to minimize.
[2024-06-01 13:45:51] [INFO ] Deduced a trap composed of 402 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:45:52] [INFO ] Deduced a trap composed of 353 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:45:52] [INFO ] Deduced a trap composed of 346 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 341 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:46:00] [INFO ] Deduced a trap composed of 380 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:46:06] [INFO ] Deduced a trap composed of 461 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:46:08] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:46:11] [INFO ] Deduced a trap composed of 350 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:46:12] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:46:14] [INFO ] Deduced a trap composed of 396 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:46:15] [INFO ] Deduced a trap composed of 371 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 77 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 27/27 constraints]
After SMT, in 41427ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41438ms
[2024-06-01 13:46:17] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:46:17] [INFO ] Invariant cache hit.
[2024-06-01 13:46:17] [INFO ] Implicit Places using invariants in 524 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 547 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 6 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42004 ms. Remains : 664/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 464 ms.
Product exploration explored 100000 steps with 50000 reset in 426 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 p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 25 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-06 finished in 43158 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(p0))'
Support contains 11 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 672 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 536 transition count 1154
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 368 place count 488 transition count 1106
Applied a total of 368 rules in 39 ms. Remains 488 /674 variables (removed 186) and now considering 1106/1290 (removed 184) transitions.
Running 1104 sub problems to find dead transitions.
[2024-06-01 13:46:19] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 488 cols
[2024-06-01 13:46:19] [INFO ] Computed 52 invariants in 31 ms
[2024-06-01 13:46:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-06-01 13:46:27] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:46:27] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:46:27] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:46:27] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:46:27] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:46:27] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 183 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 195 places in 239 ms of which 2 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 184 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:46:29] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 2 ms to minimize.
[2024-06-01 13:46:32] [INFO ] Deduced a trap composed of 173 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:46:38] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:46:39] [INFO ] Deduced a trap composed of 176 places in 180 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1578 variables, and 64 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-06-01 13:46:42] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:46:45] [INFO ] Deduced a trap composed of 300 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:46:49] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:46:54] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:46:55] [INFO ] Deduced a trap composed of 310 places in 187 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1578 variables, and 69 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 19/19 constraints]
After SMT, in 41742ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 41751ms
[2024-06-01 13:47:00] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2024-06-01 13:47:00] [INFO ] Invariant cache hit.
[2024-06-01 13:47:01] [INFO ] Implicit Places using invariants in 434 ms returned [434, 435, 436, 437, 438, 439, 440, 441]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 450 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 480/674 places, 1106/1290 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 472 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 472 transition count 1098
Applied a total of 16 rules in 30 ms. Remains 472 /480 variables (removed 8) and now considering 1098/1106 (removed 8) transitions.
[2024-06-01 13:47:01] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 472 cols
[2024-06-01 13:47:01] [INFO ] Computed 44 invariants in 28 ms
[2024-06-01 13:47:01] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-01 13:47:01] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 13:47:01] [INFO ] Invariant cache hit.
[2024-06-01 13:47:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:47:09] [INFO ] Implicit Places using invariants and state equation in 7262 ms returned []
Implicit Place search using SMT with State Equation took 7758 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 472/674 places, 1098/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50031 ms. Remains : 472/674 places, 1098/1290 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 381 ms.
Product exploration explored 100000 steps with 50000 reset in 406 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-07 finished in 50922 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(p1))))'
Support contains 25 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 672 transition count 1250
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 632 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 96 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 256 place count 544 transition count 1162
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 336 place count 504 transition count 1122
Applied a total of 336 rules in 65 ms. Remains 504 /674 variables (removed 170) and now considering 1122/1290 (removed 168) transitions.
Running 1120 sub problems to find dead transitions.
[2024-06-01 13:47:10] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
// Phase 1: matrix 1106 rows 504 cols
[2024-06-01 13:47:10] [INFO ] Computed 52 invariants in 17 ms
[2024-06-01 13:47:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:47:19] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:47:19] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:47:20] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:47:20] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:47:20] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:47:20] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:47:20] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:47:20] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:47:24] [INFO ] Deduced a trap composed of 188 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:47:24] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:47:24] [INFO ] Deduced a trap composed of 209 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:47:25] [INFO ] Deduced a trap composed of 194 places in 194 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 62 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 211 places in 204 ms of which 2 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 203 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 320 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 186 places in 229 ms of which 2 ms to minimize.
[2024-06-01 13:47:39] [INFO ] Deduced a trap composed of 174 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:47:40] [INFO ] Deduced a trap composed of 78 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:47:40] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 69 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 19/19 constraints]
After SMT, in 41701ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 41711ms
[2024-06-01 13:47:51] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:47:51] [INFO ] Invariant cache hit.
[2024-06-01 13:47:52] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 13:47:52] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:47:52] [INFO ] Invariant cache hit.
[2024-06-01 13:47:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:47:57] [INFO ] Implicit Places using invariants and state equation in 5377 ms returned []
Implicit Place search using SMT with State Equation took 5717 ms to find 0 implicit places.
[2024-06-01 13:47:57] [INFO ] Redundant transitions in 19 ms returned []
Running 1120 sub problems to find dead transitions.
[2024-06-01 13:47:57] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:47:57] [INFO ] Invariant cache hit.
[2024-06-01 13:47:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:48:06] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:48:07] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:48:11] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:48:18] [INFO ] Deduced a trap composed of 321 places in 182 ms of which 4 ms to minimize.
[2024-06-01 13:48:18] [INFO ] Deduced a trap composed of 308 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:48:20] [INFO ] Deduced a trap composed of 183 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:48:21] [INFO ] Deduced a trap composed of 230 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:48:21] [INFO ] Deduced a trap composed of 227 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:48:21] [INFO ] Deduced a trap composed of 229 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:48:21] [INFO ] Deduced a trap composed of 225 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:48:21] [INFO ] Deduced a trap composed of 227 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:48:22] [INFO ] Deduced a trap composed of 227 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:48:22] [INFO ] Deduced a trap composed of 306 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:48:22] [INFO ] Deduced a trap composed of 214 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 70 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:48:30] [INFO ] Deduced a trap composed of 224 places in 194 ms of which 2 ms to minimize.
[2024-06-01 13:48:30] [INFO ] Deduced a trap composed of 216 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:48:31] [INFO ] Deduced a trap composed of 202 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:48:31] [INFO ] Deduced a trap composed of 221 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:48:31] [INFO ] Deduced a trap composed of 210 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:48:38] [INFO ] Deduced a trap composed of 174 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:48:51] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 78 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 28/28 constraints]
After SMT, in 61518ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 61534ms
Starting structural reductions in SI_LTL mode, iteration 1 : 504/674 places, 1122/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109073 ms. Remains : 504/674 places, 1122/1290 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-09
Product exploration explored 100000 steps with 3294 reset in 382 ms.
Product exploration explored 100000 steps with 3251 reset in 321 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 165 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 13:49:00] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:49:00] [INFO ] Invariant cache hit.
[2024-06-01 13:49:01] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 13:49:01] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 124 ms returned sat
[2024-06-01 13:49:02] [INFO ] [Real]Absence check using state equation in 888 ms returned sat
[2024-06-01 13:49:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:49:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-06-01 13:49:03] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 451 ms returned sat
[2024-06-01 13:49:04] [INFO ] [Nat]Absence check using state equation in 1452 ms returned sat
[2024-06-01 13:49:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:49:05] [INFO ] [Nat]Added 96 Read/Feed constraints in 514 ms returned sat
[2024-06-01 13:49:05] [INFO ] Deduced a trap composed of 51 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:49:05] [INFO ] Deduced a trap composed of 68 places in 302 ms of which 3 ms to minimize.
[2024-06-01 13:49:07] [INFO ] Deduced a trap composed of 50 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:49:07] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:49:07] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:49:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2842 ms
[2024-06-01 13:49:07] [INFO ] Computed and/alt/rep : 456/1566/448 causal constraints (skipped 656 transitions) in 114 ms.
[2024-06-01 13:49:13] [INFO ] Added : 235 causal constraints over 48 iterations in 5347 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 13:49:13] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:49:13] [INFO ] Invariant cache hit.
[2024-06-01 13:49:13] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 13:49:14] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 185 ms returned sat
[2024-06-01 13:49:15] [INFO ] [Real]Absence check using state equation in 1907 ms returned sat
[2024-06-01 13:49:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:49:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 13:49:16] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 430 ms returned sat
[2024-06-01 13:49:18] [INFO ] [Nat]Absence check using state equation in 1445 ms returned sat
[2024-06-01 13:49:18] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:49:18] [INFO ] [Nat]Added 96 Read/Feed constraints in 264 ms returned sat
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:49:19] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:49:21] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2517 ms
Could not prove EG (NOT p1)
Support contains 25 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 1122/1122 transitions.
Applied a total of 0 rules in 31 ms. Remains 504 /504 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Running 1120 sub problems to find dead transitions.
[2024-06-01 13:49:21] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:49:21] [INFO ] Invariant cache hit.
[2024-06-01 13:49:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 50 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 5 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:49:33] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:49:33] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:49:33] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:49:33] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:49:33] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:49:38] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 59 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:49:44] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:49:44] [INFO ] Deduced a trap composed of 224 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:49:45] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:49:45] [INFO ] Deduced a trap composed of 193 places in 227 ms of which 2 ms to minimize.
[2024-06-01 13:49:45] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:49:45] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:49:46] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:49:46] [INFO ] Deduced a trap composed of 210 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:49:46] [INFO ] Deduced a trap composed of 221 places in 245 ms of which 2 ms to minimize.
[2024-06-01 13:49:46] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:49:47] [INFO ] Deduced a trap composed of 237 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:49:47] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:49:47] [INFO ] Deduced a trap composed of 211 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:49:58] [INFO ] Deduced a trap composed of 209 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:49:59] [INFO ] Deduced a trap composed of 211 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:49:59] [INFO ] Deduced a trap composed of 199 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 75 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 25/25 constraints]
After SMT, in 42139ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 42157ms
[2024-06-01 13:50:03] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:50:03] [INFO ] Invariant cache hit.
[2024-06-01 13:50:03] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 13:50:03] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:50:03] [INFO ] Invariant cache hit.
[2024-06-01 13:50:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:50:08] [INFO ] Implicit Places using invariants and state equation in 4976 ms returned []
Implicit Place search using SMT with State Equation took 5364 ms to find 0 implicit places.
[2024-06-01 13:50:08] [INFO ] Redundant transitions in 18 ms returned []
Running 1120 sub problems to find dead transitions.
[2024-06-01 13:50:08] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:50:08] [INFO ] Invariant cache hit.
[2024-06-01 13:50:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:50:18] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:50:19] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:50:24] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:50:32] [INFO ] Deduced a trap composed of 321 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:50:32] [INFO ] Deduced a trap composed of 308 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:50:34] [INFO ] Deduced a trap composed of 183 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:50:35] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:50:35] [INFO ] Deduced a trap composed of 227 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:50:35] [INFO ] Deduced a trap composed of 229 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 225 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 227 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 306 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:50:36] [INFO ] Deduced a trap composed of 214 places in 196 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 70 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 224 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 216 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 202 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 221 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:50:43] [INFO ] Deduced a trap composed of 210 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:50:46] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 174 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:51:01] [INFO ] Deduced a trap composed of 171 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 78 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 28/28 constraints]
After SMT, in 61974ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 61990ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109577 ms. Remains : 504/504 places, 1122/1122 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) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 183 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 13:51:11] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:51:11] [INFO ] Invariant cache hit.
[2024-06-01 13:51:11] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 13:51:11] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 142 ms returned sat
[2024-06-01 13:51:12] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2024-06-01 13:51:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:51:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 13:51:13] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 372 ms returned sat
[2024-06-01 13:51:15] [INFO ] [Nat]Absence check using state equation in 1280 ms returned sat
[2024-06-01 13:51:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:51:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 771 ms returned sat
[2024-06-01 13:51:16] [INFO ] Deduced a trap composed of 51 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:51:16] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:51:18] [INFO ] Deduced a trap composed of 50 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:51:18] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:51:18] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:51:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2703 ms
[2024-06-01 13:51:18] [INFO ] Computed and/alt/rep : 456/1566/448 causal constraints (skipped 656 transitions) in 94 ms.
[2024-06-01 13:51:23] [INFO ] Added : 235 causal constraints over 48 iterations in 5039 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 13:51:23] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:51:23] [INFO ] Invariant cache hit.
[2024-06-01 13:51:24] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 13:51:24] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 217 ms returned sat
[2024-06-01 13:51:26] [INFO ] [Real]Absence check using state equation in 2342 ms returned sat
[2024-06-01 13:51:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:51:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 13:51:27] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 387 ms returned sat
[2024-06-01 13:51:29] [INFO ] [Nat]Absence check using state equation in 1401 ms returned sat
[2024-06-01 13:51:29] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:51:29] [INFO ] [Nat]Added 96 Read/Feed constraints in 260 ms returned sat
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 56 places in 221 ms of which 2 ms to minimize.
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 51 places in 305 ms of which 3 ms to minimize.
[2024-06-01 13:51:32] [INFO ] Deduced a trap composed of 50 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:51:32] [INFO ] Deduced a trap composed of 50 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 120 places in 325 ms of which 3 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:51:35] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:51:36] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 7112 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3235 reset in 314 ms.
Product exploration explored 100000 steps with 3228 reset in 308 ms.
Support contains 25 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 1122/1122 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Running 1120 sub problems to find dead transitions.
[2024-06-01 13:51:37] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:51:37] [INFO ] Invariant cache hit.
[2024-06-01 13:51:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:51:46] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:51:47] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:51:51] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:51:57] [INFO ] Deduced a trap composed of 321 places in 194 ms of which 2 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 308 places in 182 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 61 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:52:00] [INFO ] Deduced a trap composed of 224 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:52:00] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:52:00] [INFO ] Deduced a trap composed of 209 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 174 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:52:11] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:52:11] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:52:14] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 215 places in 215 ms of which 2 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 217 places in 221 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 70 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 20/20 constraints]
After SMT, in 41513ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 41523ms
[2024-06-01 13:52:19] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:52:19] [INFO ] Invariant cache hit.
[2024-06-01 13:52:19] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-06-01 13:52:19] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:52:19] [INFO ] Invariant cache hit.
[2024-06-01 13:52:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:52:24] [INFO ] Implicit Places using invariants and state equation in 4758 ms returned []
Implicit Place search using SMT with State Equation took 5143 ms to find 0 implicit places.
[2024-06-01 13:52:24] [INFO ] Redundant transitions in 19 ms returned []
Running 1120 sub problems to find dead transitions.
[2024-06-01 13:52:24] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-06-01 13:52:24] [INFO ] Invariant cache hit.
[2024-06-01 13:52:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:52:33] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:52:34] [INFO ] Deduced a trap composed of 50 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:52:34] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:52:34] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:52:34] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:52:34] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:52:34] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:52:34] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:52:45] [INFO ] Deduced a trap composed of 321 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:52:46] [INFO ] Deduced a trap composed of 308 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:52:48] [INFO ] Deduced a trap composed of 183 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 230 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 227 places in 207 ms of which 2 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 229 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 225 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:52:49] [INFO ] Deduced a trap composed of 227 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:52:50] [INFO ] Deduced a trap composed of 227 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:52:50] [INFO ] Deduced a trap composed of 306 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:52:50] [INFO ] Deduced a trap composed of 214 places in 186 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 70 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:52:57] [INFO ] Deduced a trap composed of 224 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:52:57] [INFO ] Deduced a trap composed of 216 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 202 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 221 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:52:58] [INFO ] Deduced a trap composed of 210 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:53:02] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:53:05] [INFO ] Deduced a trap composed of 174 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-06-01 13:53:18] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 78 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 28/28 constraints]
After SMT, in 61786ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 61804ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108514 ms. Remains : 504/504 places, 1122/1122 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-09 finished in 376097 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 10 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 672 transition count 1290
Applied a total of 2 rules in 9 ms. Remains 672 /674 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:53:26] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 13:53:26] [INFO ] Computed 52 invariants in 32 ms
[2024-06-01 13:53:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:53:45] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 382 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:53:47] [INFO ] Deduced a trap composed of 355 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:53:47] [INFO ] Deduced a trap composed of 361 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:53:47] [INFO ] Deduced a trap composed of 386 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:53:47] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:53:48] [INFO ] Deduced a trap composed of 398 places in 330 ms of which 4 ms to minimize.
SMT process timed out in 22013ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22025ms
[2024-06-01 13:53:48] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:53:48] [INFO ] Invariant cache hit.
[2024-06-01 13:53:48] [INFO ] Implicit Places using invariants in 379 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 403 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 20 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22460 ms. Remains : 664/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-12
Product exploration explored 100000 steps with 1428 reset in 339 ms.
Product exploration explored 100000 steps with 1434 reset in 276 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 335 steps (0 resets) in 7 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:53:49] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-06-01 13:53:49] [INFO ] Computed 44 invariants in 20 ms
[2024-06-01 13:53:50] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-06-01 13:53:50] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 115 ms returned sat
[2024-06-01 13:53:51] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2024-06-01 13:53:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:53:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 361 ms returned sat
[2024-06-01 13:53:53] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 166 ms returned sat
[2024-06-01 13:53:55] [INFO ] [Nat]Absence check using state equation in 2161 ms returned sat
[2024-06-01 13:53:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:53:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:53:58] [INFO ] [Nat]Added 96 Read/Feed constraints in 3012 ms returned unknown
Could not prove EG (NOT p0)
Support contains 10 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 664 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 608 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 608 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 528 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 464 transition count 1090
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 408 place count 456 transition count 1082
Iterating global reduction 2 with 8 rules applied. Total rules applied 416 place count 456 transition count 1082
Applied a total of 416 rules in 62 ms. Remains 456 /664 variables (removed 208) and now considering 1082/1290 (removed 208) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 13:53:58] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2024-06-01 13:53:58] [INFO ] Computed 44 invariants in 12 ms
[2024-06-01 13:53:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:54:06] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:54:07] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:54:07] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:54:07] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:54:07] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:54:07] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 5 ms to minimize.
[2024-06-01 13:54:07] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:54:07] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:54:07] [INFO ] Deduced a trap composed of 235 places in 211 ms of which 4 ms to minimize.
[2024-06-01 13:54:07] [INFO ] Deduced a trap composed of 185 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 186 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 193 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 182 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:54:09] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:54:15] [INFO ] Deduced a trap composed of 153 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:54:16] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:54:16] [INFO ] Deduced a trap composed of 179 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:54:17] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:54:19] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 61 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:54:36] [INFO ] Deduced a trap composed of 296 places in 178 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 64 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 22/22 constraints]
After SMT, in 41735ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41747ms
[2024-06-01 13:54:40] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:54:40] [INFO ] Invariant cache hit.
[2024-06-01 13:54:40] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 13:54:40] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:54:40] [INFO ] Invariant cache hit.
[2024-06-01 13:54:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:54:45] [INFO ] Implicit Places using invariants and state equation in 4634 ms returned []
Implicit Place search using SMT with State Equation took 4950 ms to find 0 implicit places.
[2024-06-01 13:54:45] [INFO ] Redundant transitions in 17 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-06-01 13:54:45] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:54:45] [INFO ] Invariant cache hit.
[2024-06-01 13:54:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:54:54] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:54:54] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:54:54] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:54:54] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:54:54] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:54:54] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:54:54] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:54:55] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:54:55] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:54:55] [INFO ] Deduced a trap composed of 188 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:55:05] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 1 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 174 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 191 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 57 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:55:21] [INFO ] Deduced a trap composed of 284 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:55:21] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:55:21] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:55:22] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:55:22] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:55:22] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 48 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1522 variables, and 65 constraints, problems are : Problem set: 48 solved, 1032 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 22/22 constraints]
After SMT, in 61953ms problems are : Problem set: 48 solved, 1032 unsolved
Search for dead transitions found 48 dead transitions in 61969ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 456/664 places, 1034/1290 transitions.
Applied a total of 0 rules in 16 ms. Remains 456 /456 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2024-06-01 13:55:47] [INFO ] Redundant transitions in 16 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 108812 ms. Remains : 456/664 places, 1034/1290 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 77 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 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 158 steps (0 resets) in 6 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:55:47] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
// Phase 1: matrix 1018 rows 456 cols
[2024-06-01 13:55:47] [INFO ] Computed 44 invariants in 13 ms
[2024-06-01 13:55:48] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 13:55:48] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 143 ms returned sat
[2024-06-01 13:55:49] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2024-06-01 13:55:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:55:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 13:55:49] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 91 ms returned sat
[2024-06-01 13:55:51] [INFO ] [Nat]Absence check using state equation in 1236 ms returned sat
[2024-06-01 13:55:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:55:51] [INFO ] [Nat]Added 96 Read/Feed constraints in 260 ms returned sat
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 87 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1749 ms
[2024-06-01 13:55:53] [INFO ] Computed and/alt/rep : 472/1949/464 causal constraints (skipped 552 transitions) in 93 ms.
[2024-06-01 13:55:55] [INFO ] Added : 135 causal constraints over 27 iterations in 2272 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2296 reset in 434 ms.
Product exploration explored 100000 steps with 2294 reset in 463 ms.
Support contains 10 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 1034/1034 transitions.
Applied a total of 0 rules in 14 ms. Remains 456 /456 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Running 1032 sub problems to find dead transitions.
[2024-06-01 13:55:56] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-06-01 13:55:56] [INFO ] Invariant cache hit.
[2024-06-01 13:55:56] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 180 places in 224 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 168 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 169 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 201 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 155 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1474 variables, and 60 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 187 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 146 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 1 ms to minimize.
[2024-06-01 13:56:30] [INFO ] Deduced a trap composed of 158 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:56:31] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 2 ms to minimize.
[2024-06-01 13:56:32] [INFO ] Deduced a trap composed of 72 places in 235 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 13:56:33] [INFO ] Deduced a trap composed of 175 places in 184 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1474 variables, and 67 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 25/25 constraints]
After SMT, in 42112ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 42124ms
[2024-06-01 13:56:38] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-06-01 13:56:38] [INFO ] Invariant cache hit.
[2024-06-01 13:56:38] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-01 13:56:38] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-06-01 13:56:38] [INFO ] Invariant cache hit.
[2024-06-01 13:56:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:56:58] [INFO ] Implicit Places using invariants and state equation in 19553 ms returned []
Implicit Place search using SMT with State Equation took 19898 ms to find 0 implicit places.
[2024-06-01 13:56:58] [INFO ] Redundant transitions in 7 ms returned []
Running 1032 sub problems to find dead transitions.
[2024-06-01 13:56:58] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-06-01 13:56:58] [INFO ] Invariant cache hit.
[2024-06-01 13:56:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 13:57:06] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:57:06] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:57:06] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:57:06] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:57:06] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:57:06] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:57:06] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:57:07] [INFO ] Deduced a trap composed of 180 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:57:07] [INFO ] Deduced a trap composed of 178 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:57:07] [INFO ] Deduced a trap composed of 154 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:57:07] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:57:08] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:57:08] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:57:08] [INFO ] Deduced a trap composed of 169 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:57:08] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:57:08] [INFO ] Deduced a trap composed of 201 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:57:09] [INFO ] Deduced a trap composed of 155 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:57:09] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 13:57:24] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:57:25] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:57:25] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:57:25] [INFO ] Deduced a trap composed of 284 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:57:26] [INFO ] Deduced a trap composed of 294 places in 272 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 2.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 9.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1474 variables, and 65 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 13:57:32] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2024-06-01 13:57:45] [INFO ] Deduced a trap composed of 167 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 13:57:48] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1474 variables, and 68 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 26/26 constraints]
After SMT, in 61629ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 61639ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 123696 ms. Remains : 456/456 places, 1034/1034 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-12 finished in 274150 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 56 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 672 transition count 1290
Applied a total of 2 rules in 7 ms. Remains 672 /674 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 13:58:00] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 13:58:00] [INFO ] Computed 52 invariants in 15 ms
[2024-06-01 13:58:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 13:58:14] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:58:16] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:58:16] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:58:16] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:58:16] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:58:16] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:58:16] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:58:19] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 20 ms to minimize.
[2024-06-01 13:58:20] [INFO ] Deduced a trap composed of 382 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 355 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 361 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 386 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:58:22] [INFO ] Deduced a trap composed of 398 places in 265 ms of which 21 ms to minimize.
SMT process timed out in 22038ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22050ms
[2024-06-01 13:58:22] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 13:58:22] [INFO ] Invariant cache hit.
[2024-06-01 13:58:22] [INFO ] Implicit Places using invariants in 407 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 433 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 6 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22500 ms. Remains : 664/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-14
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-14 finished in 22633 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((X(F(p1))||p0))))'
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(p1))))'
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)))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T08-LTLFireability-12
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 674 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 672 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 472 transition count 1090
Applied a total of 400 rules in 47 ms. Remains 472 /674 variables (removed 202) and now considering 1090/1290 (removed 200) transitions.
Running 1088 sub problems to find dead transitions.
[2024-06-01 13:58:23] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 472 cols
[2024-06-01 13:58:23] [INFO ] Computed 52 invariants in 24 ms
[2024-06-01 13:58:23] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:58:33] [INFO ] Deduced a trap composed of 181 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:58:34] [INFO ] Deduced a trap composed of 169 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:58:34] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:58:42] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:58:42] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:58:43] [INFO ] Deduced a trap composed of 220 places in 249 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 219 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 2 ms to minimize.
SMT process timed out in 22266ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 22283ms
[2024-06-01 13:58:45] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 13:58:45] [INFO ] Invariant cache hit.
[2024-06-01 13:58:46] [INFO ] Implicit Places using invariants in 317 ms returned [426, 427, 428, 429, 430, 431, 432, 433]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 330 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 464/674 places, 1090/1290 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 456 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 456 transition count 1082
Applied a total of 16 rules in 12 ms. Remains 456 /464 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
[2024-06-01 13:58:46] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2024-06-01 13:58:46] [INFO ] Computed 44 invariants in 10 ms
[2024-06-01 13:58:46] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 13:58:46] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:58:46] [INFO ] Invariant cache hit.
[2024-06-01 13:58:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:58:51] [INFO ] Implicit Places using invariants and state equation in 4667 ms returned []
Implicit Place search using SMT with State Equation took 5002 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 456/674 places, 1082/1290 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 27682 ms. Remains : 456/674 places, 1082/1290 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-12
Product exploration explored 100000 steps with 2289 reset in 424 ms.
Product exploration explored 100000 steps with 2306 reset in 450 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 154 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:58:52] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:58:52] [INFO ] Invariant cache hit.
[2024-06-01 13:58:52] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned sat
[2024-06-01 13:58:53] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 87 ms returned sat
[2024-06-01 13:58:54] [INFO ] [Real]Absence check using state equation in 982 ms returned sat
[2024-06-01 13:58:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:58:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 13:58:54] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 74 ms returned sat
[2024-06-01 13:58:56] [INFO ] [Nat]Absence check using state equation in 1529 ms returned sat
[2024-06-01 13:58:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:58:56] [INFO ] [Nat]Added 96 Read/Feed constraints in 402 ms returned sat
[2024-06-01 13:58:56] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:58:56] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:58:57] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:58:57] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:58:57] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:58:58] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:58:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1763 ms
[2024-06-01 13:58:58] [INFO ] Computed and/alt/rep : 408/1453/400 causal constraints (skipped 664 transitions) in 85 ms.
[2024-06-01 13:59:00] [INFO ] Added : 117 causal constraints over 24 iterations in 2452 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 17 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 13:59:00] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:59:00] [INFO ] Invariant cache hit.
[2024-06-01 13:59:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:59:09] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:59:09] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:59:09] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:59:09] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:59:09] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:59:09] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:59:09] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:59:10] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:59:10] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:59:10] [INFO ] Deduced a trap composed of 188 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:59:20] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 2.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 9.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 4.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 53 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:59:27] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:59:27] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:59:32] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:59:33] [INFO ] Deduced a trap composed of 122 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:59:37] [INFO ] Deduced a trap composed of 284 places in 189 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints]
After SMT, in 41645ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41658ms
[2024-06-01 13:59:42] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:59:42] [INFO ] Invariant cache hit.
[2024-06-01 13:59:42] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-06-01 13:59:42] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:59:42] [INFO ] Invariant cache hit.
[2024-06-01 13:59:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:59:47] [INFO ] Implicit Places using invariants and state equation in 5010 ms returned []
Implicit Place search using SMT with State Equation took 5386 ms to find 0 implicit places.
[2024-06-01 13:59:48] [INFO ] Redundant transitions in 16 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-06-01 13:59:48] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-06-01 13:59:48] [INFO ] Invariant cache hit.
[2024-06-01 13:59:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 13:59:56] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:59:56] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:59:56] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:59:56] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:59:56] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:59:56] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:59:56] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:59:57] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:59:57] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:59:57] [INFO ] Deduced a trap composed of 188 places in 246 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 14:00:07] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:00:14] [INFO ] Deduced a trap composed of 174 places in 248 ms of which 2 ms to minimize.
[2024-06-01 14:00:14] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:00:15] [INFO ] Deduced a trap composed of 191 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:00:15] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 57 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 14:00:23] [INFO ] Deduced a trap composed of 284 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:00:23] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:00:23] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 48 solved, 1032 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1522 variables, and 65 constraints, problems are : Problem set: 48 solved, 1032 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 22/22 constraints]
After SMT, in 61650ms problems are : Problem set: 48 solved, 1032 unsolved
Search for dead transitions found 48 dead transitions in 61665ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 456/456 places, 1034/1082 transitions.
Applied a total of 0 rules in 12 ms. Remains 456 /456 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2024-06-01 14:00:49] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 108796 ms. Remains : 456/456 places, 1034/1082 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 122 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 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 170 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:00:50] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
// Phase 1: matrix 1018 rows 456 cols
[2024-06-01 14:00:50] [INFO ] Computed 44 invariants in 15 ms
[2024-06-01 14:00:50] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 14:00:50] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 98 ms returned sat
[2024-06-01 14:00:51] [INFO ] [Real]Absence check using state equation in 947 ms returned sat
[2024-06-01 14:00:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:00:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 14:00:52] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 93 ms returned sat
[2024-06-01 14:00:53] [INFO ] [Nat]Absence check using state equation in 1510 ms returned sat
[2024-06-01 14:00:53] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:00:54] [INFO ] [Nat]Added 96 Read/Feed constraints in 256 ms returned sat
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 87 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1661 ms
[2024-06-01 14:00:55] [INFO ] Computed and/alt/rep : 472/1949/464 causal constraints (skipped 552 transitions) in 68 ms.
[2024-06-01 14:00:57] [INFO ] Added : 135 causal constraints over 27 iterations in 2107 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2298 reset in 385 ms.
Product exploration explored 100000 steps with 2296 reset in 446 ms.
Support contains 10 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 1034/1034 transitions.
Applied a total of 0 rules in 14 ms. Remains 456 /456 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Running 1032 sub problems to find dead transitions.
[2024-06-01 14:00:58] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-06-01 14:00:58] [INFO ] Invariant cache hit.
[2024-06-01 14:00:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 180 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 154 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 168 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 169 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:01:08] [INFO ] Deduced a trap composed of 178 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:01:08] [INFO ] Deduced a trap composed of 201 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:01:08] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:01:08] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1474 variables, and 60 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 14:01:21] [INFO ] Deduced a trap composed of 187 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:01:22] [INFO ] Deduced a trap composed of 146 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:01:30] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:01:30] [INFO ] Deduced a trap composed of 161 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:01:31] [INFO ] Deduced a trap composed of 72 places in 237 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 14:01:32] [INFO ] Deduced a trap composed of 175 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:01:40] [INFO ] Deduced a trap composed of 206 places in 212 ms of which 2 ms to minimize.
[2024-06-01 14:01:40] [INFO ] Deduced a trap composed of 216 places in 206 ms of which 3 ms to minimize.
SMT process timed out in 41575ms, After SMT, problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 41587ms
[2024-06-01 14:01:40] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-06-01 14:01:40] [INFO ] Invariant cache hit.
[2024-06-01 14:01:40] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-06-01 14:01:40] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-06-01 14:01:40] [INFO ] Invariant cache hit.
[2024-06-01 14:01:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:01:58] [INFO ] Implicit Places using invariants and state equation in 17990 ms returned []
Implicit Place search using SMT with State Equation took 18358 ms to find 0 implicit places.
[2024-06-01 14:01:58] [INFO ] Redundant transitions in 7 ms returned []
Running 1032 sub problems to find dead transitions.
[2024-06-01 14:01:58] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-06-01 14:01:58] [INFO ] Invariant cache hit.
[2024-06-01 14:01:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 14:02:05] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:02:05] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 180 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:02:06] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 6 ms to minimize.
[2024-06-01 14:02:07] [INFO ] Deduced a trap composed of 154 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:02:07] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:02:07] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:02:07] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:02:07] [INFO ] Deduced a trap composed of 169 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:02:07] [INFO ] Deduced a trap composed of 178 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:02:08] [INFO ] Deduced a trap composed of 201 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:02:08] [INFO ] Deduced a trap composed of 155 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:02:08] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 14:02:21] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:02:22] [INFO ] Deduced a trap composed of 146 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:02:22] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:02:22] [INFO ] Deduced a trap composed of 284 places in 202 ms of which 3 ms to minimize.
[2024-06-01 14:02:22] [INFO ] Deduced a trap composed of 294 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1474 variables, and 65 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 14:02:32] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:02:43] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-06-01 14:02:47] [INFO ] Deduced a trap composed of 196 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:02:59] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:02:59] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 1)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 9)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 1)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 8)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1474 variables, and 70 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 28/28 constraints]
After SMT, in 61523ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 61532ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121522 ms. Remains : 456/456 places, 1034/1034 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-12 finished in 277167 ms.
[2024-06-01 14:03:00] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:03:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 14:03:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 674 places, 1290 transitions and 5636 arcs took 19 ms.
Total runtime 1505716 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717250702391

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 PolyORBLF-COL-S02J06T08-LTLFireability-01
ltl formula formula --ltl=/tmp/3494/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 674 places, 1290 transitions and 5636 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.210 real 0.050 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3494/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3494/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3494/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3494/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 688 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 675, there are 1373 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( 0/ 4): ~49 levels ~10000 states ~22648 transitions
pnml2lts-mc( 0/ 4): ~49 levels ~20000 states ~47148 transitions
pnml2lts-mc( 0/ 4): ~49 levels ~40000 states ~97236 transitions
pnml2lts-mc( 1/ 4): ~38 levels ~80000 states ~317188 transitions
pnml2lts-mc( 1/ 4): ~125 levels ~160000 states ~719720 transitions
pnml2lts-mc( 1/ 4): ~125 levels ~320000 states ~1272688 transitions
pnml2lts-mc( 0/ 4): ~229 levels ~640000 states ~2343128 transitions
pnml2lts-mc( 0/ 4): ~229 levels ~1280000 states ~4879448 transitions
pnml2lts-mc( 0/ 4): ~321 levels ~2560000 states ~9717884 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~370!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4265052
pnml2lts-mc( 0/ 4): unique states count: 4265833
pnml2lts-mc( 0/ 4): unique transitions count: 18000653
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 13731712
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 4266019
pnml2lts-mc( 0/ 4): - cum. max stack depth: 882
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4266019 states 18002360 transitions, fanout: 4.220
pnml2lts-mc( 0/ 4): Total exploration time 115.090 sec (115.070 sec minimum, 115.083 sec on average)
pnml2lts-mc( 0/ 4): States per second: 37067, Transitions per second: 156420
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 45.5MB, 11.2 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/20.0%
pnml2lts-mc( 0/ 4): Stored 1320 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 45.5MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S02J06T08-LTLFireability-09
ltl formula formula --ltl=/tmp/3494/ltl_1_
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 674 places, 1290 transitions and 5636 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.200 real 0.060 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3494/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3494/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3494/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3494/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 689 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 675, there are 1807 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): ~30 levels ~10000 states ~16604 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~20000 states ~33216 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~40000 states ~67608 transitions
pnml2lts-mc( 2/ 4): ~64 levels ~80000 states ~130656 transitions
pnml2lts-mc( 0/ 4): ~75 levels ~160000 states ~233264 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~296!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 178929
pnml2lts-mc( 0/ 4): unique states count: 179391
pnml2lts-mc( 0/ 4): unique transitions count: 270998
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 90063
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 181117
pnml2lts-mc( 0/ 4): - cum. max stack depth: 549
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 181117 states 276130 transitions, fanout: 1.525
pnml2lts-mc( 0/ 4): Total exploration time 4.640 sec (4.640 sec minimum, 4.640 sec on average)
pnml2lts-mc( 0/ 4): States per second: 39034, Transitions per second: 59511
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.4MB, 14.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 1320 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.4MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S02J06T08-LTLFireability-12
ltl formula formula --ltl=/tmp/3494/ltl_2_
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 674 places, 1290 transitions and 5636 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.200 real 0.040 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3494/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3494/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3494/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3494/ltl_2_
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): There are 689 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 675, there are 1294 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 ~395!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 782
pnml2lts-mc( 0/ 4): unique states count: 1978
pnml2lts-mc( 0/ 4): unique transitions count: 4810
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 390
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1991
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1209
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1991 states 4860 transitions, fanout: 2.441
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28443, Transitions per second: 69429
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 42.5 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1320 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~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="PolyORBLF-COL-S02J06T08"
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 PolyORBLF-COL-S02J06T08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446400108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;