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.r289-tajo-171654445200123.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 greatspnxred
Input is PolyORBLF-COL-S04J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 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.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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.8K 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-S04J04T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J04T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716849081661

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:31:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 22:31:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:31:23] [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-05-27 22:31:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:31:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 748 ms
[2024-05-27 22:31:24] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 47 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:31:24] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 22:31:24] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (18 resets) in 2895 ms. (13 steps per ms) remains 10/30 properties
BEST_FIRST walk for 40002 steps (8 resets) in 629 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (13 resets) in 353 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (11 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 218 ms. (182 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (10 resets) in 219 ms. (181 steps per ms) remains 10/10 properties
[2024-05-27 22:31:26] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:31:26] [INFO ] Computed 26 invariants in 16 ms
[2024-05-27 22:31:26] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 2 (OVERLAPS) 42/55 variables, 7/8 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/58 variables, 3/11 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 6 (OVERLAPS) 21/79 variables, 14/25 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 9 solved, 1 unsolved in 320 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: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/48 variables, 5/8 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/52 variables, 1/9 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 21 constraints, problems are : Problem set: 10 solved, 0 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:31:26] [INFO ] Flatten gal took : 27 ms
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:31:26] [INFO ] Flatten gal took : 10 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-05-27 22:31:26] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 82 ms.
[2024-05-27 22:31:26] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 227 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 548 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 548 transition count 1366
Applied a total of 12 rules in 96 ms. Remains 548 /554 variables (removed 6) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-05-27 22:31:26] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 548 cols
[2024-05-27 22:31:27] [INFO ] Computed 50 invariants in 81 ms
[2024-05-27 22:31:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:31:43] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 12 ms to minimize.
[2024-05-27 22:31:43] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 3 ms to minimize.
[2024-05-27 22:31:43] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 2 ms to minimize.
[2024-05-27 22:31:43] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-27 22:31:43] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:31:44] [INFO ] Deduced a trap composed of 150 places in 358 ms of which 3 ms to minimize.
[2024-05-27 22:31:45] [INFO ] Deduced a trap composed of 161 places in 463 ms of which 3 ms to minimize.
[2024-05-27 22:31:46] [INFO ] Deduced a trap composed of 313 places in 386 ms of which 13 ms to minimize.
[2024-05-27 22:31:46] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:31:46] [INFO ] Deduced a trap composed of 145 places in 217 ms of which 2 ms to minimize.
[2024-05-27 22:31:47] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1890 variables, and 53 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/548 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:32:01] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-27 22:32:09] [INFO ] Deduced a trap composed of 259 places in 315 ms of which 4 ms to minimize.
[2024-05-27 22:32:10] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 4 ms to minimize.
[2024-05-27 22:32:10] [INFO ] Deduced a trap composed of 292 places in 288 ms of which 3 ms to minimize.
[2024-05-27 22:32:11] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 4 ms to minimize.
[2024-05-27 22:32:11] [INFO ] Deduced a trap composed of 327 places in 311 ms of which 4 ms to minimize.
[2024-05-27 22:32:11] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 4 ms to minimize.
[2024-05-27 22:32:12] [INFO ] Deduced a trap composed of 351 places in 312 ms of which 4 ms to minimize.
SMT process timed out in 45347ms, After SMT, problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 45405ms
[2024-05-27 22:32:12] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-27 22:32:12] [INFO ] Invariant cache hit.
[2024-05-27 22:32:12] [INFO ] Implicit Places using invariants in 414 ms returned [432, 433, 434, 435, 436, 437]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 427 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 542/554 places, 1366/1372 transitions.
Applied a total of 0 rules in 17 ms. Remains 542 /542 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45981 ms. Remains : 542/554 places, 1366/1372 transitions.
Support contains 227 out of 542 places after structural reductions.
[2024-05-27 22:32:12] [INFO ] Flatten gal took : 141 ms
[2024-05-27 22:32:13] [INFO ] Flatten gal took : 113 ms
[2024-05-27 22:32:13] [INFO ] Input system was already deterministic with 1366 transitions.
RANDOM walk for 40000 steps (9 resets) in 569 ms. (70 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40003 steps (10 resets) in 342 ms. (116 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
[2024-05-27 22:32:13] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 542 cols
[2024-05-27 22:32:13] [INFO ] Computed 44 invariants in 53 ms
[2024-05-27 22:32:13] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 226/275 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/302 variables, 7/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 5 (OVERLAPS) 235/537 variables, 24/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/540 variables, 3/43 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1342/1882 variables, 540/583 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1882 variables, 120/703 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1882 variables, 0/703 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1884 variables, 2/705 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1884 variables, 1/706 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1884 variables, 0/706 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1884 variables, 0/706 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1884/1884 variables, and 706 constraints, problems are : Problem set: 2 solved, 1 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 542/542 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 232/269 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-27 22:32:15] [INFO ] Deduced a trap composed of 143 places in 224 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/296 variables, 7/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 535/1884 variables, and 39 constraints, problems are : Problem set: 3 solved, 0 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/542 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1511ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
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((p0||F(G(p1))))))'
Support contains 31 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 532 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 532 transition count 1360
Applied a total of 16 rules in 43 ms. Remains 532 /542 variables (removed 10) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:32:15] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-27 22:32:15] [INFO ] Computed 40 invariants in 33 ms
[2024-05-27 22:32:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:32:30] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:32:31] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-27 22:32:31] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 3 ms to minimize.
[2024-05-27 22:32:31] [INFO ] Deduced a trap composed of 157 places in 226 ms of which 3 ms to minimize.
[2024-05-27 22:32:32] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-05-27 22:32:34] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-05-27 22:32:34] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 279 places in 324 ms of which 3 ms to minimize.
[2024-05-27 22:32:38] [INFO ] Deduced a trap composed of 315 places in 323 ms of which 4 ms to minimize.
[2024-05-27 22:32:39] [INFO ] Deduced a trap composed of 303 places in 292 ms of which 4 ms to minimize.
[2024-05-27 22:32:39] [INFO ] Deduced a trap composed of 301 places in 265 ms of which 4 ms to minimize.
[2024-05-27 22:32:39] [INFO ] Deduced a trap composed of 330 places in 290 ms of which 4 ms to minimize.
[2024-05-27 22:32:39] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 3 ms to minimize.
[2024-05-27 22:32:40] [INFO ] Deduced a trap composed of 297 places in 265 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 (/ 1.0 4.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 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 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.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 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.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 1.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 1.0)
(s229 0.0)
(s230 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 50 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:32:42] [INFO ] Deduced a trap composed of 259 places in 253 ms of which 7 ms to minimize.
[2024-05-27 22:32:58] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2024-05-27 22:32:59] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 4 ms to minimize.
[2024-05-27 22:32:59] [INFO ] Deduced a trap composed of 277 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:33:00] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:33:00] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 5 ms to minimize.
SMT process timed out in 44890ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44907ms
[2024-05-27 22:33:00] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:33:00] [INFO ] Invariant cache hit.
[2024-05-27 22:33:01] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-27 22:33:01] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:33:01] [INFO ] Invariant cache hit.
[2024-05-27 22:33:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:33:07] [INFO ] Implicit Places using invariants and state equation in 6552 ms returned []
Implicit Place search using SMT with State Equation took 7018 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:33:07] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:33:07] [INFO ] Invariant cache hit.
[2024-05-27 22:33:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:33:23] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 2 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:33:24] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:33:26] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:33:28] [INFO ] Deduced a trap composed of 279 places in 256 ms of which 3 ms to minimize.
[2024-05-27 22:33:28] [INFO ] Deduced a trap composed of 299 places in 338 ms of which 4 ms to minimize.
[2024-05-27 22:33:28] [INFO ] Deduced a trap composed of 369 places in 348 ms of which 4 ms to minimize.
[2024-05-27 22:33:29] [INFO ] Deduced a trap composed of 291 places in 321 ms of which 5 ms to minimize.
[2024-05-27 22:33:38] [INFO ] Deduced a trap composed of 149 places in 330 ms of which 4 ms to minimize.
[2024-05-27 22:33:42] [INFO ] Deduced a trap composed of 319 places in 238 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 49 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:33:50] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-05-27 22:33:58] [INFO ] Deduced a trap composed of 280 places in 256 ms of which 3 ms to minimize.
[2024-05-27 22:34:01] [INFO ] Deduced a trap composed of 98 places in 274 ms of which 4 ms to minimize.
[2024-05-27 22:34:02] [INFO ] Deduced a trap composed of 248 places in 209 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:34:06] [INFO ] Deduced a trap composed of 267 places in 228 ms of which 4 ms to minimize.
[2024-05-27 22:34:06] [INFO ] Deduced a trap composed of 305 places in 287 ms of which 3 ms to minimize.
[2024-05-27 22:34:06] [INFO ] Deduced a trap composed of 309 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 56 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 20/20 constraints]
After SMT, in 64860ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 64884ms
Starting structural reductions in LTL mode, iteration 1 : 532/542 places, 1360/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116863 ms. Remains : 532/542 places, 1360/1366 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-01
Product exploration explored 100000 steps with 6 reset in 434 ms.
Stack based approach found an accepted trace after 5196 steps with 0 reset with depth 5197 and stack size 5191 in 54 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-01 finished in 117783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1 U p2)))))'
Support contains 38 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 532 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 532 transition count 1360
Applied a total of 16 rules in 41 ms. Remains 532 /542 variables (removed 10) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:34:13] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-27 22:34:13] [INFO ] Computed 40 invariants in 27 ms
[2024-05-27 22:34:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:34:29] [INFO ] Deduced a trap composed of 98 places in 218 ms of which 2 ms to minimize.
[2024-05-27 22:34:29] [INFO ] Deduced a trap composed of 133 places in 198 ms of which 3 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 241 places in 243 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 38 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:34:46] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-05-27 22:34:46] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-27 22:34:54] [INFO ] Deduced a trap composed of 262 places in 248 ms of which 4 ms to minimize.
[2024-05-27 22:34:54] [INFO ] Deduced a trap composed of 258 places in 221 ms of which 2 ms to minimize.
[2024-05-27 22:34:54] [INFO ] Deduced a trap composed of 90 places in 187 ms of which 2 ms to minimize.
[2024-05-27 22:34:54] [INFO ] Deduced a trap composed of 110 places in 168 ms of which 2 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 2 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 273 places in 299 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 46 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 46073ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 46111ms
[2024-05-27 22:34:59] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:34:59] [INFO ] Invariant cache hit.
[2024-05-27 22:34:59] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-27 22:34:59] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:34:59] [INFO ] Invariant cache hit.
[2024-05-27 22:35:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:35:07] [INFO ] Implicit Places using invariants and state equation in 7901 ms returned []
Implicit Place search using SMT with State Equation took 8285 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:35:07] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:35:07] [INFO ] Invariant cache hit.
[2024-05-27 22:35:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:35:22] [INFO ] Deduced a trap composed of 98 places in 172 ms of which 3 ms to minimize.
[2024-05-27 22:35:22] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 3 ms to minimize.
[2024-05-27 22:35:23] [INFO ] Deduced a trap composed of 305 places in 199 ms of which 2 ms to minimize.
[2024-05-27 22:35:33] [INFO ] Deduced a trap composed of 258 places in 215 ms of which 4 ms to minimize.
[2024-05-27 22:35:33] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
[2024-05-27 22:35:34] [INFO ] Deduced a trap composed of 272 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:35:51] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 4 ms to minimize.
[2024-05-27 22:35:51] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-05-27 22:35:51] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:36:10] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 45 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 10/10 constraints]
After SMT, in 65412ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 65426ms
Starting structural reductions in LTL mode, iteration 1 : 532/542 places, 1360/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119873 ms. Remains : 532/542 places, 1360/1366 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 888 ms.
Product exploration explored 100000 steps with 50000 reset in 557 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 p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 p1))), (X (X p1))]
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 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-05 finished in 121588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 30 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 532 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 532 transition count 1360
Applied a total of 16 rules in 43 ms. Remains 532 /542 variables (removed 10) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:36:14] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-27 22:36:14] [INFO ] Computed 40 invariants in 21 ms
[2024-05-27 22:36:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:36:31] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 1 ms to minimize.
[2024-05-27 22:36:31] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:36:32] [INFO ] Deduced a trap composed of 74 places in 303 ms of which 4 ms to minimize.
[2024-05-27 22:36:32] [INFO ] Deduced a trap composed of 157 places in 268 ms of which 4 ms to minimize.
[2024-05-27 22:36:33] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-27 22:36:35] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 3 ms to minimize.
[2024-05-27 22:36:35] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:36:39] [INFO ] Deduced a trap composed of 279 places in 307 ms of which 3 ms to minimize.
[2024-05-27 22:36:40] [INFO ] Deduced a trap composed of 315 places in 351 ms of which 4 ms to minimize.
[2024-05-27 22:36:40] [INFO ] Deduced a trap composed of 303 places in 307 ms of which 3 ms to minimize.
[2024-05-27 22:36:40] [INFO ] Deduced a trap composed of 301 places in 282 ms of which 3 ms to minimize.
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 330 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:36:41] [INFO ] Deduced a trap composed of 326 places in 341 ms of which 4 ms to minimize.
SMT process timed out in 26494ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 26522ms
[2024-05-27 22:36:41] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:36:41] [INFO ] Invariant cache hit.
[2024-05-27 22:36:41] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-27 22:36:41] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:36:41] [INFO ] Invariant cache hit.
[2024-05-27 22:36:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:36:49] [INFO ] Implicit Places using invariants and state equation in 7395 ms returned []
Implicit Place search using SMT with State Equation took 7756 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-27 22:36:49] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-27 22:36:49] [INFO ] Invariant cache hit.
[2024-05-27 22:36:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:37:04] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:37:04] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2024-05-27 22:37:04] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2024-05-27 22:37:05] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 2 ms to minimize.
[2024-05-27 22:37:06] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:37:06] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 0 ms to minimize.
[2024-05-27 22:37:07] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 0 ms to minimize.
[2024-05-27 22:37:09] [INFO ] Deduced a trap composed of 279 places in 288 ms of which 3 ms to minimize.
[2024-05-27 22:37:09] [INFO ] Deduced a trap composed of 299 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:37:09] [INFO ] Deduced a trap composed of 369 places in 248 ms of which 2 ms to minimize.
[2024-05-27 22:37:10] [INFO ] Deduced a trap composed of 291 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:37:20] [INFO ] Deduced a trap composed of 149 places in 317 ms of which 4 ms to minimize.
[2024-05-27 22:37:23] [INFO ] Deduced a trap composed of 319 places in 234 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 49 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:37:32] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2024-05-27 22:37:38] [INFO ] Deduced a trap composed of 280 places in 241 ms of which 3 ms to minimize.
[2024-05-27 22:37:42] [INFO ] Deduced a trap composed of 98 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:37:42] [INFO ] Deduced a trap composed of 248 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-27 22:37:46] [INFO ] Deduced a trap composed of 267 places in 299 ms of which 4 ms to minimize.
[2024-05-27 22:37:46] [INFO ] Deduced a trap composed of 305 places in 264 ms of which 4 ms to minimize.
[2024-05-27 22:37:46] [INFO ] Deduced a trap composed of 309 places in 261 ms of which 3 ms to minimize.
[2024-05-27 22:37:53] [INFO ] Deduced a trap composed of 312 places in 291 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 57 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 21/21 constraints]
After SMT, in 65211ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 65239ms
Starting structural reductions in LTL mode, iteration 1 : 532/542 places, 1360/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99583 ms. Remains : 532/542 places, 1360/1366 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-09 finished in 99827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 336 place count 370 transition count 1198
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 342 place count 364 transition count 1192
Iterating global reduction 2 with 6 rules applied. Total rules applied 348 place count 364 transition count 1192
Applied a total of 348 rules in 201 ms. Remains 364 /542 variables (removed 178) and now considering 1192/1366 (removed 174) transitions.
Running 1188 sub problems to find dead transitions.
[2024-05-27 22:37:54] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
// Phase 1: matrix 1168 rows 364 cols
[2024-05-27 22:37:54] [INFO ] Computed 40 invariants in 24 ms
[2024-05-27 22:37:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:38:05] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2024-05-27 22:38:06] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2024-05-27 22:38:06] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-27 22:38:06] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:38:06] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2024-05-27 22:38:06] [INFO ] Deduced a trap composed of 157 places in 263 ms of which 3 ms to minimize.
[2024-05-27 22:38:06] [INFO ] Deduced a trap composed of 167 places in 306 ms of which 3 ms to minimize.
[2024-05-27 22:38:07] [INFO ] Deduced a trap composed of 191 places in 315 ms of which 3 ms to minimize.
[2024-05-27 22:38:07] [INFO ] Deduced a trap composed of 171 places in 304 ms of which 3 ms to minimize.
[2024-05-27 22:38:07] [INFO ] Deduced a trap composed of 164 places in 315 ms of which 2 ms to minimize.
[2024-05-27 22:38:08] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 1 ms to minimize.
[2024-05-27 22:38:09] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 48 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:38:22] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-27 22:38:30] [INFO ] Deduced a trap composed of 120 places in 220 ms of which 3 ms to minimize.
[2024-05-27 22:38:31] [INFO ] Deduced a trap composed of 92 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:38:34] [INFO ] Deduced a trap composed of 178 places in 238 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1532 variables, and 52 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 16/16 constraints]
After SMT, in 44841ms problems are : Problem set: 0 solved, 1188 unsolved
Search for dead transitions found 0 dead transitions in 44856ms
[2024-05-27 22:38:39] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:38:39] [INFO ] Invariant cache hit.
[2024-05-27 22:38:40] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-27 22:38:40] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:38:40] [INFO ] Invariant cache hit.
[2024-05-27 22:38:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:38:44] [INFO ] Implicit Places using invariants and state equation in 4435 ms returned []
Implicit Place search using SMT with State Equation took 4853 ms to find 0 implicit places.
[2024-05-27 22:38:44] [INFO ] Redundant transitions in 76 ms returned []
Running 1188 sub problems to find dead transitions.
[2024-05-27 22:38:44] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:38:44] [INFO ] Invariant cache hit.
[2024-05-27 22:38:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:38:55] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-05-27 22:38:55] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2024-05-27 22:38:55] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:38:55] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2024-05-27 22:38:55] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:38:55] [INFO ] Deduced a trap composed of 162 places in 296 ms of which 3 ms to minimize.
[2024-05-27 22:38:55] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:39:03] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 2 ms to minimize.
[2024-05-27 22:39:05] [INFO ] Deduced a trap composed of 120 places in 185 ms of which 3 ms to minimize.
[2024-05-27 22:39:06] [INFO ] Deduced a trap composed of 116 places in 196 ms of which 2 ms to minimize.
[2024-05-27 22:39:07] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 3 ms to minimize.
[2024-05-27 22:39:07] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 5 ms to minimize.
[2024-05-27 22:39:07] [INFO ] Deduced a trap composed of 73 places in 229 ms of which 3 ms to minimize.
[2024-05-27 22:39:07] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 2 ms to minimize.
[2024-05-27 22:39:08] [INFO ] Deduced a trap composed of 61 places in 223 ms of which 3 ms to minimize.
[2024-05-27 22:39:08] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 2 ms to minimize.
[2024-05-27 22:39:08] [INFO ] Deduced a trap composed of 57 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:39:11] [INFO ] Deduced a trap composed of 178 places in 201 ms of which 2 ms to minimize.
[2024-05-27 22:39:19] [INFO ] Deduced a trap composed of 147 places in 221 ms of which 2 ms to minimize.
SMT process timed out in 34679ms, After SMT, problems are : Problem set: 0 solved, 1188 unsolved
Search for dead transitions found 0 dead transitions in 34691ms
Starting structural reductions in SI_LTL mode, iteration 1 : 364/542 places, 1192/1366 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84687 ms. Remains : 364/542 places, 1192/1366 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-10
Product exploration explored 100000 steps with 2120 reset in 364 ms.
Product exploration explored 100000 steps with 2107 reset in 360 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 94 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT 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 80 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 1192/1192 transitions.
Applied a total of 0 rules in 24 ms. Remains 364 /364 variables (removed 0) and now considering 1192/1192 (removed 0) transitions.
Running 1188 sub problems to find dead transitions.
[2024-05-27 22:39:20] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:39:20] [INFO ] Invariant cache hit.
[2024-05-27 22:39:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:39:31] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-27 22:39:31] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:39:31] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:39:31] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 0 ms to minimize.
[2024-05-27 22:39:31] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-05-27 22:39:32] [INFO ] Deduced a trap composed of 162 places in 258 ms of which 2 ms to minimize.
[2024-05-27 22:39:32] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:39:40] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 2 ms to minimize.
[2024-05-27 22:39:42] [INFO ] Deduced a trap composed of 120 places in 261 ms of which 2 ms to minimize.
[2024-05-27 22:39:43] [INFO ] Deduced a trap composed of 116 places in 216 ms of which 4 ms to minimize.
[2024-05-27 22:39:43] [INFO ] Deduced a trap composed of 140 places in 261 ms of which 2 ms to minimize.
[2024-05-27 22:39:43] [INFO ] Deduced a trap composed of 83 places in 241 ms of which 2 ms to minimize.
[2024-05-27 22:39:44] [INFO ] Deduced a trap composed of 73 places in 245 ms of which 3 ms to minimize.
[2024-05-27 22:39:44] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 2 ms to minimize.
[2024-05-27 22:39:44] [INFO ] Deduced a trap composed of 61 places in 277 ms of which 2 ms to minimize.
[2024-05-27 22:39:45] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 2 ms to minimize.
SMT process timed out in 24544ms, After SMT, problems are : Problem set: 0 solved, 1188 unsolved
Search for dead transitions found 0 dead transitions in 24556ms
[2024-05-27 22:39:45] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:39:45] [INFO ] Invariant cache hit.
[2024-05-27 22:39:45] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-27 22:39:45] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:39:45] [INFO ] Invariant cache hit.
[2024-05-27 22:39:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:39:49] [INFO ] Implicit Places using invariants and state equation in 4334 ms returned []
Implicit Place search using SMT with State Equation took 4701 ms to find 0 implicit places.
[2024-05-27 22:39:49] [INFO ] Redundant transitions in 9 ms returned []
Running 1188 sub problems to find dead transitions.
[2024-05-27 22:39:49] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-05-27 22:39:49] [INFO ] Invariant cache hit.
[2024-05-27 22:39:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:40:02] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-05-27 22:40:02] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:40:02] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:40:02] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-27 22:40:02] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:40:03] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 2 ms to minimize.
[2024-05-27 22:40:03] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 2 ms to minimize.
[2024-05-27 22:40:10] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 2 ms to minimize.
[2024-05-27 22:40:12] [INFO ] Deduced a trap composed of 120 places in 259 ms of which 2 ms to minimize.
[2024-05-27 22:40:13] [INFO ] Deduced a trap composed of 116 places in 255 ms of which 3 ms to minimize.
[2024-05-27 22:40:14] [INFO ] Deduced a trap composed of 140 places in 313 ms of which 3 ms to minimize.
[2024-05-27 22:40:14] [INFO ] Deduced a trap composed of 83 places in 272 ms of which 3 ms to minimize.
[2024-05-27 22:40:14] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 3 ms to minimize.
[2024-05-27 22:40:14] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:40:15] [INFO ] Deduced a trap composed of 61 places in 244 ms of which 2 ms to minimize.
[2024-05-27 22:40:15] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 3 ms to minimize.
[2024-05-27 22:40:15] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:40:18] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 54 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-05-27 22:40:27] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2024-05-27 22:40:29] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 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 TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/361 variables, 1/57 constraints. Problems are: Problem set: 90 solved, 1098 unsolved
[2024-05-27 22:40:55] [INFO ] Deduced a trap composed of 121 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 65843ms, After SMT, problems are : Problem set: 90 solved, 1098 unsolved
Search for dead transitions found 90 dead transitions in 65855ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 364/364 places, 1102/1192 transitions.
Applied a total of 0 rules in 24 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
[2024-05-27 22:40:55] [INFO ] Redundant transitions in 46 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 95233 ms. Remains : 364/364 places, 1102/1192 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 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 106 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 78 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 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 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2117 reset in 371 ms.
Product exploration explored 100000 steps with 2110 reset in 371 ms.
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 1102/1102 transitions.
Applied a total of 0 rules in 19 ms. Remains 364 /364 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-27 22:40:57] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
// Phase 1: matrix 1078 rows 364 cols
[2024-05-27 22:40:57] [INFO ] Computed 40 invariants in 37 ms
[2024-05-27 22:40:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:41:06] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:41:06] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-05-27 22:41:06] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:41:06] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:41:06] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:41:06] [INFO ] Deduced a trap composed of 153 places in 215 ms of which 3 ms to minimize.
[2024-05-27 22:41:07] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-27 22:41:08] [INFO ] Deduced a trap composed of 143 places in 209 ms of which 2 ms to minimize.
[2024-05-27 22:41:09] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 2 ms to minimize.
[2024-05-27 22:41:09] [INFO ] Deduced a trap composed of 182 places in 266 ms of which 3 ms to minimize.
[2024-05-27 22:41:09] [INFO ] Deduced a trap composed of 200 places in 206 ms of which 3 ms to minimize.
[2024-05-27 22:41:09] [INFO ] Deduced a trap composed of 191 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:41:17] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 2 ms to minimize.
[2024-05-27 22:41:17] [INFO ] Deduced a trap composed of 141 places in 243 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 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 50 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:41:30] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 3 ms to minimize.
[2024-05-27 22:41:31] [INFO ] Deduced a trap composed of 120 places in 188 ms of which 2 ms to minimize.
[2024-05-27 22:41:31] [INFO ] Deduced a trap composed of 116 places in 243 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:41:33] [INFO ] Deduced a trap composed of 191 places in 221 ms of which 2 ms to minimize.
[2024-05-27 22:41:33] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1442 variables, and 55 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 19/19 constraints]
After SMT, in 43442ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 43452ms
[2024-05-27 22:41:40] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:41:40] [INFO ] Invariant cache hit.
[2024-05-27 22:41:40] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-27 22:41:40] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:41:40] [INFO ] Invariant cache hit.
[2024-05-27 22:41:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:41:45] [INFO ] Implicit Places using invariants and state equation in 4993 ms returned []
Implicit Place search using SMT with State Equation took 5308 ms to find 0 implicit places.
[2024-05-27 22:41:45] [INFO ] Redundant transitions in 11 ms returned []
Running 1098 sub problems to find dead transitions.
[2024-05-27 22:41:45] [INFO ] Flow matrix only has 1078 transitions (discarded 24 similar events)
[2024-05-27 22:41:45] [INFO ] Invariant cache hit.
[2024-05-27 22:41:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:41:55] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:41:55] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-05-27 22:41:55] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 1 ms to minimize.
[2024-05-27 22:41:55] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-05-27 22:41:55] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:41:56] [INFO ] Deduced a trap composed of 146 places in 278 ms of which 2 ms to minimize.
[2024-05-27 22:41:56] [INFO ] Deduced a trap composed of 141 places in 387 ms of which 3 ms to minimize.
[2024-05-27 22:41:57] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 3 ms to minimize.
[2024-05-27 22:41:57] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:41:57] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 1 ms to minimize.
[2024-05-27 22:41:58] [INFO ] Deduced a trap composed of 193 places in 244 ms of which 3 ms to minimize.
[2024-05-27 22:42:05] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2024-05-27 22:42:06] [INFO ] Deduced a trap composed of 140 places in 203 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:42:08] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1442 variables, and 50 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:42:20] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 2 ms to minimize.
[2024-05-27 22:42:21] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 2 ms to minimize.
[2024-05-27 22:42:21] [INFO ] Deduced a trap composed of 153 places in 223 ms of which 2 ms to minimize.
[2024-05-27 22:42:21] [INFO ] Deduced a trap composed of 169 places in 203 ms of which 2 ms to minimize.
[2024-05-27 22:42:21] [INFO ] Deduced a trap composed of 157 places in 194 ms of which 2 ms to minimize.
[2024-05-27 22:42:21] [INFO ] Deduced a trap composed of 155 places in 229 ms of which 2 ms to minimize.
[2024-05-27 22:42:22] [INFO ] Deduced a trap composed of 182 places in 215 ms of which 2 ms to minimize.
[2024-05-27 22:42:31] [INFO ] Deduced a trap composed of 120 places in 195 ms of which 2 ms to minimize.
[2024-05-27 22:42:31] [INFO ] Deduced a trap composed of 120 places in 215 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-27 22:42:35] [INFO ] Deduced a trap composed of 114 places in 205 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1442 variables, and 60 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 24/24 constraints]
After SMT, in 63658ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 63669ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112471 ms. Remains : 364/364 places, 1102/1102 transitions.
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-10 finished in 295247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 324 place count 376 transition count 1204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 330 place count 370 transition count 1198
Iterating global reduction 2 with 6 rules applied. Total rules applied 336 place count 370 transition count 1198
Applied a total of 336 rules in 97 ms. Remains 370 /542 variables (removed 172) and now considering 1198/1366 (removed 168) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-27 22:42:50] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
// Phase 1: matrix 1174 rows 370 cols
[2024-05-27 22:42:50] [INFO ] Computed 40 invariants in 28 ms
[2024-05-27 22:42:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 22:43:02] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-27 22:43:02] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:43:02] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:43:02] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-27 22:43:02] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:43:02] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 2 ms to minimize.
[2024-05-27 22:43:02] [INFO ] Deduced a trap composed of 145 places in 196 ms of which 2 ms to minimize.
[2024-05-27 22:43:03] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-27 22:43:04] [INFO ] Deduced a trap composed of 184 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 39.0 4.0))
(s1 (/ 1.0 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 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.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 1.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 2.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 9.0)
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 (/ 1.0 4.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 (/ 1.0 4.0))
(s153 (/ 3.0 4.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 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 (/ 1.0 2.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 1.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 1.0)
(s221 (/ 3.0 4.0))
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 4.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 0.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 (/ 1.0 4.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 45 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 22:43:20] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-27 22:43:30] [INFO ] Deduced a trap composed of 213 places in 232 ms of which 2 ms to minimize.
[2024-05-27 22:43:30] [INFO ] Deduced a trap composed of 120 places in 234 ms of which 2 ms to minimize.
[2024-05-27 22:43:31] [INFO ] Deduced a trap composed of 118 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 49 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 13/13 constraints]
After SMT, in 45827ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 45852ms
[2024-05-27 22:43:35] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 22:43:35] [INFO ] Invariant cache hit.
[2024-05-27 22:43:36] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-27 22:43:36] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 22:43:36] [INFO ] Invariant cache hit.
[2024-05-27 22:43:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:43:40] [INFO ] Implicit Places using invariants and state equation in 4521 ms returned []
Implicit Place search using SMT with State Equation took 4835 ms to find 0 implicit places.
[2024-05-27 22:43:40] [INFO ] Redundant transitions in 9 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-27 22:43:40] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-27 22:43:40] [INFO ] Invariant cache hit.
[2024-05-27 22:43:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 22:43:53] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-05-27 22:43:53] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-05-27 22:43:53] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 1 ms to minimize.
[2024-05-27 22:43:53] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:43:53] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-05-27 22:43:53] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:43:54] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 3 ms to minimize.
[2024-05-27 22:43:54] [INFO ] Deduced a trap composed of 151 places in 218 ms of which 2 ms to minimize.
[2024-05-27 22:43:55] [INFO ] Deduced a trap composed of 184 places in 195 ms of which 3 ms to minimize.
[2024-05-27 22:44:05] [INFO ] Deduced a trap composed of 120 places in 199 ms of which 3 ms to minimize.
[2024-05-27 22:44:06] [INFO ] Deduced a trap composed of 103 places in 205 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 22:44:08] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-05-27 22:44:08] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 49 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 22:44:17] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-27 22:44:25] [INFO ] Deduced a trap composed of 57 places in 226 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-27 22:44:36] [INFO ] Deduced a trap composed of 126 places in 252 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 52 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 16/16 constraints]
After SMT, in 65369ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 65380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 370/542 places, 1198/1366 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116188 ms. Remains : 370/542 places, 1198/1366 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-12
Product exploration explored 100000 steps with 13 reset in 375 ms.
Stack based approach found an accepted trace after 1515 steps with 0 reset with depth 1516 and stack size 1516 in 7 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-12 finished in 116689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 65 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 84 place count 496 transition count 1288
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 156 place count 460 transition count 1288
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 228 place count 424 transition count 1252
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 418 transition count 1246
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 418 transition count 1246
Applied a total of 240 rules in 97 ms. Remains 418 /542 variables (removed 124) and now considering 1246/1366 (removed 120) transitions.
Running 1242 sub problems to find dead transitions.
[2024-05-27 22:44:46] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
// Phase 1: matrix 1222 rows 418 cols
[2024-05-27 22:44:46] [INFO ] Computed 40 invariants in 15 ms
[2024-05-27 22:44:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-05-27 22:45:00] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2024-05-27 22:45:00] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:45:00] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 0 ms to minimize.
[2024-05-27 22:45:00] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:45:00] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:45:00] [INFO ] Deduced a trap composed of 89 places in 181 ms of which 2 ms to minimize.
[2024-05-27 22:45:01] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:45:02] [INFO ] Deduced a trap composed of 240 places in 258 ms of which 3 ms to minimize.
[2024-05-27 22:45:02] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 2 ms to minimize.
[2024-05-27 22:45:02] [INFO ] Deduced a trap composed of 195 places in 249 ms of which 2 ms to minimize.
[2024-05-27 22:45:11] [INFO ] Deduced a trap composed of 252 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:45:12] [INFO ] Deduced a trap composed of 160 places in 249 ms of which 3 ms to minimize.
SMT process timed out in 25774ms, After SMT, problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 25786ms
[2024-05-27 22:45:12] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-05-27 22:45:12] [INFO ] Invariant cache hit.
[2024-05-27 22:45:12] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-27 22:45:12] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-05-27 22:45:12] [INFO ] Invariant cache hit.
[2024-05-27 22:45:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:45:18] [INFO ] Implicit Places using invariants and state equation in 5395 ms returned []
Implicit Place search using SMT with State Equation took 5728 ms to find 0 implicit places.
[2024-05-27 22:45:18] [INFO ] Redundant transitions in 10 ms returned []
Running 1242 sub problems to find dead transitions.
[2024-05-27 22:45:18] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-05-27 22:45:18] [INFO ] Invariant cache hit.
[2024-05-27 22:45:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-05-27 22:45:32] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 1 ms to minimize.
[2024-05-27 22:45:32] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2024-05-27 22:45:32] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:45:32] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:45:32] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:45:32] [INFO ] Deduced a trap composed of 87 places in 236 ms of which 2 ms to minimize.
[2024-05-27 22:45:33] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 0 ms to minimize.
[2024-05-27 22:45:33] [INFO ] Deduced a trap composed of 200 places in 237 ms of which 3 ms to minimize.
[2024-05-27 22:45:34] [INFO ] Deduced a trap composed of 221 places in 234 ms of which 3 ms to minimize.
[2024-05-27 22:45:34] [INFO ] Deduced a trap composed of 207 places in 281 ms of which 3 ms to minimize.
[2024-05-27 22:45:35] [INFO ] Deduced a trap composed of 195 places in 261 ms of which 5 ms to minimize.
[2024-05-27 22:45:35] [INFO ] Deduced a trap composed of 215 places in 441 ms of which 3 ms to minimize.
[2024-05-27 22:45:35] [INFO ] Deduced a trap composed of 202 places in 406 ms of which 2 ms to minimize.
[2024-05-27 22:45:36] [INFO ] Deduced a trap composed of 228 places in 413 ms of which 2 ms to minimize.
[2024-05-27 22:45:37] [INFO ] Deduced a trap composed of 194 places in 750 ms of which 2 ms to minimize.
[2024-05-27 22:45:37] [INFO ] Deduced a trap composed of 212 places in 242 ms of which 2 ms to minimize.
[2024-05-27 22:45:38] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 1 ms to minimize.
[2024-05-27 22:45:49] [INFO ] Deduced a trap composed of 207 places in 213 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1640 variables, and 54 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1242/1242 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-05-27 22:45:56] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2024-05-27 22:46:08] [INFO ] Deduced a trap composed of 36 places in 273 ms of which 3 ms to minimize.
[2024-05-27 22:46:14] [INFO ] Deduced a trap composed of 174 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1640 variables, and 57 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1242 constraints, Known Traps: 21/21 constraints]
After SMT, in 65880ms problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 65893ms
Starting structural reductions in SI_LTL mode, iteration 1 : 418/542 places, 1246/1366 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97536 ms. Remains : 418/542 places, 1246/1366 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-13
Product exploration explored 100000 steps with 640 reset in 435 ms.
Product exploration explored 100000 steps with 680 reset in 442 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 196 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (10 resets) in 552 ms. (72 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
[2024-05-27 22:46:25] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-05-27 22:46:25] [INFO ] Invariant cache hit.
[2024-05-27 22:46:25] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/241 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/409 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/413 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/416 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1222/1638 variables, 416/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1638 variables, 120/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1638 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1640 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1640 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1640 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1640 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1640/1640 variables, and 578 constraints, problems are : Problem set: 0 solved, 1 unsolved in 896 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 418/418 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 241/1640 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 5/15 constraints, Generalized P Invariants (flows): 0/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 988ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Support contains 40 out of 418 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 1246/1246 transitions.
Applied a total of 0 rules in 27 ms. Remains 418 /418 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Running 1242 sub problems to find dead transitions.
[2024-05-27 22:46:27] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-05-27 22:46:27] [INFO ] Invariant cache hit.
[2024-05-27 22:46:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-05-27 22:46:42] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 2 ms to minimize.
[2024-05-27 22:46:42] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 1 ms to minimize.
[2024-05-27 22:46:42] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2024-05-27 22:46:42] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2024-05-27 22:46:42] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:46:42] [INFO ] Deduced a trap composed of 87 places in 198 ms of which 2 ms to minimize.
[2024-05-27 22:46:43] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:46:43] [INFO ] Deduced a trap composed of 200 places in 221 ms of which 3 ms to minimize.
[2024-05-27 22:46:44] [INFO ] Deduced a trap composed of 221 places in 254 ms of which 15 ms to minimize.
[2024-05-27 22:46:44] [INFO ] Deduced a trap composed of 207 places in 229 ms of which 2 ms to minimize.
[2024-05-27 22:46:44] [INFO ] Deduced a trap composed of 195 places in 246 ms of which 3 ms to minimize.
[2024-05-27 22:46:45] [INFO ] Deduced a trap composed of 215 places in 264 ms of which 2 ms to minimize.
[2024-05-27 22:46:45] [INFO ] Deduced a trap composed of 202 places in 241 ms of which 2 ms to minimize.
[2024-05-27 22:46:45] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 3 ms to minimize.
[2024-05-27 22:46:45] [INFO ] Deduced a trap composed of 194 places in 242 ms of which 2 ms to minimize.
[2024-05-27 22:46:46] [INFO ] Deduced a trap composed of 212 places in 238 ms of which 2 ms to minimize.
[2024-05-27 22:46:47] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1640 variables, and 53 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1242/1242 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-05-27 22:47:04] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 2 ms to minimize.
[2024-05-27 22:47:07] [INFO ] Deduced a trap composed of 245 places in 226 ms of which 2 ms to minimize.
[2024-05-27 22:47:07] [INFO ] Deduced a trap composed of 174 places in 214 ms of which 2 ms to minimize.
[2024-05-27 22:47:07] [INFO ] Deduced a trap composed of 208 places in 210 ms of which 2 ms to minimize.
[2024-05-27 22:47:08] [INFO ] Deduced a trap composed of 190 places in 205 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1640 variables, and 58 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1242 constraints, Known Traps: 22/22 constraints]
After SMT, in 45413ms problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 45441ms
[2024-05-27 22:47:12] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-05-27 22:47:12] [INFO ] Invariant cache hit.
[2024-05-27 22:47:12] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-27 22:47:12] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-05-27 22:47:12] [INFO ] Invariant cache hit.
[2024-05-27 22:47:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:47:18] [INFO ] Implicit Places using invariants and state equation in 5284 ms returned []
Implicit Place search using SMT with State Equation took 5671 ms to find 0 implicit places.
[2024-05-27 22:47:18] [INFO ] Redundant transitions in 13 ms returned []
Running 1242 sub problems to find dead transitions.
[2024-05-27 22:47:18] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-05-27 22:47:18] [INFO ] Invariant cache hit.
[2024-05-27 22:47:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-05-27 22:47:31] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-05-27 22:47:31] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-05-27 22:47:31] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:47:31] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:47:32] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:47:32] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 3 ms to minimize.
[2024-05-27 22:47:32] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 0 ms to minimize.
[2024-05-27 22:47:33] [INFO ] Deduced a trap composed of 200 places in 226 ms of which 2 ms to minimize.
[2024-05-27 22:47:33] [INFO ] Deduced a trap composed of 221 places in 235 ms of which 2 ms to minimize.
[2024-05-27 22:47:34] [INFO ] Deduced a trap composed of 207 places in 239 ms of which 2 ms to minimize.
[2024-05-27 22:47:34] [INFO ] Deduced a trap composed of 195 places in 239 ms of which 2 ms to minimize.
[2024-05-27 22:47:34] [INFO ] Deduced a trap composed of 215 places in 237 ms of which 3 ms to minimize.
[2024-05-27 22:47:34] [INFO ] Deduced a trap composed of 202 places in 236 ms of which 3 ms to minimize.
[2024-05-27 22:47:35] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 2 ms to minimize.
[2024-05-27 22:47:35] [INFO ] Deduced a trap composed of 194 places in 234 ms of which 2 ms to minimize.
[2024-05-27 22:47:35] [INFO ] Deduced a trap composed of 212 places in 231 ms of which 2 ms to minimize.
[2024-05-27 22:47:36] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 1 ms to minimize.
[2024-05-27 22:47:48] [INFO ] Deduced a trap composed of 207 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1640 variables, and 54 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1242/1242 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-05-27 22:47:56] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-27 22:48:05] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 2 ms to minimize.
[2024-05-27 22:48:10] [INFO ] Deduced a trap composed of 174 places in 254 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1640 variables, and 57 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1242 constraints, Known Traps: 21/21 constraints]
After SMT, in 65523ms problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 65538ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116723 ms. Remains : 418/418 places, 1246/1246 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 77 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 662 steps (0 resets) in 9 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 79 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 667 reset in 326 ms.
Product exploration explored 100000 steps with 655 reset in 368 ms.
Support contains 40 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 1246/1246 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 418 transition count 1222
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 394 transition count 1222
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 388 transition count 1216
Applied a total of 60 rules in 29 ms. Remains 388 /418 variables (removed 30) and now considering 1216/1246 (removed 30) transitions.
Running 1212 sub problems to find dead transitions.
[2024-05-27 22:48:24] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
// Phase 1: matrix 1192 rows 388 cols
[2024-05-27 22:48:24] [INFO ] Computed 40 invariants in 15 ms
[2024-05-27 22:48:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 22:48:37] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:48:37] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-05-27 22:48:37] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:48:37] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-27 22:48:37] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-27 22:48:38] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2024-05-27 22:48:38] [INFO ] Deduced a trap composed of 177 places in 229 ms of which 2 ms to minimize.
[2024-05-27 22:48:47] [INFO ] Deduced a trap composed of 83 places in 184 ms of which 2 ms to minimize.
[2024-05-27 22:48:48] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 2 ms to minimize.
[2024-05-27 22:48:48] [INFO ] Deduced a trap composed of 182 places in 236 ms of which 2 ms to minimize.
[2024-05-27 22:48:49] [INFO ] Deduced a trap composed of 177 places in 252 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 22:48:49] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 48 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 22:48:53] [INFO ] Deduced a trap composed of 141 places in 240 ms of which 3 ms to minimize.
[2024-05-27 22:48:54] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-05-27 22:49:07] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
[2024-05-27 22:49:07] [INFO ] Deduced a trap composed of 139 places in 209 ms of which 2 ms to minimize.
[2024-05-27 22:49:07] [INFO ] Deduced a trap composed of 193 places in 207 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1580 variables, and 53 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 17/17 constraints]
After SMT, in 44890ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 44901ms
[2024-05-27 22:49:09] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-27 22:49:09] [INFO ] Invariant cache hit.
[2024-05-27 22:49:10] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-27 22:49:10] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-27 22:49:10] [INFO ] Invariant cache hit.
[2024-05-27 22:49:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:49:15] [INFO ] Implicit Places using invariants and state equation in 4967 ms returned []
Implicit Place search using SMT with State Equation took 5300 ms to find 0 implicit places.
[2024-05-27 22:49:15] [INFO ] Redundant transitions in 9 ms returned []
Running 1212 sub problems to find dead transitions.
[2024-05-27 22:49:15] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-05-27 22:49:15] [INFO ] Invariant cache hit.
[2024-05-27 22:49:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 22:49:27] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-05-27 22:49:27] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-27 22:49:27] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 0 ms to minimize.
[2024-05-27 22:49:27] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-27 22:49:27] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:49:27] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:49:28] [INFO ] Deduced a trap composed of 149 places in 212 ms of which 2 ms to minimize.
[2024-05-27 22:49:28] [INFO ] Deduced a trap composed of 173 places in 214 ms of which 2 ms to minimize.
[2024-05-27 22:49:28] [INFO ] Deduced a trap composed of 180 places in 235 ms of which 2 ms to minimize.
[2024-05-27 22:49:37] [INFO ] Deduced a trap composed of 155 places in 201 ms of which 3 ms to minimize.
[2024-05-27 22:49:37] [INFO ] Deduced a trap composed of 144 places in 202 ms of which 2 ms to minimize.
[2024-05-27 22:49:38] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 2 ms to minimize.
[2024-05-27 22:49:38] [INFO ] Deduced a trap composed of 81 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 22:49:41] [INFO ] Deduced a trap composed of 155 places in 233 ms of which 2 ms to minimize.
[2024-05-27 22:49:41] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 2 ms to minimize.
[2024-05-27 22:49:41] [INFO ] Deduced a trap composed of 154 places in 213 ms of which 2 ms to minimize.
[2024-05-27 22:49:42] [INFO ] Deduced a trap composed of 202 places in 222 ms of which 2 ms to minimize.
[2024-05-27 22:49:49] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 54 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 22:49:51] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2024-05-27 22:49:51] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-27 22:49:51] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-05-27 22:50:04] [INFO ] Deduced a trap composed of 152 places in 218 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1580 variables, and 58 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 22/22 constraints]
After SMT, in 65028ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 65040ms
Starting structural reductions in SI_LTL mode, iteration 1 : 388/418 places, 1216/1246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115293 ms. Remains : 388/418 places, 1216/1246 transitions.
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-13 finished in 333696 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) U p1))||G(p2)))'
Support contains 19 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 538 transition count 1366
Applied a total of 4 rules in 8 ms. Remains 538 /542 variables (removed 4) and now considering 1366/1366 (removed 0) transitions.
Running 1362 sub problems to find dead transitions.
[2024-05-27 22:50:20] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 538 cols
[2024-05-27 22:50:20] [INFO ] Computed 40 invariants in 18 ms
[2024-05-27 22:50:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:50:35] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
[2024-05-27 22:50:35] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2024-05-27 22:50:35] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:50:35] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 0 ms to minimize.
[2024-05-27 22:50:35] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 0 ms to minimize.
[2024-05-27 22:50:35] [INFO ] Deduced a trap composed of 356 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:50:36] [INFO ] Deduced a trap composed of 313 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:50:36] [INFO ] Deduced a trap composed of 133 places in 206 ms of which 3 ms to minimize.
[2024-05-27 22:50:36] [INFO ] Deduced a trap composed of 149 places in 231 ms of which 2 ms to minimize.
[2024-05-27 22:50:36] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:50:37] [INFO ] Deduced a trap composed of 284 places in 230 ms of which 3 ms to minimize.
[2024-05-27 22:50:37] [INFO ] Deduced a trap composed of 315 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:50:38] [INFO ] Deduced a trap composed of 322 places in 274 ms of which 3 ms to minimize.
[2024-05-27 22:50:44] [INFO ] Deduced a trap composed of 298 places in 363 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 (/ 1.0 3.0))
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 (/ 2.0 3.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 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.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 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.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 1.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 1.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 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.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 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 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 (/ 8.0 3.0))
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 (/ 2.0 3.0))
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.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 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 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 534/1880 variables, and 50 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:50:47] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-05-27 22:50:48] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 2 ms to minimize.
[2024-05-27 22:50:55] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 2 ms to minimize.
[2024-05-27 22:50:55] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-27 22:51:02] [INFO ] Deduced a trap composed of 296 places in 223 ms of which 3 ms to minimize.
[2024-05-27 22:51:02] [INFO ] Deduced a trap composed of 275 places in 273 ms of which 3 ms to minimize.
[2024-05-27 22:51:03] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 3 ms to minimize.
[2024-05-27 22:51:03] [INFO ] Deduced a trap composed of 295 places in 220 ms of which 3 ms to minimize.
[2024-05-27 22:51:03] [INFO ] Deduced a trap composed of 290 places in 232 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1880 variables, and 59 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 23/23 constraints]
After SMT, in 44927ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 44942ms
[2024-05-27 22:51:05] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-27 22:51:05] [INFO ] Invariant cache hit.
[2024-05-27 22:51:05] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-27 22:51:05] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-27 22:51:05] [INFO ] Invariant cache hit.
[2024-05-27 22:51:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:51:12] [INFO ] Implicit Places using invariants and state equation in 7013 ms returned []
Implicit Place search using SMT with State Equation took 7433 ms to find 0 implicit places.
Running 1362 sub problems to find dead transitions.
[2024-05-27 22:51:12] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-27 22:51:12] [INFO ] Invariant cache hit.
[2024-05-27 22:51:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:51:30] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:51:31] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2024-05-27 22:51:31] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:51:31] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:51:31] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 0 ms to minimize.
[2024-05-27 22:51:32] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2024-05-27 22:51:33] [INFO ] Deduced a trap composed of 305 places in 278 ms of which 2 ms to minimize.
[2024-05-27 22:51:34] [INFO ] Deduced a trap composed of 328 places in 289 ms of which 3 ms to minimize.
[2024-05-27 22:51:34] [INFO ] Deduced a trap composed of 43 places in 329 ms of which 3 ms to minimize.
[2024-05-27 22:51:35] [INFO ] Deduced a trap composed of 321 places in 344 ms of which 5 ms to minimize.
[2024-05-27 22:51:35] [INFO ] Deduced a trap composed of 308 places in 291 ms of which 3 ms to minimize.
[2024-05-27 22:51:35] [INFO ] Deduced a trap composed of 314 places in 272 ms of which 3 ms to minimize.
[2024-05-27 22:51:35] [INFO ] Deduced a trap composed of 300 places in 271 ms of which 3 ms to minimize.
[2024-05-27 22:51:36] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 3 ms to minimize.
[2024-05-27 22:51:36] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 3 ms to minimize.
[2024-05-27 22:51:36] [INFO ] Deduced a trap composed of 338 places in 290 ms of which 3 ms to minimize.
[2024-05-27 22:51:37] [INFO ] Deduced a trap composed of 318 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:51:37] [INFO ] Deduced a trap composed of 289 places in 277 ms of which 3 ms to minimize.
[2024-05-27 22:51:45] [INFO ] Deduced a trap composed of 299 places in 259 ms of which 3 ms to minimize.
[2024-05-27 22:51:45] [INFO ] Deduced a trap composed of 292 places in 248 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:51:46] [INFO ] Deduced a trap composed of 170 places in 237 ms of which 3 ms to minimize.
[2024-05-27 22:51:46] [INFO ] Deduced a trap composed of 143 places in 230 ms of which 3 ms to minimize.
[2024-05-27 22:51:47] [INFO ] Deduced a trap composed of 275 places in 242 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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1880 variables, and 59 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:51:49] [INFO ] Deduced a trap composed of 313 places in 257 ms of which 3 ms to minimize.
[2024-05-27 22:51:50] [INFO ] Deduced a trap composed of 63 places in 219 ms of which 2 ms to minimize.
[2024-05-27 22:52:05] [INFO ] Deduced a trap composed of 259 places in 247 ms of which 3 ms to minimize.
[2024-05-27 22:52:05] [INFO ] Deduced a trap composed of 277 places in 248 ms of which 3 ms to minimize.
[2024-05-27 22:52:08] [INFO ] Deduced a trap composed of 234 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 22:52:16] [INFO ] Deduced a trap composed of 311 places in 246 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 534/1880 variables, and 65 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 29/29 constraints]
After SMT, in 65040ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 65054ms
Starting structural reductions in LTL mode, iteration 1 : 538/542 places, 1366/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117448 ms. Remains : 538/542 places, 1366/1366 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 128 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-14 finished in 117709 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
[2024-05-27 22:52:18] [INFO ] Flatten gal took : 91 ms
[2024-05-27 22:52:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-27 22:52:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 542 places, 1366 transitions and 6972 arcs took 13 ms.
Total runtime 1255349 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J04T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 542
TRANSITIONS: 1366
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.031s, Sys 0.003s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2473
MODEL NAME: /home/mcc/execution/418/model
542 places, 1366 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-S04J04T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-COL-S04J04T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T06.tgz
mv PolyORBLF-COL-S04J04T06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;